./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_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_76-tricky_address3_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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:24:34,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:24:34,970 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:34,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:24:34,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:24:35,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:24:35,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:24:35,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:24:35,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:24:35,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:24:35,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:24:35,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:24:35,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:24:35,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:24:35,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:24:35,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:24:35,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:24:35,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:24:35,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:24:35,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:24:35,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:24:35,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:24:35,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:24:35,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:24:35,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:24:35,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:24:35,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:24:35,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:24:35,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:24:35,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:24:35,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:24:35,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:24:35,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:24:35,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:24:35,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:24:35,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:24:35,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:24:35,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:24:35,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:24:35,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:24:35,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:24:35,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:24:35,043 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2024-11-10 10:24:35,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:24:35,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:24:35,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:24:35,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:24:35,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:24:35,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2024-11-10 10:24:36,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:24:37,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:24:37,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2024-11-10 10:24:37,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468b856a1/7fd19c8755d9498aa5a3a8c6d4298571/FLAGc3003d97a [2024-11-10 10:24:37,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/468b856a1/7fd19c8755d9498aa5a3a8c6d4298571 [2024-11-10 10:24:37,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:24:37,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:24:37,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:24:37,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:24:37,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:24:37,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:37" (1/1) ... [2024-11-10 10:24:37,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a037660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:37, skipping insertion in model container [2024-11-10 10:24:37,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:24:37" (1/1) ... [2024-11-10 10:24:37,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:24:37,894 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_76-tricky_address3_racefree.i[41323,41336] [2024-11-10 10:24:37,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:24:37,970 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:24:38,005 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_76-tricky_address3_racefree.i[41323,41336] [2024-11-10 10:24:38,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:24:38,074 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:24:38,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:38 WrapperNode [2024-11-10 10:24:38,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:24:38,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:24:38,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:24:38,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:24:38,083 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:38" (1/1) ... [2024-11-10 10:24:38,112 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:38" (1/1) ... [2024-11-10 10:24:38,157 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 262 [2024-11-10 10:24:38,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:24:38,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:24:38,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:24:38,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:24:38,174 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:38" (1/1) ... [2024-11-10 10:24:38,174 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:38" (1/1) ... [2024-11-10 10:24:38,179 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:38" (1/1) ... [2024-11-10 10:24:38,212 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2024-11-10 10:24:38,213 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:38" (1/1) ... [2024-11-10 10:24:38,213 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:38" (1/1) ... [2024-11-10 10:24:38,232 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:38" (1/1) ... [2024-11-10 10:24:38,233 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:38" (1/1) ... [2024-11-10 10:24:38,234 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:38" (1/1) ... [2024-11-10 10:24:38,240 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:38" (1/1) ... [2024-11-10 10:24:38,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:24:38,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:24:38,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:24:38,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:24:38,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:38" (1/1) ... [2024-11-10 10:24:38,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:24:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:38,295 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:38,297 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:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 10:24:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 10:24:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:24:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:24:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:24:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:24:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 10:24:38,352 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 10:24:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:24:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:24:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:24:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 10:24:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:24:38,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:24:38,358 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:38,508 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:24:38,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:24:38,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 10:24:38,774 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 10:24:38,872 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:24:38,872 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:24:39,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:24:39,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:24:39,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:39 BoogieIcfgContainer [2024-11-10 10:24:39,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:24:39,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:24:39,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:24:39,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:24:39,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:24:37" (1/3) ... [2024-11-10 10:24:39,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f675a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:39, skipping insertion in model container [2024-11-10 10:24:39,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:24:38" (2/3) ... [2024-11-10 10:24:39,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f675a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:24:39, skipping insertion in model container [2024-11-10 10:24:39,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:24:39" (3/3) ... [2024-11-10 10:24:39,318 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2024-11-10 10:24:39,334 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:24:39,335 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:24:39,335 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:24:39,399 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 10:24:39,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 223 flow [2024-11-10 10:24:39,501 INFO L124 PetriNetUnfolderBase]: 43/161 cut-off events. [2024-11-10 10:24:39,504 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:24:39,510 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 636 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:39,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 108 transitions, 223 flow [2024-11-10 10:24:39,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 106 transitions, 216 flow [2024-11-10 10:24:39,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:39,536 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;@70e33dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:39,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:24:39,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:39,547 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-11-10 10:24:39,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:39,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:39,548 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:39,549 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:39,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1673192242, now seen corresponding path program 1 times [2024-11-10 10:24:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:39,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450948904] [2024-11-10 10:24:39,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:39,806 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:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450948904] [2024-11-10 10:24:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450948904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:39,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:39,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347745140] [2024-11-10 10:24:39,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:39,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 108 [2024-11-10 10:24:39,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 216 flow. Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 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,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:39,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 108 [2024-11-10 10:24:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:40,148 INFO L124 PetriNetUnfolderBase]: 443/1320 cut-off events. [2024-11-10 10:24:40,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:40,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 1320 events. 443/1320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8935 event pairs, 399 based on Foata normal form. 464/1712 useless extension candidates. Maximal degree in co-relation 2123. Up to 875 conditions per place. [2024-11-10 10:24:40,164 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 44 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2024-11-10 10:24:40,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 254 flow [2024-11-10 10:24:40,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:24:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:24:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 143 transitions. [2024-11-10 10:24:40,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6620370370370371 [2024-11-10 10:24:40,179 INFO L175 Difference]: Start difference. First operand has 81 places, 106 transitions, 216 flow. Second operand 2 states and 143 transitions. [2024-11-10 10:24:40,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 254 flow [2024-11-10 10:24:40,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:40,186 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 166 flow [2024-11-10 10:24:40,189 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:40,194 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2024-11-10 10:24:40,195 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 166 flow [2024-11-10 10:24:40,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 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:40,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:40,195 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:40,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:24:40,196 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:40,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash 835209730, now seen corresponding path program 1 times [2024-11-10 10:24:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854366698] [2024-11-10 10:24:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:40,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:40,354 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:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:40,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854366698] [2024-11-10 10:24:40,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854366698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:40,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:40,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:40,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723360020] [2024-11-10 10:24:40,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:40,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:24:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:24:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:24:40,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 108 [2024-11-10 10:24:40,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:40,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:40,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 108 [2024-11-10 10:24:40,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:40,594 INFO L124 PetriNetUnfolderBase]: 443/1322 cut-off events. [2024-11-10 10:24:40,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:24:40,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1322 events. 443/1322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8941 event pairs, 399 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 2200. Up to 876 conditions per place. [2024-11-10 10:24:40,601 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 44 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2024-11-10 10:24:40,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 260 flow [2024-11-10 10:24:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:24:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:24:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-10 10:24:40,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2024-11-10 10:24:40,606 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 166 flow. Second operand 3 states and 155 transitions. [2024-11-10 10:24:40,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 260 flow [2024-11-10 10:24:40,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:40,610 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 178 flow [2024-11-10 10:24:40,610 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:40,612 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 4 predicate places. [2024-11-10 10:24:40,612 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 178 flow [2024-11-10 10:24:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:40,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:40,614 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:24:40,615 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:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1235046292, now seen corresponding path program 1 times [2024-11-10 10:24:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127713427] [2024-11-10 10:24:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:40,728 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:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127713427] [2024-11-10 10:24:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127713427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609738198] [2024-11-10 10:24:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:40,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:40,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:40,733 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:40,734 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:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:40,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:24:40,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:40,911 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:40,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:40,938 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:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609738198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:40,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:24:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720071089] [2024-11-10 10:24:40,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:40,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:24:40,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:40,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:24:40,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:24:40,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 108 [2024-11-10 10:24:40,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 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:40,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:40,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 108 [2024-11-10 10:24:40,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:41,225 INFO L124 PetriNetUnfolderBase]: 443/1328 cut-off events. [2024-11-10 10:24:41,225 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 10:24:41,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1328 events. 443/1328 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8943 event pairs, 399 based on Foata normal form. 0/1255 useless extension candidates. Maximal degree in co-relation 2217. Up to 876 conditions per place. [2024-11-10 10:24:41,232 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 44 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2024-11-10 10:24:41,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 85 transitions, 288 flow [2024-11-10 10:24:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:24:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:24:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2024-11-10 10:24:41,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41358024691358025 [2024-11-10 10:24:41,236 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 178 flow. Second operand 6 states and 268 transitions. [2024-11-10 10:24:41,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 85 transitions, 288 flow [2024-11-10 10:24:41,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:41,239 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 212 flow [2024-11-10 10:24:41,240 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:41,241 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 11 predicate places. [2024-11-10 10:24:41,241 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 212 flow [2024-11-10 10:24:41,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 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:41,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:41,242 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:41,261 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:41,442 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:41,443 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:41,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1797999446, now seen corresponding path program 2 times [2024-11-10 10:24:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020671114] [2024-11-10 10:24:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:41,610 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:41,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020671114] [2024-11-10 10:24:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020671114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342907577] [2024-11-10 10:24:41,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:24:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:41,613 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:41,614 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:41,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:24:41,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:24:41,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:24:41,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:41,756 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:41,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:41,830 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:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342907577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:41,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 10:24:41,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834358576] [2024-11-10 10:24:41,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:41,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:24:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:24:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:24:41,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 108 [2024-11-10 10:24:41,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 212 flow. Second operand has 13 states, 13 states have (on average 37.38461538461539) internal successors, (486), 13 states have internal predecessors, (486), 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:41,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:41,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 108 [2024-11-10 10:24:41,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:42,119 INFO L124 PetriNetUnfolderBase]: 443/1340 cut-off events. [2024-11-10 10:24:42,119 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-10 10:24:42,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 1340 events. 443/1340 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8927 event pairs, 399 based on Foata normal form. 6/1274 useless extension candidates. Maximal degree in co-relation 2258. Up to 876 conditions per place. [2024-11-10 10:24:42,127 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 44 selfloop transitions, 11 changer transitions 0/91 dead transitions. [2024-11-10 10:24:42,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 91 transitions, 358 flow [2024-11-10 10:24:42,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:24:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:24:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 493 transitions. [2024-11-10 10:24:42,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38040123456790126 [2024-11-10 10:24:42,130 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 212 flow. Second operand 12 states and 493 transitions. [2024-11-10 10:24:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 91 transitions, 358 flow [2024-11-10 10:24:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 91 transitions, 350 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:42,133 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 288 flow [2024-11-10 10:24:42,134 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:42,135 INFO L277 CegarLoopForPetriNet]: 81 programPoint places, 27 predicate places. [2024-11-10 10:24:42,135 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 288 flow [2024-11-10 10:24:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.38461538461539) internal successors, (486), 13 states have internal predecessors, (486), 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,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:42,136 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:42,153 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:42,336 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:42,337 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:42,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1371384230, now seen corresponding path program 3 times [2024-11-10 10:24:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:42,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056280834] [2024-11-10 10:24:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:42,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:24:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:42,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:24:42,442 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:24:42,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-10 10:24:42,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-10 10:24:42,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-10 10:24:42,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-10 10:24:42,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:24:42,448 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:24:42,450 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:24:42,452 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 10:24:42,481 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:24:42,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 154 transitions, 324 flow [2024-11-10 10:24:42,519 INFO L124 PetriNetUnfolderBase]: 72/270 cut-off events. [2024-11-10 10:24:42,519 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 10:24:42,521 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 1242 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:42,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 154 transitions, 324 flow [2024-11-10 10:24:42,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 154 transitions, 324 flow [2024-11-10 10:24:42,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:42,526 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;@70e33dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:42,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:24:42,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:42,536 INFO L124 PetriNetUnfolderBase]: 18/95 cut-off events. [2024-11-10 10:24:42,536 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:24:42,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:42,536 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:42,536 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:42,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 154439671, now seen corresponding path program 1 times [2024-11-10 10:24:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081028365] [2024-11-10 10:24:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:42,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:42,561 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:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:42,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081028365] [2024-11-10 10:24:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081028365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:42,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717105588] [2024-11-10 10:24:42,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:42,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:42,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:42,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 154 [2024-11-10 10:24:42,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 154 transitions, 324 flow. Second operand has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:42,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 154 [2024-11-10 10:24:42,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:46,121 INFO L124 PetriNetUnfolderBase]: 18185/36569 cut-off events. [2024-11-10 10:24:46,122 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-10 10:24:46,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63618 conditions, 36569 events. 18185/36569 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 359068 event pairs, 16834 based on Foata normal form. 13942/48047 useless extension candidates. Maximal degree in co-relation 52172. Up to 26942 conditions per place. [2024-11-10 10:24:46,331 INFO L140 encePairwiseOnDemand]: 118/154 looper letters, 67 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2024-11-10 10:24:46,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 118 transitions, 386 flow [2024-11-10 10:24:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:24:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:24:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2024-11-10 10:24:46,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6655844155844156 [2024-11-10 10:24:46,333 INFO L175 Difference]: Start difference. First operand has 117 places, 154 transitions, 324 flow. Second operand 2 states and 205 transitions. [2024-11-10 10:24:46,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 118 transitions, 386 flow [2024-11-10 10:24:46,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:46,338 INFO L231 Difference]: Finished difference. Result has 118 places, 118 transitions, 252 flow [2024-11-10 10:24:46,338 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:46,339 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-10 10:24:46,339 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 118 transitions, 252 flow [2024-11-10 10:24:46,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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:46,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:46,340 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:24:46,341 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:46,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1081083423, now seen corresponding path program 1 times [2024-11-10 10:24:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350322493] [2024-11-10 10:24:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:46,385 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:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350322493] [2024-11-10 10:24:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350322493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:46,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:46,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717797076] [2024-11-10 10:24:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:46,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:24:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:24:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:24:46,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2024-11-10 10:24:46,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 118 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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:46,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:46,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2024-11-10 10:24:46,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:49,160 INFO L124 PetriNetUnfolderBase]: 18185/36571 cut-off events. [2024-11-10 10:24:49,160 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-10 10:24:49,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63623 conditions, 36571 events. 18185/36571 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 359041 event pairs, 16834 based on Foata normal form. 0/34106 useless extension candidates. Maximal degree in co-relation 63618. Up to 26943 conditions per place. [2024-11-10 10:24:49,328 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 67 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-11-10 10:24:49,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 392 flow [2024-11-10 10:24:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:24:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:24:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-11-10 10:24:49,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-11-10 10:24:49,330 INFO L175 Difference]: Start difference. First operand has 118 places, 118 transitions, 252 flow. Second operand 3 states and 220 transitions. [2024-11-10 10:24:49,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 392 flow [2024-11-10 10:24:49,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:24:49,334 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 264 flow [2024-11-10 10:24:49,334 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:49,335 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2024-11-10 10:24:49,336 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 264 flow [2024-11-10 10:24:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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:49,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:49,337 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:49,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:24:49,337 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:49,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1112285195, now seen corresponding path program 1 times [2024-11-10 10:24:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:49,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925890125] [2024-11-10 10:24:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:49,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:49,424 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:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925890125] [2024-11-10 10:24:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925890125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755464038] [2024-11-10 10:24:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:49,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:49,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:49,427 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:49,429 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:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:49,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 10:24:49,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:49,555 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:49,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:49,581 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:49,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755464038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:49,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:49,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 10:24:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234694413] [2024-11-10 10:24:49,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:49,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:24:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:49,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:24:49,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:24:49,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2024-11-10 10:24:49,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 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:49,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:49,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2024-11-10 10:24:49,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:52,376 INFO L124 PetriNetUnfolderBase]: 18185/36577 cut-off events. [2024-11-10 10:24:52,377 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-11-10 10:24:52,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63642 conditions, 36577 events. 18185/36577 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 359040 event pairs, 16834 based on Foata normal form. 0/34112 useless extension candidates. Maximal degree in co-relation 63635. Up to 26943 conditions per place. [2024-11-10 10:24:52,572 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 67 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2024-11-10 10:24:52,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 420 flow [2024-11-10 10:24:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:24:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:24:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 375 transitions. [2024-11-10 10:24:52,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40584415584415584 [2024-11-10 10:24:52,578 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 264 flow. Second operand 6 states and 375 transitions. [2024-11-10 10:24:52,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 420 flow [2024-11-10 10:24:52,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:52,584 INFO L231 Difference]: Finished difference. Result has 128 places, 122 transitions, 298 flow [2024-11-10 10:24:52,585 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:52,585 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 11 predicate places. [2024-11-10 10:24:52,587 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 298 flow [2024-11-10 10:24:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.857142857142854) internal successors, (363), 7 states have internal predecessors, (363), 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:52,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:52,587 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:52,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:24:52,788 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:52,788 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:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1164821385, now seen corresponding path program 2 times [2024-11-10 10:24:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081813488] [2024-11-10 10:24:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:52,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:52,907 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:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081813488] [2024-11-10 10:24:52,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081813488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:24:52,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339616587] [2024-11-10 10:24:52,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:24:52,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:24:52,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:24:52,910 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:52,911 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:53,023 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:24:53,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:24:53,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:24:53,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:24:53,047 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:53,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:24:53,108 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:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339616587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:24:53,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:24:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 10:24:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888298937] [2024-11-10 10:24:53,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:24:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:24:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:24:53,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:24:53,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2024-11-10 10:24:53,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 51.46153846153846) internal successors, (669), 13 states have internal predecessors, (669), 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:53,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:53,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2024-11-10 10:24:53,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:24:56,076 INFO L124 PetriNetUnfolderBase]: 18185/36589 cut-off events. [2024-11-10 10:24:56,076 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2024-11-10 10:24:56,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63686 conditions, 36589 events. 18185/36589 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 359264 event pairs, 16834 based on Foata normal form. 6/34131 useless extension candidates. Maximal degree in co-relation 63676. Up to 26943 conditions per place. [2024-11-10 10:24:56,300 INFO L140 encePairwiseOnDemand]: 151/154 looper letters, 67 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2024-11-10 10:24:56,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 128 transitions, 490 flow [2024-11-10 10:24:56,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:24:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:24:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 684 transitions. [2024-11-10 10:24:56,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37012987012987014 [2024-11-10 10:24:56,305 INFO L175 Difference]: Start difference. First operand has 128 places, 122 transitions, 298 flow. Second operand 12 states and 684 transitions. [2024-11-10 10:24:56,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 128 transitions, 490 flow [2024-11-10 10:24:56,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 128 transitions, 482 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 10:24:56,312 INFO L231 Difference]: Finished difference. Result has 144 places, 128 transitions, 374 flow [2024-11-10 10:24:56,313 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:56,314 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2024-11-10 10:24:56,314 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 128 transitions, 374 flow [2024-11-10 10:24:56,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.46153846153846) internal successors, (669), 13 states have internal predecessors, (669), 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:56,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:56,316 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:56,335 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:56,517 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:56,517 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:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2015143685, now seen corresponding path program 3 times [2024-11-10 10:24:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218793845] [2024-11-10 10:24:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:56,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:24:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:24:56,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:24:56,581 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:24:56,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-10 10:24:56,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:24:56,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:24:56,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:24:56,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-10 10:24:56,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:24:56,583 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-10 10:24:56,584 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 10:24:56,584 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 10:24:56,621 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 10:24:56,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 200 transitions, 427 flow [2024-11-10 10:24:56,661 INFO L124 PetriNetUnfolderBase]: 106/396 cut-off events. [2024-11-10 10:24:56,661 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 10:24:56,665 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 1925 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:56,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 200 transitions, 427 flow [2024-11-10 10:24:56,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 200 transitions, 427 flow [2024-11-10 10:24:56,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:24:56,674 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;@70e33dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:24:56,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:24:56,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:24:56,682 INFO L124 PetriNetUnfolderBase]: 20/106 cut-off events. [2024-11-10 10:24:56,682 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 10:24:56,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:24:56,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:24:56,683 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:56,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:24:56,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1951443612, now seen corresponding path program 1 times [2024-11-10 10:24:56,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:24:56,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175354813] [2024-11-10 10:24:56,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:24:56,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:24:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:24:56,700 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:56,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:24:56,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175354813] [2024-11-10 10:24:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175354813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:24:56,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:24:56,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:24:56,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661560657] [2024-11-10 10:24:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:24:56,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:24:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:24:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:24:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:24:56,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 200 [2024-11-10 10:24:56,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 200 transitions, 427 flow. Second operand has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 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:56,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:24:56,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 200 [2024-11-10 10:24:56,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand