./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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-wmm/mix053.opt.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.graphml --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 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:52:11,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:52:11,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:52:11,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:52:11,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:52:11,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:52:11,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:52:11,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:52:11,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:52:11,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:52:11,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:52:11,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:52:11,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:52:11,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:52:11,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:52:11,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:52:11,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:52:11,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:52:11,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:52:11,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:52:11,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:52:11,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:52:11,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:52:11,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:52:11,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:52:11,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:52:11,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:52:11,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:52:11,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:52:11,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:52:11,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:52:11,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:52:11,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:52:11,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:52:11,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:52:11,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:52:11,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:52:11,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:52:11,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:52:11,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:52:11,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:52:11,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:52:11,906 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:52:11,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:52:11,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:52:11,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:52:11,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:52:11,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:52:11,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:52:11,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:52:11,908 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:52:11,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:52:11,909 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:52:11,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:52:11,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:52:11,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:52:11,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:52:11,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:52:11,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:52:11,910 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:52:11,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:52:11,911 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:52:11,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:52:11,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:52:11,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:52:11,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:52:11,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:11,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:52:11,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:52:11,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:52:11,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:52:11,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:52:11,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:52:11,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:52:11,913 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:52:11,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:52:11,914 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:52:11,914 INFO L138 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.graphml 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 -> 998817f829569afa1d1e3eda89c2594d280c8ae81957c207a6b68804966cf3a6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:52:12,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:52:12,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:52:12,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:52:12,243 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:52:12,244 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:52:12,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-09-01 09:52:13,345 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:52:13,568 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:52:13,569 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-09-01 09:52:13,580 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52052a0bd/fdc7caf4946d4eaaaefe76c5271ee809/FLAG8d0091048 [2023-09-01 09:52:13,594 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52052a0bd/fdc7caf4946d4eaaaefe76c5271ee809 [2023-09-01 09:52:13,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:52:13,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:52:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:13,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:52:13,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:52:13,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:13" (1/1) ... [2023-09-01 09:52:13,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4df5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:13, skipping insertion in model container [2023-09-01 09:52:13,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:13" (1/1) ... [2023-09-01 09:52:13,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:52:13,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:52:13,789 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i[944,957] [2023-09-01 09:52:13,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:13,971 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:52:13,982 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i[944,957] [2023-09-01 09:52:14,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:14,069 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:14,069 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:14,075 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:52:14,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14 WrapperNode [2023-09-01 09:52:14,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:14,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:14,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:52:14,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:52:14,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,133 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-09-01 09:52:14,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:14,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:52:14,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:52:14,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:52:14,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:52:14,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:52:14,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:52:14,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:52:14,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (1/1) ... [2023-09-01 09:52:14,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:52:14,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:52:14,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:52:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:52:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:52:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:52:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:52:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:52:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:52:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:52:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:52:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:52:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:52:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:52:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:52:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:52:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:52:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:52:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:52:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:52:14,246 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:52:14,427 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:52:14,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:52:14,742 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:52:14,878 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:52:14,887 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:52:14,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:14 BoogieIcfgContainer [2023-09-01 09:52:14,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:52:14,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:52:14,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:52:14,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:52:14,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:52:13" (1/3) ... [2023-09-01 09:52:14,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669e191c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:14, skipping insertion in model container [2023-09-01 09:52:14,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:14" (2/3) ... [2023-09-01 09:52:14,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669e191c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:14, skipping insertion in model container [2023-09-01 09:52:14,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:14" (3/3) ... [2023-09-01 09:52:14,900 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-09-01 09:52:14,909 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:52:14,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:52:14,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:52:14,924 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:52:14,992 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:52:15,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2023-09-01 09:52:15,117 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-09-01 09:52:15,118 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:15,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-09-01 09:52:15,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2023-09-01 09:52:15,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2023-09-01 09:52:15,135 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:52:15,143 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 121 transitions, 254 flow [2023-09-01 09:52:15,146 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 121 transitions, 254 flow [2023-09-01 09:52:15,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 254 flow [2023-09-01 09:52:15,178 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-09-01 09:52:15,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-09-01 09:52:15,181 INFO L119 LiptonReduction]: Number of co-enabled transitions 2620 [2023-09-01 09:52:18,930 INFO L134 LiptonReduction]: Checked pairs total: 6159 [2023-09-01 09:52:18,930 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-09-01 09:52:18,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:52:18,948 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2fdcba47, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:52:18,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:52:18,953 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-09-01 09:52:18,954 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:18,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:18,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:18,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:18,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1951838619, now seen corresponding path program 1 times [2023-09-01 09:52:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9504020] [2023-09-01 09:52:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:19,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9504020] [2023-09-01 09:52:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9504020] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989677677] [2023-09-01 09:52:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:19,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:19,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 232 [2023-09-01 09:52:19,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-09-01 09:52:19,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:19,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 232 [2023-09-01 09:52:19,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:19,857 INFO L130 PetriNetUnfolder]: 2075/3080 cut-off events. [2023-09-01 09:52:19,857 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-09-01 09:52:19,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6076 conditions, 3080 events. 2075/3080 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15902 event pairs, 518 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 6064. Up to 2098 conditions per place. [2023-09-01 09:52:19,879 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-09-01 09:52:19,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 150 flow [2023-09-01 09:52:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-09-01 09:52:19,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2023-09-01 09:52:19,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-09-01 09:52:19,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-09-01 09:52:19,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:19,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-09-01 09:52:19,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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) [2023-09-01 09:52:19,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:19,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:19,915 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 372 transitions. [2023-09-01 09:52:19,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 150 flow [2023-09-01 09:52:19,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:19,924 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 60 flow [2023-09-01 09:52:19,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-09-01 09:52:19,930 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-09-01 09:52:19,931 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 60 flow [2023-09-01 09:52:19,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-09-01 09:52:19,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:19,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:52:19,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:19,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1183873960, now seen corresponding path program 1 times [2023-09-01 09:52:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084928531] [2023-09-01 09:52:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:19,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:20,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:20,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084928531] [2023-09-01 09:52:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084928531] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:20,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402953905] [2023-09-01 09:52:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:20,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:20,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-09-01 09:52:20,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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) [2023-09-01 09:52:20,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:20,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-09-01 09:52:20,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:21,219 INFO L130 PetriNetUnfolder]: 6105/8506 cut-off events. [2023-09-01 09:52:21,220 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2023-09-01 09:52:21,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17670 conditions, 8506 events. 6105/8506 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 42360 event pairs, 2153 based on Foata normal form. 244/8750 useless extension candidates. Maximal degree in co-relation 17660. Up to 5069 conditions per place. [2023-09-01 09:52:21,266 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 36 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2023-09-01 09:52:21,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 190 flow [2023-09-01 09:52:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-09-01 09:52:21,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2023-09-01 09:52:21,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-09-01 09:52:21,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-09-01 09:52:21,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:21,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-09-01 09:52:21,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-09-01 09:52:21,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:21,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:21,275 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 3 states and 356 transitions. [2023-09-01 09:52:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 190 flow [2023-09-01 09:52:21,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:21,285 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 110 flow [2023-09-01 09:52:21,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-09-01 09:52:21,286 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-09-01 09:52:21,287 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 110 flow [2023-09-01 09:52:21,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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) [2023-09-01 09:52:21,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:21,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:21,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:52:21,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:21,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1954613890, now seen corresponding path program 1 times [2023-09-01 09:52:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563042740] [2023-09-01 09:52:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:21,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:21,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563042740] [2023-09-01 09:52:21,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563042740] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:21,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:21,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049808926] [2023-09-01 09:52:21,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:21,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:21,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:21,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 232 [2023-09-01 09:52:21,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-09-01 09:52:21,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:21,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 232 [2023-09-01 09:52:21,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:22,213 INFO L130 PetriNetUnfolder]: 5032/7204 cut-off events. [2023-09-01 09:52:22,213 INFO L131 PetriNetUnfolder]: For 3193/3203 co-relation queries the response was YES. [2023-09-01 09:52:22,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18342 conditions, 7204 events. 5032/7204 cut-off events. For 3193/3203 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 39299 event pairs, 1101 based on Foata normal form. 36/7007 useless extension candidates. Maximal degree in co-relation 18330. Up to 6307 conditions per place. [2023-09-01 09:52:22,262 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 38 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-09-01 09:52:22,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 252 flow [2023-09-01 09:52:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-09-01 09:52:22,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272988505747126 [2023-09-01 09:52:22,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-09-01 09:52:22,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-09-01 09:52:22,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:22,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-09-01 09:52:22,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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) [2023-09-01 09:52:22,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:22,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:22,267 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 110 flow. Second operand 3 states and 367 transitions. [2023-09-01 09:52:22,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 252 flow [2023-09-01 09:52:22,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:22,285 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 137 flow [2023-09-01 09:52:22,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2023-09-01 09:52:22,286 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-09-01 09:52:22,289 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 137 flow [2023-09-01 09:52:22,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-09-01 09:52:22,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:22,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:22,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:52:22,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:22,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1954614324, now seen corresponding path program 1 times [2023-09-01 09:52:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:22,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735667936] [2023-09-01 09:52:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:22,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735667936] [2023-09-01 09:52:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735667936] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:22,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:22,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570062853] [2023-09-01 09:52:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:22,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:22,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 232 [2023-09-01 09:52:22,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-09-01 09:52:22,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:22,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 232 [2023-09-01 09:52:22,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:23,186 INFO L130 PetriNetUnfolder]: 4786/6937 cut-off events. [2023-09-01 09:52:23,187 INFO L131 PetriNetUnfolder]: For 2932/3026 co-relation queries the response was YES. [2023-09-01 09:52:23,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17498 conditions, 6937 events. 4786/6937 cut-off events. For 2932/3026 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 37624 event pairs, 1776 based on Foata normal form. 90/6879 useless extension candidates. Maximal degree in co-relation 17485. Up to 6140 conditions per place. [2023-09-01 09:52:23,231 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-09-01 09:52:23,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 299 flow [2023-09-01 09:52:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 09:52:23,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316091954022989 [2023-09-01 09:52:23,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 09:52:23,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 09:52:23,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:23,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 09:52:23,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-09-01 09:52:23,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:23,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:23,238 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 137 flow. Second operand 3 states and 370 transitions. [2023-09-01 09:52:23,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 299 flow [2023-09-01 09:52:23,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:23,240 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 173 flow [2023-09-01 09:52:23,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-09-01 09:52:23,241 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-09-01 09:52:23,241 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 173 flow [2023-09-01 09:52:23,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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) [2023-09-01 09:52:23,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:23,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:23,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:52:23,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:23,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash -463489866, now seen corresponding path program 1 times [2023-09-01 09:52:23,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:23,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420321880] [2023-09-01 09:52:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420321880] [2023-09-01 09:52:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420321880] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:23,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767010451] [2023-09-01 09:52:23,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:23,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:23,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:23,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:23,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-09-01 09:52:23,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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) [2023-09-01 09:52:23,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:23,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-09-01 09:52:23,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:24,033 INFO L130 PetriNetUnfolder]: 3944/5909 cut-off events. [2023-09-01 09:52:24,033 INFO L131 PetriNetUnfolder]: For 4120/4476 co-relation queries the response was YES. [2023-09-01 09:52:24,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15338 conditions, 5909 events. 3944/5909 cut-off events. For 4120/4476 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 34202 event pairs, 676 based on Foata normal form. 603/6394 useless extension candidates. Maximal degree in co-relation 15323. Up to 3992 conditions per place. [2023-09-01 09:52:24,068 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 74 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-09-01 09:52:24,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 94 transitions, 563 flow [2023-09-01 09:52:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:52:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:52:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-09-01 09:52:24,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-09-01 09:52:24,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-09-01 09:52:24,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-09-01 09:52:24,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:24,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-09-01 09:52:24,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 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) [2023-09-01 09:52:24,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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) [2023-09-01 09:52:24,076 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 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) [2023-09-01 09:52:24,076 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 173 flow. Second operand 5 states and 580 transitions. [2023-09-01 09:52:24,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 94 transitions, 563 flow [2023-09-01 09:52:24,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 554 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:24,080 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 243 flow [2023-09-01 09:52:24,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-09-01 09:52:24,081 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-09-01 09:52:24,081 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 243 flow [2023-09-01 09:52:24,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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) [2023-09-01 09:52:24,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:24,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:24,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:52:24,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:24,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1916161733, now seen corresponding path program 1 times [2023-09-01 09:52:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142140153] [2023-09-01 09:52:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142140153] [2023-09-01 09:52:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142140153] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:24,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:52:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834671481] [2023-09-01 09:52:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:24,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:24,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 232 [2023-09-01 09:52:24,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-09-01 09:52:24,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:24,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 232 [2023-09-01 09:52:24,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:24,977 INFO L130 PetriNetUnfolder]: 5782/8691 cut-off events. [2023-09-01 09:52:24,977 INFO L131 PetriNetUnfolder]: For 10372/10619 co-relation queries the response was YES. [2023-09-01 09:52:25,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29937 conditions, 8691 events. 5782/8691 cut-off events. For 10372/10619 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 52901 event pairs, 2333 based on Foata normal form. 259/8779 useless extension candidates. Maximal degree in co-relation 29918. Up to 4656 conditions per place. [2023-09-01 09:52:25,028 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 59 selfloop transitions, 6 changer transitions 6/76 dead transitions. [2023-09-01 09:52:25,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 521 flow [2023-09-01 09:52:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 09:52:25,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316091954022989 [2023-09-01 09:52:25,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 09:52:25,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 09:52:25,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:25,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 09:52:25,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-09-01 09:52:25,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:25,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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) [2023-09-01 09:52:25,034 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 243 flow. Second operand 3 states and 370 transitions. [2023-09-01 09:52:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 521 flow [2023-09-01 09:52:25,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:25,059 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 246 flow [2023-09-01 09:52:25,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-09-01 09:52:25,062 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-09-01 09:52:25,062 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 246 flow [2023-09-01 09:52:25,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 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) [2023-09-01 09:52:25,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:25,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:25,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:52:25,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:25,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 940695962, now seen corresponding path program 1 times [2023-09-01 09:52:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843824651] [2023-09-01 09:52:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:25,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843824651] [2023-09-01 09:52:25,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843824651] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643791173] [2023-09-01 09:52:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:25,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:25,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-09-01 09:52:25,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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) [2023-09-01 09:52:25,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:25,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-09-01 09:52:25,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:25,837 INFO L130 PetriNetUnfolder]: 4088/6462 cut-off events. [2023-09-01 09:52:25,837 INFO L131 PetriNetUnfolder]: For 8225/8635 co-relation queries the response was YES. [2023-09-01 09:52:25,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22324 conditions, 6462 events. 4088/6462 cut-off events. For 8225/8635 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 41633 event pairs, 314 based on Foata normal form. 699/7046 useless extension candidates. Maximal degree in co-relation 22304. Up to 2740 conditions per place. [2023-09-01 09:52:25,904 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 99 selfloop transitions, 18 changer transitions 3/129 dead transitions. [2023-09-01 09:52:25,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 129 transitions, 908 flow [2023-09-01 09:52:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2023-09-01 09:52:25,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-09-01 09:52:25,907 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2023-09-01 09:52:25,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2023-09-01 09:52:25,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:25,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2023-09-01 09:52:25,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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) [2023-09-01 09:52:25,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 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) [2023-09-01 09:52:25,912 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 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) [2023-09-01 09:52:25,912 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 246 flow. Second operand 7 states and 812 transitions. [2023-09-01 09:52:25,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 129 transitions, 908 flow [2023-09-01 09:52:25,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 129 transitions, 868 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-09-01 09:52:25,926 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 367 flow [2023-09-01 09:52:25,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-09-01 09:52:25,927 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2023-09-01 09:52:25,927 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 367 flow [2023-09-01 09:52:25,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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) [2023-09-01 09:52:25,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:25,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:25,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:52:25,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:25,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 212284604, now seen corresponding path program 1 times [2023-09-01 09:52:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233188602] [2023-09-01 09:52:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:26,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:26,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233188602] [2023-09-01 09:52:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233188602] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:52:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768822740] [2023-09-01 09:52:26,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:26,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:26,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:26,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-09-01 09:52:26,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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) [2023-09-01 09:52:26,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:26,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-09-01 09:52:26,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:26,942 INFO L130 PetriNetUnfolder]: 3680/5849 cut-off events. [2023-09-01 09:52:26,942 INFO L131 PetriNetUnfolder]: For 12321/12854 co-relation queries the response was YES. [2023-09-01 09:52:26,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24259 conditions, 5849 events. 3680/5849 cut-off events. For 12321/12854 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 37775 event pairs, 178 based on Foata normal form. 529/6266 useless extension candidates. Maximal degree in co-relation 24235. Up to 2556 conditions per place. [2023-09-01 09:52:26,975 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 108 selfloop transitions, 27 changer transitions 14/158 dead transitions. [2023-09-01 09:52:26,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 158 transitions, 1189 flow [2023-09-01 09:52:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:52:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:52:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1043 transitions. [2023-09-01 09:52:26,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49952107279693486 [2023-09-01 09:52:26,980 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1043 transitions. [2023-09-01 09:52:26,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1043 transitions. [2023-09-01 09:52:26,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:26,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1043 transitions. [2023-09-01 09:52:26,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 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) [2023-09-01 09:52:26,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 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) [2023-09-01 09:52:26,987 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 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) [2023-09-01 09:52:26,987 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 367 flow. Second operand 9 states and 1043 transitions. [2023-09-01 09:52:26,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 158 transitions, 1189 flow [2023-09-01 09:52:27,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 158 transitions, 1140 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:27,242 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 494 flow [2023-09-01 09:52:27,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=494, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2023-09-01 09:52:27,243 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2023-09-01 09:52:27,243 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 494 flow [2023-09-01 09:52:27,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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) [2023-09-01 09:52:27,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:27,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:27,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:52:27,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:27,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash -190215367, now seen corresponding path program 1 times [2023-09-01 09:52:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859343959] [2023-09-01 09:52:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:27,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859343959] [2023-09-01 09:52:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859343959] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:52:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276584456] [2023-09-01 09:52:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:27,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:52:27,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:52:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:52:27,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-09-01 09:52:27,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 494 flow. Second operand has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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) [2023-09-01 09:52:27,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:27,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-09-01 09:52:27,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:28,399 INFO L130 PetriNetUnfolder]: 3589/5690 cut-off events. [2023-09-01 09:52:28,399 INFO L131 PetriNetUnfolder]: For 15729/16076 co-relation queries the response was YES. [2023-09-01 09:52:28,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24020 conditions, 5690 events. 3589/5690 cut-off events. For 15729/16076 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 36730 event pairs, 168 based on Foata normal form. 308/5886 useless extension candidates. Maximal degree in co-relation 23993. Up to 1566 conditions per place. [2023-09-01 09:52:28,435 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 85 selfloop transitions, 30 changer transitions 38/159 dead transitions. [2023-09-01 09:52:28,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 159 transitions, 1248 flow [2023-09-01 09:52:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 09:52:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 09:52:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1252 transitions. [2023-09-01 09:52:28,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49059561128526646 [2023-09-01 09:52:28,440 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1252 transitions. [2023-09-01 09:52:28,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1252 transitions. [2023-09-01 09:52:28,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:28,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1252 transitions. [2023-09-01 09:52:28,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.81818181818181) internal successors, (1252), 11 states have internal predecessors, (1252), 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) [2023-09-01 09:52:28,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 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) [2023-09-01 09:52:28,449 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 232.0) internal successors, (2784), 12 states have internal predecessors, (2784), 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) [2023-09-01 09:52:28,449 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 494 flow. Second operand 11 states and 1252 transitions. [2023-09-01 09:52:28,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 159 transitions, 1248 flow [2023-09-01 09:52:28,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1149 flow, removed 36 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:28,917 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 434 flow [2023-09-01 09:52:28,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=434, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-09-01 09:52:28,918 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2023-09-01 09:52:28,918 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 434 flow [2023-09-01 09:52:28,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 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) [2023-09-01 09:52:28,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:28,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:28,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:52:28,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:28,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 505967038, now seen corresponding path program 1 times [2023-09-01 09:52:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281320147] [2023-09-01 09:52:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281320147] [2023-09-01 09:52:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281320147] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685836382] [2023-09-01 09:52:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:29,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:29,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:29,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-09-01 09:52:29,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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) [2023-09-01 09:52:29,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:29,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-09-01 09:52:29,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:29,622 INFO L130 PetriNetUnfolder]: 2526/4056 cut-off events. [2023-09-01 09:52:29,622 INFO L131 PetriNetUnfolder]: For 11434/11434 co-relation queries the response was YES. [2023-09-01 09:52:29,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17032 conditions, 4056 events. 2526/4056 cut-off events. For 11434/11434 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23328 event pairs, 178 based on Foata normal form. 1/4057 useless extension candidates. Maximal degree in co-relation 17001. Up to 1504 conditions per place. [2023-09-01 09:52:29,636 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 48 selfloop transitions, 11 changer transitions 104/163 dead transitions. [2023-09-01 09:52:29,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 163 transitions, 1590 flow [2023-09-01 09:52:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-09-01 09:52:29,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49353448275862066 [2023-09-01 09:52:29,639 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-09-01 09:52:29,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-09-01 09:52:29,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:29,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-09-01 09:52:29,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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) [2023-09-01 09:52:29,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 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) [2023-09-01 09:52:29,643 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 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) [2023-09-01 09:52:29,644 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 434 flow. Second operand 6 states and 687 transitions. [2023-09-01 09:52:29,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 163 transitions, 1590 flow [2023-09-01 09:52:29,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 163 transitions, 1244 flow, removed 76 selfloop flow, removed 13 redundant places. [2023-09-01 09:52:29,753 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 253 flow [2023-09-01 09:52:29,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2023-09-01 09:52:29,754 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2023-09-01 09:52:29,754 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 253 flow [2023-09-01 09:52:29,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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) [2023-09-01 09:52:29,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:29,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:29,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:52:29,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:29,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash -729240840, now seen corresponding path program 2 times [2023-09-01 09:52:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694644622] [2023-09-01 09:52:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:29,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:29,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694644622] [2023-09-01 09:52:29,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694644622] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:29,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:29,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:29,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780447676] [2023-09-01 09:52:29,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:29,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:29,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:29,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:29,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-09-01 09:52:29,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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) [2023-09-01 09:52:29,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:29,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-09-01 09:52:29,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:30,112 INFO L130 PetriNetUnfolder]: 573/955 cut-off events. [2023-09-01 09:52:30,112 INFO L131 PetriNetUnfolder]: For 1762/1762 co-relation queries the response was YES. [2023-09-01 09:52:30,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 955 events. 573/955 cut-off events. For 1762/1762 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4149 event pairs, 116 based on Foata normal form. 1/956 useless extension candidates. Maximal degree in co-relation 3578. Up to 455 conditions per place. [2023-09-01 09:52:30,116 INFO L137 encePairwiseOnDemand]: 224/232 looper letters, 45 selfloop transitions, 6 changer transitions 28/79 dead transitions. [2023-09-01 09:52:30,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 604 flow [2023-09-01 09:52:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-09-01 09:52:30,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-09-01 09:52:30,118 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-09-01 09:52:30,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-09-01 09:52:30,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:30,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-09-01 09:52:30,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2023-09-01 09:52:30,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 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) [2023-09-01 09:52:30,122 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 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) [2023-09-01 09:52:30,122 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 253 flow. Second operand 4 states and 464 transitions. [2023-09-01 09:52:30,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 604 flow [2023-09-01 09:52:30,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 555 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-09-01 09:52:30,131 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 192 flow [2023-09-01 09:52:30,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-09-01 09:52:30,132 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-09-01 09:52:30,132 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 192 flow [2023-09-01 09:52:30,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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) [2023-09-01 09:52:30,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:30,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:30,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:52:30,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:30,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2015821044, now seen corresponding path program 3 times [2023-09-01 09:52:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723774174] [2023-09-01 09:52:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:52:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723774174] [2023-09-01 09:52:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723774174] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939564488] [2023-09-01 09:52:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:30,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:30,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-09-01 09:52:30,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 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) [2023-09-01 09:52:30,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:30,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-09-01 09:52:30,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:31,093 INFO L130 PetriNetUnfolder]: 103/199 cut-off events. [2023-09-01 09:52:31,093 INFO L131 PetriNetUnfolder]: For 373/373 co-relation queries the response was YES. [2023-09-01 09:52:31,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 199 events. 103/199 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 600 event pairs, 1 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 752. Up to 81 conditions per place. [2023-09-01 09:52:31,094 INFO L137 encePairwiseOnDemand]: 221/232 looper letters, 40 selfloop transitions, 9 changer transitions 25/74 dead transitions. [2023-09-01 09:52:31,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 563 flow [2023-09-01 09:52:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:52:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:52:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 843 transitions. [2023-09-01 09:52:31,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542025862068966 [2023-09-01 09:52:31,097 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 843 transitions. [2023-09-01 09:52:31,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 843 transitions. [2023-09-01 09:52:31,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:31,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 843 transitions. [2023-09-01 09:52:31,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.375) internal successors, (843), 8 states have internal predecessors, (843), 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) [2023-09-01 09:52:31,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 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) [2023-09-01 09:52:31,103 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 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) [2023-09-01 09:52:31,103 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 192 flow. Second operand 8 states and 843 transitions. [2023-09-01 09:52:31,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 563 flow [2023-09-01 09:52:31,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 492 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-09-01 09:52:31,106 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 173 flow [2023-09-01 09:52:31,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-09-01 09:52:31,107 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-09-01 09:52:31,107 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 173 flow [2023-09-01 09:52:31,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 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) [2023-09-01 09:52:31,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:31,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:31,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:52:31,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:52:31,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2072698180, now seen corresponding path program 4 times [2023-09-01 09:52:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347077165] [2023-09-01 09:52:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:31,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:52:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:31,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:52:31,197 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:52:31,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:52:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:52:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:52:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:52:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:52:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:52:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:52:31,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:52:31,201 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:31,206 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:52:31,206 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:52:31,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:52:31 BasicIcfg [2023-09-01 09:52:31,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:52:31,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:52:31,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:52:31,262 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:52:31,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:14" (3/4) ... [2023-09-01 09:52:31,264 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:52:31,334 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:52:31,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:52:31,335 INFO L158 Benchmark]: Toolchain (without parser) took 17735.78ms. Allocated memory was 73.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 52.4MB in the beginning and 780.3MB in the end (delta: -728.0MB). Peak memory consumption was 707.7MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,335 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 58.7MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:52:31,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.24ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 47.2MB in the end (delta: 4.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.55ms. Allocated memory is still 73.4MB. Free memory was 47.2MB in the beginning and 44.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,336 INFO L158 Benchmark]: Boogie Preprocessor took 41.63ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 42.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,336 INFO L158 Benchmark]: RCFGBuilder took 713.88ms. Allocated memory is still 73.4MB. Free memory was 42.7MB in the beginning and 32.0MB in the end (delta: 10.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,337 INFO L158 Benchmark]: TraceAbstraction took 16368.92ms. Allocated memory was 73.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 31.3MB in the beginning and 795.1MB in the end (delta: -763.8MB). Peak memory consumption was 672.7MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,337 INFO L158 Benchmark]: Witness Printer took 73.14ms. Allocated memory is still 1.5GB. Free memory was 795.1MB in the beginning and 780.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:52:31,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 58.7MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.24ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 47.2MB in the end (delta: 4.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.55ms. Allocated memory is still 73.4MB. Free memory was 47.2MB in the beginning and 44.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.63ms. Allocated memory is still 73.4MB. Free memory was 44.8MB in the beginning and 42.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 713.88ms. Allocated memory is still 73.4MB. Free memory was 42.7MB in the beginning and 32.0MB in the end (delta: 10.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16368.92ms. Allocated memory was 73.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 31.3MB in the beginning and 795.1MB in the end (delta: -763.8MB). Peak memory consumption was 672.7MB. Max. memory is 16.1GB. * Witness Printer took 73.14ms. Allocated memory is still 1.5GB. Free memory was 795.1MB in the beginning and 780.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 132 PlacesBefore, 39 PlacesAfterwards, 121 TransitionsBefore, 27 TransitionsAfterwards, 2620 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6159 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3198, independent: 3031, independent conditional: 0, independent unconditional: 3031, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1443, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3198, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1443, unknown conditional: 0, unknown unconditional: 1443] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-4, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-3, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=-2, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1162 IncrementalHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 31 mSDtfsCounter, 1162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:52:31,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE