./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:07:11,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:07:11,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:07:11,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:07:11,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:07:11,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:07:11,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:07:11,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:07:11,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:07:11,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:07:11,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:07:11,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:07:11,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:07:11,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:07:11,901 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:07:11,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:07:11,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:07:11,902 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:07:11,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:07:11,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:07:11,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:07:11,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:07:11,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:07:11,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:07:11,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:07:11,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:07:11,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:07:11,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:07:11,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:07:11,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:07:11,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:07:11,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:07:11,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:07:11,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:07:11,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:07:11,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:07:11,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:07:11,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:07:11,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:07:11,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:07:11,908 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:07:11,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:07:11,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:07:11,908 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:07:12,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:07:12,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:07:12,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:07:12,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:07:12,193 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:07:12,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-02-19 14:07:13,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:07:13,641 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:07:13,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-02-19 14:07:13,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a776b72/1a9049680d9e4dc8bd1ff461846a2f6b/FLAG29217bf0e [2024-02-19 14:07:13,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a776b72/1a9049680d9e4dc8bd1ff461846a2f6b [2024-02-19 14:07:13,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:07:13,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:07:13,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:07:13,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:07:13,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:07:13,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:07:13" (1/1) ... [2024-02-19 14:07:13,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b05c9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:13, skipping insertion in model container [2024-02-19 14:07:13,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:07:13" (1/1) ... [2024-02-19 14:07:13,709 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:07:13,988 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-02-19 14:07:13,994 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:07:14,001 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:07:14,026 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-02-19 14:07:14,029 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:07:14,063 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:07:14,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14 WrapperNode [2024-02-19 14:07:14,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:07:14,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:07:14,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:07:14,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:07:14,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,115 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-02-19 14:07:14,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:07:14,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:07:14,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:07:14,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:07:14,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,149 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 5, 1, 3]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-02-19 14:07:14,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:07:14,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:07:14,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:07:14,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:07:14,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (1/1) ... [2024-02-19 14:07:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:07:14,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:07:14,198 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-02-19 14:07:14,213 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-02-19 14:07:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:07:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:07:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:07:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:07:14,248 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-19 14:07:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-19 14:07:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:07:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:07:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:07:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:07:14,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:07:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:07:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:07:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:07:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:07:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:07:14,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:07:14,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:07:14,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:07:14,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:07:14,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:07:14,252 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:07:14,345 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:07:14,347 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:07:14,447 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:07:14,447 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:07:14,535 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:07:14,538 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-19 14:07:14,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:07:14 BoogieIcfgContainer [2024-02-19 14:07:14,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:07:14,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:07:14,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:07:14,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:07:14,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:07:13" (1/3) ... [2024-02-19 14:07:14,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dc010b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:07:14, skipping insertion in model container [2024-02-19 14:07:14,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:07:14" (2/3) ... [2024-02-19 14:07:14,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54dc010b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:07:14, skipping insertion in model container [2024-02-19 14:07:14,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:07:14" (3/3) ... [2024-02-19 14:07:14,563 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-02-19 14:07:14,578 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:07:14,578 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:07:14,578 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:07:14,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:07:14,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2024-02-19 14:07:14,688 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2024-02-19 14:07:14,689 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:07:14,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-02-19 14:07:14,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2024-02-19 14:07:14,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2024-02-19 14:07:14,709 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:07:14,715 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@199a196e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:07:14,715 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 14:07:14,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:07:14,724 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-02-19 14:07:14,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:07:14,724 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:14,725 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:07:14,725 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-02-19 14:07:14,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1940293997, now seen corresponding path program 1 times [2024-02-19 14:07:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:14,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905171691] [2024-02-19 14:07:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:07:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905171691] [2024-02-19 14:07:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905171691] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:07:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849392642] [2024-02-19 14:07:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:14,898 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-19 14:07:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-19 14:07:14,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-19 14:07:14,932 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2024-02-19 14:07:14,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 19 transitions, 42 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-19 14:07:14,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:14,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2024-02-19 14:07:14,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:07:15,027 INFO L124 PetriNetUnfolderBase]: 22/59 cut-off events. [2024-02-19 14:07:15,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-19 14:07:15,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 59 events. 22/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 132 event pairs, 16 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 102. Up to 52 conditions per place. [2024-02-19 14:07:15,030 INFO L140 encePairwiseOnDemand]: 17/19 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2024-02-19 14:07:15,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 17 transitions, 66 flow [2024-02-19 14:07:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-19 14:07:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-19 14:07:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2024-02-19 14:07:15,040 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2024-02-19 14:07:15,045 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 0 predicate places. [2024-02-19 14:07:15,046 INFO L507 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 66 flow [2024-02-19 14:07:15,046 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-19 14:07:15,046 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:15,046 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-02-19 14:07:15,047 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:07:15,047 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-02-19 14:07:15,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1940283994, now seen corresponding path program 1 times [2024-02-19 14:07:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906738801] [2024-02-19 14:07:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:07:15,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:07:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:07:15,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:07:15,092 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:07:15,093 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-02-19 14:07:15,095 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-02-19 14:07:15,095 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-02-19 14:07:15,095 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:07:15,095 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-19 14:07:15,098 WARN L345 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:07:15,098 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-02-19 14:07:15,127 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:07:15,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2024-02-19 14:07:15,135 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-02-19 14:07:15,139 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:07:15,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2024-02-19 14:07:15,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2024-02-19 14:07:15,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2024-02-19 14:07:15,142 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:07:15,143 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@199a196e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:07:15,143 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-19 14:07:15,146 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:07:15,146 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-19 14:07:15,146 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:07:15,146 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:15,147 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:07:15,147 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-19 14:07:15,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1378019059, now seen corresponding path program 1 times [2024-02-19 14:07:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126794158] [2024-02-19 14:07:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:07:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:15,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126794158] [2024-02-19 14:07:15,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126794158] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:15,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:15,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:07:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466585022] [2024-02-19 14:07:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:15,176 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-19 14:07:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-19 14:07:15,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-19 14:07:15,176 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2024-02-19 14:07:15,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 76 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-02-19 14:07:15,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:15,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2024-02-19 14:07:15,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:07:15,331 INFO L124 PetriNetUnfolderBase]: 490/822 cut-off events. [2024-02-19 14:07:15,332 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-02-19 14:07:15,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 822 events. 490/822 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3295 event pairs, 376 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 1143. Up to 763 conditions per place. [2024-02-19 14:07:15,341 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 25 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2024-02-19 14:07:15,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 120 flow [2024-02-19 14:07:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-19 14:07:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-19 14:07:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2024-02-19 14:07:15,343 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-02-19 14:07:15,343 INFO L308 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2024-02-19 14:07:15,343 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 120 flow [2024-02-19 14:07:15,344 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-02-19 14:07:15,344 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:15,344 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2024-02-19 14:07:15,344 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:07:15,344 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-02-19 14:07:15,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1950289510, now seen corresponding path program 1 times [2024-02-19 14:07:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370664162] [2024-02-19 14:07:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:07:15,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:07:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:07:15,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:07:15,409 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:07:15,409 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-02-19 14:07:15,409 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-02-19 14:07:15,409 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-02-19 14:07:15,410 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-02-19 14:07:15,410 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:07:15,410 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2024-02-19 14:07:15,411 WARN L345 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:07:15,411 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-02-19 14:07:15,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:07:15,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2024-02-19 14:07:15,445 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2024-02-19 14:07:15,445 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-19 14:07:15,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2024-02-19 14:07:15,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2024-02-19 14:07:15,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-02-19 14:07:15,447 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:07:15,447 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@199a196e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:07:15,447 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:07:15,449 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:07:15,449 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-19 14:07:15,449 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:07:15,449 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:15,449 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:07:15,449 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:07:15,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:15,450 INFO L85 PathProgramCache]: Analyzing trace with hash 12790656, now seen corresponding path program 1 times [2024-02-19 14:07:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:15,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143788522] [2024-02-19 14:07:15,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:07:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:15,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143788522] [2024-02-19 14:07:15,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143788522] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:15,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:07:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092908487] [2024-02-19 14:07:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:15,472 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-19 14:07:15,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-19 14:07:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-19 14:07:15,473 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-02-19 14:07:15,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-02-19 14:07:15,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:15,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-02-19 14:07:15,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:07:16,252 INFO L124 PetriNetUnfolderBase]: 7132/10110 cut-off events. [2024-02-19 14:07:16,252 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2024-02-19 14:07:16,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20059 conditions, 10110 events. 7132/10110 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 50503 event pairs, 5560 based on Foata normal form. 0/7656 useless extension candidates. Maximal degree in co-relation 4545. Up to 9592 conditions per place. [2024-02-19 14:07:16,302 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 36 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2024-02-19 14:07:16,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 176 flow [2024-02-19 14:07:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-19 14:07:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-19 14:07:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-02-19 14:07:16,303 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-02-19 14:07:16,304 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-02-19 14:07:16,304 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 176 flow [2024-02-19 14:07:16,304 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-02-19 14:07:16,304 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:16,305 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:07:16,305 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:07:16,305 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:07:16,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1318638203, now seen corresponding path program 1 times [2024-02-19 14:07:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911354126] [2024-02-19 14:07:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:07:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911354126] [2024-02-19 14:07:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911354126] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:16,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:07:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871421079] [2024-02-19 14:07:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:16,671 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:07:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:07:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:07:16,687 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 47 [2024-02-19 14:07:16,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-02-19 14:07:16,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:16,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 47 [2024-02-19 14:07:16,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:07:18,252 INFO L124 PetriNetUnfolderBase]: 13598/19366 cut-off events. [2024-02-19 14:07:18,253 INFO L125 PetriNetUnfolderBase]: For 2062/2236 co-relation queries the response was YES. [2024-02-19 14:07:18,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56392 conditions, 19366 events. 13598/19366 cut-off events. For 2062/2236 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 109691 event pairs, 2539 based on Foata normal form. 0/15178 useless extension candidates. Maximal degree in co-relation 35208. Up to 17915 conditions per place. [2024-02-19 14:07:18,389 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 127 selfloop transitions, 13 changer transitions 0/146 dead transitions. [2024-02-19 14:07:18,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 146 transitions, 914 flow [2024-02-19 14:07:18,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:07:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:07:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2024-02-19 14:07:18,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6276595744680851 [2024-02-19 14:07:18,398 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2024-02-19 14:07:18,398 INFO L507 AbstractCegarLoop]: Abstraction has has 50 places, 146 transitions, 914 flow [2024-02-19 14:07:18,398 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-02-19 14:07:18,399 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:18,402 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2024-02-19 14:07:18,402 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:07:18,403 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-02-19 14:07:18,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1319909625, now seen corresponding path program 1 times [2024-02-19 14:07:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:18,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338309145] [2024-02-19 14:07:18,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:07:18,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-19 14:07:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-19 14:07:18,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-19 14:07:18,435 INFO L372 BasicCegarLoop]: Counterexample is feasible [2024-02-19 14:07:18,435 INFO L818 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-02-19 14:07:18,435 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-02-19 14:07:18,435 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-02-19 14:07:18,436 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-02-19 14:07:18,436 INFO L818 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-02-19 14:07:18,436 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:07:18,436 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-02-19 14:07:18,437 WARN L345 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-02-19 14:07:18,437 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-02-19 14:07:18,464 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-19 14:07:18,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2024-02-19 14:07:18,471 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2024-02-19 14:07:18,471 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:07:18,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-02-19 14:07:18,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2024-02-19 14:07:18,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2024-02-19 14:07:18,473 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:07:18,474 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@199a196e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:07:18,474 INFO L370 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-02-19 14:07:18,475 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:07:18,475 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-19 14:07:18,475 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-19 14:07:18,475 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:18,476 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-19 14:07:18,476 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:07:18,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1817781664, now seen corresponding path program 1 times [2024-02-19 14:07:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474110607] [2024-02-19 14:07:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:07:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474110607] [2024-02-19 14:07:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474110607] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:07:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272763902] [2024-02-19 14:07:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:18,488 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-19 14:07:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-19 14:07:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-19 14:07:18,489 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2024-02-19 14:07:18,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-02-19 14:07:18,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:18,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2024-02-19 14:07:18,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:07:26,129 INFO L124 PetriNetUnfolderBase]: 88780/115578 cut-off events. [2024-02-19 14:07:26,129 INFO L125 PetriNetUnfolderBase]: For 8840/8840 co-relation queries the response was YES. [2024-02-19 14:07:26,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230504 conditions, 115578 events. 88780/115578 cut-off events. For 8840/8840 co-relation queries the response was YES. Maximal size of possible extension queue 2628. Compared 647960 event pairs, 69712 based on Foata normal form. 0/86097 useless extension candidates. Maximal degree in co-relation 20145. Up to 110923 conditions per place. [2024-02-19 14:07:26,881 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 47 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2024-02-19 14:07:26,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 234 flow [2024-02-19 14:07:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-19 14:07:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-19 14:07:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2024-02-19 14:07:26,884 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2024-02-19 14:07:26,886 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2024-02-19 14:07:26,886 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 234 flow [2024-02-19 14:07:26,886 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-02-19 14:07:26,886 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:26,886 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:07:26,887 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:07:26,887 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:07:26,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:26,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1400406245, now seen corresponding path program 1 times [2024-02-19 14:07:26,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:26,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417559351] [2024-02-19 14:07:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:26,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:07:27,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417559351] [2024-02-19 14:07:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417559351] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:07:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666342117] [2024-02-19 14:07:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:27,134 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:07:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:27,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:07:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:07:27,146 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2024-02-19 14:07:27,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-19 14:07:27,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:27,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2024-02-19 14:07:27,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:07:41,618 INFO L124 PetriNetUnfolderBase]: 172436/224374 cut-off events. [2024-02-19 14:07:41,618 INFO L125 PetriNetUnfolderBase]: For 28179/29997 co-relation queries the response was YES. [2024-02-19 14:07:41,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660651 conditions, 224374 events. 172436/224374 cut-off events. For 28179/29997 co-relation queries the response was YES. Maximal size of possible extension queue 5216. Compared 1372377 event pairs, 31567 based on Foata normal form. 0/171730 useless extension candidates. Maximal degree in co-relation 114336. Up to 211727 conditions per place. [2024-02-19 14:07:43,363 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 179 selfloop transitions, 16 changer transitions 0/203 dead transitions. [2024-02-19 14:07:43,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 203 transitions, 1294 flow [2024-02-19 14:07:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:07:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:07:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2024-02-19 14:07:43,365 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-19 14:07:43,366 INFO L308 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2024-02-19 14:07:43,366 INFO L507 AbstractCegarLoop]: Abstraction has has 63 places, 203 transitions, 1294 flow [2024-02-19 14:07:43,366 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-02-19 14:07:43,366 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:07:43,366 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:07:43,367 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:07:43,367 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-02-19 14:07:43,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:07:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1301156814, now seen corresponding path program 1 times [2024-02-19 14:07:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:07:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946704819] [2024-02-19 14:07:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:07:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:07:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:07:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-19 14:07:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:07:43,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946704819] [2024-02-19 14:07:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946704819] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:07:43,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:07:43,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:07:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767619109] [2024-02-19 14:07:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:07:43,552 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:07:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:07:43,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:07:43,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:07:43,566 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2024-02-19 14:07:43,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 203 transitions, 1294 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-02-19 14:07:43,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:07:43,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2024-02-19 14:07:43,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand