./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_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 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:24:24,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:24:24,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:24:24,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:24:24,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:24:24,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:24:24,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:24:24,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:24:24,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:24:24,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:24:24,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:24:24,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:24:24,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:24:24,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:24:24,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:24:24,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:24:24,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:24:24,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:24:24,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:24:24,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:24:24,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:24:24,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:24:24,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:24:24,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:24:24,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:24:24,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:24:24,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:24:24,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:24:24,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:24:24,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:24:24,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:24:24,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:24:24,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:24:24,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:24:24,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:24:24,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:24:24,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:24:24,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:24:24,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:24:24,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:24:24,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:24:24,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:24:24,136 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 -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 [2024-11-10 10:24:24,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:24:24,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:24:24,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:24:24,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:24:24,339 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:24:24,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2024-11-10 10:24:25,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:24:25,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:24:25,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2024-11-10 10:24:25,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6de6f35/34e7a16753c94e1f9f74640b091c9a90/FLAG0786dc6fa [2024-11-10 10:24:25,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6de6f35/34e7a16753c94e1f9f74640b091c9a90 [2024-11-10 10:24:25,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:24:25,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:24:25,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:24:25,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:24:25,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:24:25,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:25" (1/1) ... [2024-11-10 10:24:25,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbdae3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:25, skipping insertion in model container [2024-11-10 10:24:25,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:25" (1/1) ... [2024-11-10 10:24:26,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:24:26,451 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_74-tricky_address1_racefree.i[41323,41336] [2024-11-10 10:24:26,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:24:26,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:24:26,582 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_74-tricky_address1_racefree.i[41323,41336] [2024-11-10 10:24:26,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:24:26,647 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:24:26,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26 WrapperNode [2024-11-10 10:24:26,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:24:26,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:24:26,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:24:26,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:24:26,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,712 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 259 [2024-11-10 10:24:26,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:24:26,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:24:26,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:24:26,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:24:26,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,761 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 70, 5, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 5, 0]. The 5 writes are split as follows [0, 4, 0, 1]. [2024-11-10 10:24:26,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:24:26,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:24:26,788 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:24:26,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:24:26,789 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (1/1) ... [2024-11-10 10:24:26,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:24:26,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:26,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:24:26,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:24:26,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 10:24:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 10:24:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:24:26,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:24:26,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 10:24:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:24:26,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:24:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 10:24:26,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 10:24:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:24:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:24:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:24:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 10:24:26,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:24:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:24:26,881 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:24:27,016 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:24:27,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:24:27,260 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 10:24:27,261 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 10:24:27,327 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:24:27,328 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:24:27,709 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:24:27,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:24:27,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:27 BoogieIcfgContainer [2024-11-10 10:24:27,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:24:27,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:24:27,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:24:27,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:24:27,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:24:25" (1/3) ... [2024-11-10 10:24:27,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69571d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:27, skipping insertion in model container [2024-11-10 10:24:27,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:26" (2/3) ... [2024-11-10 10:24:27,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69571d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:27, skipping insertion in model container [2024-11-10 10:24:27,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:27" (3/3) ... [2024-11-10 10:24:27,732 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2024-11-10 10:24:27,789 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:24:27,789 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:24:27,789 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:24:27,839 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 10:24:27,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 223 flow [2024-11-10 10:24:27,946 INFO L124 PetriNetUnfolderBase]: 43/161 cut-off events. [2024-11-10 10:24:27,946 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:24:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 161 events. 43/161 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 639 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2024-11-10 10:24:27,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 108 transitions, 223 flow [2024-11-10 10:24:27,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 106 transitions, 216 flow [2024-11-10 10:24:27,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:27,971 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;@3cac258f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:27,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:24:27,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:27,980 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-11-10 10:24:27,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:27,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:27,981 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:27,981 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-10 10:24:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -782336404, now seen corresponding path program 1 times [2024-11-10 10:24:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634573882] [2024-11-10 10:24:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:28,204 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-10 10:24:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634573882] [2024-11-10 10:24:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634573882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:28,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634363813] [2024-11-10 10:24:28,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:28,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:28,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:28,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:28,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 108 [2024-11-10 10:24:28,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 216 flow. Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:28,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:28,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 108 [2024-11-10 10:24:28,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:28,448 INFO L124 PetriNetUnfolderBase]: 421/1269 cut-off events. [2024-11-10 10:24:28,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:28,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 1269 events. 421/1269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8577 event pairs, 378 based on Foata normal form. 453/1653 useless extension candidates. Maximal degree in co-relation 2029. Up to 832 conditions per place. [2024-11-10 10:24:28,467 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 43 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2024-11-10 10:24:28,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 252 flow [2024-11-10 10:24:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:24:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:24:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 144 transitions. [2024-11-10 10:24:28,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-10 10:24:28,483 INFO L175 Difference]: Start difference. First operand has 81 places, 106 transitions, 216 flow. Second operand 2 states and 144 transitions. [2024-11-10 10:24:28,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 252 flow [2024-11-10 10:24:28,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:28,490 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 166 flow [2024-11-10 10:24:28,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2024-11-10 10:24:28,497 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2024-11-10 10:24:28,498 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 166 flow [2024-11-10 10:24:28,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:28,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:28,499 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:28,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:24:28,499 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-10 10:24:28,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:28,501 INFO L85 PathProgramCache]: Analyzing trace with hash 327954034, now seen corresponding path program 1 times [2024-11-10 10:24:28,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:28,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137917795] [2024-11-10 10:24:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:28,628 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-10 10:24:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137917795] [2024-11-10 10:24:28,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137917795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451138294] [2024-11-10 10:24:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:24:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:28,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:24:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:24:28,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 108 [2024-11-10 10:24:28,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:28,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:28,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 108 [2024-11-10 10:24:28,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:28,914 INFO L124 PetriNetUnfolderBase]: 421/1271 cut-off events. [2024-11-10 10:24:28,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:28,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1271 events. 421/1271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8560 event pairs, 378 based on Foata normal form. 0/1201 useless extension candidates. Maximal degree in co-relation 2106. Up to 833 conditions per place. [2024-11-10 10:24:28,927 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 43 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-11-10 10:24:28,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 258 flow [2024-11-10 10:24:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:24:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:24:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2024-11-10 10:24:28,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-11-10 10:24:28,938 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 166 flow. Second operand 3 states and 157 transitions. [2024-11-10 10:24:28,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 258 flow [2024-11-10 10:24:28,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:28,945 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 178 flow [2024-11-10 10:24:28,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2024-11-10 10:24:28,946 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 4 predicate places. [2024-11-10 10:24:28,947 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 178 flow [2024-11-10 10:24:28,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:28,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:28,947 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:28,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:24:28,947 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-10 10:24:28,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2082791684, now seen corresponding path program 1 times [2024-11-10 10:24:28,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:28,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673968278] [2024-11-10 10:24:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:29,103 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-10 10:24:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:29,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673968278] [2024-11-10 10:24:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673968278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:29,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732221169] [2024-11-10 10:24:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:29,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:29,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:29,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 10:24:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:29,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:24:29,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:29,253 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-10 10:24:29,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:29,304 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-10 10:24:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732221169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:29,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:24:29,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340046615] [2024-11-10 10:24:29,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:29,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:24:29,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:29,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:24:29,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:24:29,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 108 [2024-11-10 10:24:29,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:29,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:29,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 108 [2024-11-10 10:24:29,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:29,517 INFO L124 PetriNetUnfolderBase]: 421/1277 cut-off events. [2024-11-10 10:24:29,518 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 10:24:29,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2129 conditions, 1277 events. 421/1277 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8572 event pairs, 378 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 2123. Up to 833 conditions per place. [2024-11-10 10:24:29,522 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 43 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2024-11-10 10:24:29,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 286 flow [2024-11-10 10:24:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:24:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:24:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2024-11-10 10:24:29,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2024-11-10 10:24:29,525 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 178 flow. Second operand 6 states and 273 transitions. [2024-11-10 10:24:29,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 286 flow [2024-11-10 10:24:29,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:29,526 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 212 flow [2024-11-10 10:24:29,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2024-11-10 10:24:29,527 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 11 predicate places. [2024-11-10 10:24:29,527 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 212 flow [2024-11-10 10:24:29,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:29,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:29,528 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:29,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 10:24:29,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:29,733 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-10 10:24:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash 695029178, now seen corresponding path program 2 times [2024-11-10 10:24:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062389617] [2024-11-10 10:24:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:29,893 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-10 10:24:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062389617] [2024-11-10 10:24:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062389617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556913441] [2024-11-10 10:24:29,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:24:29,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:29,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:29,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 10:24:29,988 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:24:29,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:24:29,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:24:29,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:30,016 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-10 10:24:30,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:30,068 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-10 10:24:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556913441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:30,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 10:24:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630172762] [2024-11-10 10:24:30,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:24:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:24:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:24:30,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 108 [2024-11-10 10:24:30,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 212 flow. Second operand has 13 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:30,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:30,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 108 [2024-11-10 10:24:30,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:30,272 INFO L124 PetriNetUnfolderBase]: 421/1289 cut-off events. [2024-11-10 10:24:30,273 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-10 10:24:30,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 1289 events. 421/1289 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8587 event pairs, 378 based on Foata normal form. 6/1226 useless extension candidates. Maximal degree in co-relation 2164. Up to 833 conditions per place. [2024-11-10 10:24:30,279 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 43 selfloop transitions, 11 changer transitions 0/91 dead transitions. [2024-11-10 10:24:30,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 91 transitions, 356 flow [2024-11-10 10:24:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:24:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:24:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 504 transitions. [2024-11-10 10:24:30,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-11-10 10:24:30,282 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 212 flow. Second operand 12 states and 504 transitions. [2024-11-10 10:24:30,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 91 transitions, 356 flow [2024-11-10 10:24:30,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 91 transitions, 348 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:30,285 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 288 flow [2024-11-10 10:24:30,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=108, PETRI_TRANSITIONS=91} [2024-11-10 10:24:30,287 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 27 predicate places. [2024-11-10 10:24:30,287 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 288 flow [2024-11-10 10:24:30,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:30,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:30,288 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:30,302 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-10 10:24:30,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 10:24:30,490 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-10 10:24:30,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1452271014, now seen corresponding path program 3 times [2024-11-10 10:24:30,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:30,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591720216] [2024-11-10 10:24:30,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:30,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:30,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:24:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:30,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:24:30,570 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:24:30,572 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 10:24:30,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-10 10:24:30,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-10 10:24:30,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:24:30,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:24:30,576 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:24:30,578 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:24:30,578 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:24:30,604 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:24:30,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 154 transitions, 324 flow [2024-11-10 10:24:30,625 INFO L124 PetriNetUnfolderBase]: 72/270 cut-off events. [2024-11-10 10:24:30,626 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 10:24:30,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 270 events. 72/270 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1240 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 163. Up to 12 conditions per place. [2024-11-10 10:24:30,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 154 transitions, 324 flow [2024-11-10 10:24:30,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 154 transitions, 324 flow [2024-11-10 10:24:30,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:30,630 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;@3cac258f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:30,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:24:30,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:30,635 INFO L124 PetriNetUnfolderBase]: 18/95 cut-off events. [2024-11-10 10:24:30,635 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:24:30,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:30,636 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:30,636 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-10 10:24:30,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:30,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2026095627, now seen corresponding path program 1 times [2024-11-10 10:24:30,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624164695] [2024-11-10 10:24:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:30,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:30,675 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-10 10:24:30,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:30,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624164695] [2024-11-10 10:24:30,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624164695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:30,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226598830] [2024-11-10 10:24:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:30,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:30,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:30,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:30,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:30,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 154 [2024-11-10 10:24:30,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 154 transitions, 324 flow. Second operand has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:30,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:30,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 154 [2024-11-10 10:24:30,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:33,163 INFO L124 PetriNetUnfolderBase]: 16440/33295 cut-off events. [2024-11-10 10:24:33,163 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-11-10 10:24:33,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57766 conditions, 33295 events. 16440/33295 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 327603 event pairs, 15174 based on Foata normal form. 13034/44013 useless extension candidates. Maximal degree in co-relation 46825. Up to 24369 conditions per place. [2024-11-10 10:24:33,329 INFO L140 encePairwiseOnDemand]: 118/154 looper letters, 65 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2024-11-10 10:24:33,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 118 transitions, 382 flow [2024-11-10 10:24:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:24:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:24:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 207 transitions. [2024-11-10 10:24:33,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.672077922077922 [2024-11-10 10:24:33,331 INFO L175 Difference]: Start difference. First operand has 117 places, 154 transitions, 324 flow. Second operand 2 states and 207 transitions. [2024-11-10 10:24:33,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 118 transitions, 382 flow [2024-11-10 10:24:33,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:33,336 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 252 flow [2024-11-10 10:24:33,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=252, PETRI_PLACES=118, PETRI_TRANSITIONS=118} [2024-11-10 10:24:33,337 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-10 10:24:33,337 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 252 flow [2024-11-10 10:24:33,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:33,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:33,339 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:33,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:24:33,339 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-10 10:24:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1695814613, now seen corresponding path program 1 times [2024-11-10 10:24:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366667407] [2024-11-10 10:24:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:33,388 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-10 10:24:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366667407] [2024-11-10 10:24:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366667407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:33,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:33,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814420661] [2024-11-10 10:24:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:24:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:24:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:24:33,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2024-11-10 10:24:33,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:33,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:33,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2024-11-10 10:24:33,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:36,001 INFO L124 PetriNetUnfolderBase]: 16440/33297 cut-off events. [2024-11-10 10:24:36,001 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-11-10 10:24:36,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57771 conditions, 33297 events. 16440/33297 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 327428 event pairs, 15174 based on Foata normal form. 0/30980 useless extension candidates. Maximal degree in co-relation 57766. Up to 24370 conditions per place. [2024-11-10 10:24:36,175 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 65 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-11-10 10:24:36,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 388 flow [2024-11-10 10:24:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:24:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:24:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-10 10:24:36,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-11-10 10:24:36,177 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 252 flow. Second operand 3 states and 224 transitions. [2024-11-10 10:24:36,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 388 flow [2024-11-10 10:24:36,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:36,183 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 264 flow [2024-11-10 10:24:36,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2024-11-10 10:24:36,184 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2024-11-10 10:24:36,184 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 264 flow [2024-11-10 10:24:36,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:36,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:36,185 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:24:36,185 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-10 10:24:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash 64227965, now seen corresponding path program 1 times [2024-11-10 10:24:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:36,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954761473] [2024-11-10 10:24:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:36,252 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-10 10:24:36,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:36,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954761473] [2024-11-10 10:24:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954761473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:36,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989042930] [2024-11-10 10:24:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:36,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:36,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:36,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:36,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 10:24:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:36,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:24:36,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:36,392 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-10 10:24:36,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:36,419 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-10 10:24:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989042930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:36,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:24:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980793823] [2024-11-10 10:24:36,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:36,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:24:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:24:36,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:24:36,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2024-11-10 10:24:36,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 53.857142857142854) internal successors, (377), 7 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:36,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:36,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2024-11-10 10:24:36,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:38,773 INFO L124 PetriNetUnfolderBase]: 16440/33303 cut-off events. [2024-11-10 10:24:38,773 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-10 10:24:38,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57790 conditions, 33303 events. 16440/33303 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 1035. Compared 327459 event pairs, 15174 based on Foata normal form. 0/30986 useless extension candidates. Maximal degree in co-relation 57783. Up to 24370 conditions per place. [2024-11-10 10:24:39,077 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 65 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2024-11-10 10:24:39,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 416 flow [2024-11-10 10:24:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:24:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:24:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 385 transitions. [2024-11-10 10:24:39,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-11-10 10:24:39,079 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 264 flow. Second operand 6 states and 385 transitions. [2024-11-10 10:24:39,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 416 flow [2024-11-10 10:24:39,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:39,083 INFO L231 Difference]: Finished difference. Result has 128 places, 122 transitions, 298 flow [2024-11-10 10:24:39,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=128, PETRI_TRANSITIONS=122} [2024-11-10 10:24:39,084 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2024-11-10 10:24:39,085 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 298 flow [2024-11-10 10:24:39,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.857142857142854) internal successors, (377), 7 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:39,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:39,085 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:39,102 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-10 10:24:39,285 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-10 10:24:39,287 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-10 10:24:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 989010547, now seen corresponding path program 2 times [2024-11-10 10:24:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:39,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893939232] [2024-11-10 10:24:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:39,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:39,393 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-10 10:24:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893939232] [2024-11-10 10:24:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893939232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304434696] [2024-11-10 10:24:39,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:24:39,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:39,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:24:39,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:24:39,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:24:39,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:24:39,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:24:39,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:39,514 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-10 10:24:39,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:39,570 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-10 10:24:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304434696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:39,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 10:24:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676892775] [2024-11-10 10:24:39,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:24:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:24:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:24:39,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2024-11-10 10:24:39,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:39,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:39,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2024-11-10 10:24:39,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:42,361 INFO L124 PetriNetUnfolderBase]: 16440/33315 cut-off events. [2024-11-10 10:24:42,361 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2024-11-10 10:24:42,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57834 conditions, 33315 events. 16440/33315 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 327364 event pairs, 15174 based on Foata normal form. 6/31005 useless extension candidates. Maximal degree in co-relation 57824. Up to 24370 conditions per place. [2024-11-10 10:24:42,547 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 65 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2024-11-10 10:24:42,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 128 transitions, 486 flow [2024-11-10 10:24:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:24:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:24:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 706 transitions. [2024-11-10 10:24:42,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38203463203463206 [2024-11-10 10:24:42,550 INFO L175 Difference]: Start difference. First operand has 128 places, 122 transitions, 298 flow. Second operand 12 states and 706 transitions. [2024-11-10 10:24:42,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 128 transitions, 486 flow [2024-11-10 10:24:42,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 128 transitions, 478 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:42,556 INFO L231 Difference]: Finished difference. Result has 144 places, 128 transitions, 374 flow [2024-11-10 10:24:42,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=374, PETRI_PLACES=144, PETRI_TRANSITIONS=128} [2024-11-10 10:24:42,557 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2024-11-10 10:24:42,558 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 128 transitions, 374 flow [2024-11-10 10:24:42,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:42,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:42,559 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:42,573 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-10 10:24:42,759 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-10 10:24:42,760 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-10 10:24:42,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 292595935, now seen corresponding path program 3 times [2024-11-10 10:24:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134320029] [2024-11-10 10:24:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:42,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:24:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:42,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:24:42,811 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:24:42,811 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 10:24:42,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:24:42,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:24:42,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:24:42,811 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:24:42,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:24:42,812 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:24:42,812 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:24:42,812 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:24:42,836 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 10:24:42,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 200 transitions, 427 flow [2024-11-10 10:24:42,860 INFO L124 PetriNetUnfolderBase]: 106/396 cut-off events. [2024-11-10 10:24:42,860 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 10:24:42,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 396 events. 106/396 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1936 event pairs, 1 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 278. Up to 16 conditions per place. [2024-11-10 10:24:42,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 200 transitions, 427 flow [2024-11-10 10:24:42,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 200 transitions, 427 flow [2024-11-10 10:24:42,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:42,866 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;@3cac258f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:42,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:24:42,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:42,870 INFO L124 PetriNetUnfolderBase]: 20/106 cut-off events. [2024-11-10 10:24:42,871 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:24:42,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:42,871 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:42,871 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-10 10:24:42,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1729444942, now seen corresponding path program 1 times [2024-11-10 10:24:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:42,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386091017] [2024-11-10 10:24:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:42,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:24:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386091017] [2024-11-10 10:24:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386091017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646916466] [2024-11-10 10:24:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:42,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:42,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:42,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 200 [2024-11-10 10:24:42,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 200 transitions, 427 flow. Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:24:42,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:42,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 200 [2024-11-10 10:24:42,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand