./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix030_tso.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 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:12:07,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:12:07,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:12:07,923 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:12:07,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:12:07,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:12:07,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:12:07,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:12:07,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:12:07,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:12:07,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:12:07,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:12:07,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:12:07,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:12:07,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:12:07,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:12:07,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:12:07,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:12:07,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:12:07,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:12:07,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:12:07,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:12:07,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:12:07,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:12:07,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:12:07,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:12:07,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:12:07,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:12:07,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:12:07,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:12:07,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:12:07,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:12:07,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:12:07,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:12:07,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:12:07,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:12:07,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:12:07,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:12:07,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:12:07,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:12:07,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:12:07,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:12:08,012 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:12:08,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:12:08,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:12:08,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:12:08,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:12:08,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:12:08,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:12:08,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:12:08,016 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:12:08,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:12:08,017 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:12:08,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:12:08,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:12:08,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:12:08,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:12:08,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:12:08,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:12:08,018 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:12:08,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:12:08,019 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:12:08,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:12:08,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:12:08,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:12:08,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:12:08,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:12:08,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:12:08,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:12:08,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:12:08,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:12:08,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:12:08,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:12:08,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:12:08,021 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:12:08,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:12:08,022 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:12:08,022 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 -> 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa 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 -> TOGETHER [2023-08-30 23:12:08,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:12:08,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:12:08,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:12:08,357 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:12:08,358 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:12:08,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2023-08-30 23:12:09,474 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:12:09,767 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:12:09,767 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2023-08-30 23:12:09,787 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611dc8164/bf2f5e3062244b97927fd2f134a76b43/FLAG273b5dc22 [2023-08-30 23:12:09,804 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611dc8164/bf2f5e3062244b97927fd2f134a76b43 [2023-08-30 23:12:09,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:12:09,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:12:09,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:12:09,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:12:09,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:12:09,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:12:09" (1/1) ... [2023-08-30 23:12:09,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784a9454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:09, skipping insertion in model container [2023-08-30 23:12:09,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:12:09" (1/1) ... [2023-08-30 23:12:09,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:12:09,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:12:10,041 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/mix030_tso.i[944,957] [2023-08-30 23:12:10,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:12:10,300 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:12:10,313 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/mix030_tso.i[944,957] [2023-08-30 23:12:10,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:12:10,385 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:12:10,385 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:12:10,391 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:12:10,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10 WrapperNode [2023-08-30 23:12:10,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:12:10,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:12:10,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:12:10,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:12:10,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,467 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2023-08-30 23:12:10,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:12:10,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:12:10,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:12:10,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:12:10,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:12:10,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:12:10,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:12:10,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:12:10,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (1/1) ... [2023-08-30 23:12:10,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:12:10,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:12:10,574 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-08-30 23:12:10,604 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-08-30 23:12:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:12:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:12:10,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:12:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:12:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:12:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:12:10,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:12:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:12:10,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:12:10,622 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:12:10,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:12:10,623 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:12:10,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:12:10,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:12:10,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:12:10,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:12:10,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:12:10,625 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:12:10,800 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:12:10,802 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:12:11,130 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:12:11,262 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:12:11,263 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:12:11,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:12:11 BoogieIcfgContainer [2023-08-30 23:12:11,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:12:11,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:12:11,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:12:11,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:12:11,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:12:09" (1/3) ... [2023-08-30 23:12:11,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285f662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:12:11, skipping insertion in model container [2023-08-30 23:12:11,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:12:10" (2/3) ... [2023-08-30 23:12:11,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285f662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:12:11, skipping insertion in model container [2023-08-30 23:12:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:12:11" (3/3) ... [2023-08-30 23:12:11,272 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2023-08-30 23:12:11,278 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:12:11,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:12:11,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:12:11,287 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:12:11,369 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:12:11,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2023-08-30 23:12:11,484 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 23:12:11,484 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:12:11,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 23:12:11,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2023-08-30 23:12:11,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2023-08-30 23:12:11,504 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:12:11,515 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2023-08-30 23:12:11,519 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2023-08-30 23:12:11,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2023-08-30 23:12:11,559 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 23:12:11,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:12:11,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 23:12:11,564 INFO L119 LiptonReduction]: Number of co-enabled transitions 2836 [2023-08-30 23:12:16,378 INFO L134 LiptonReduction]: Checked pairs total: 7579 [2023-08-30 23:12:16,378 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-30 23:12:16,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:12:16,395 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;@62c6ee79, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:12:16,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:12:16,401 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-08-30 23:12:16,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:12:16,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:16,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:16,403 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-08-30 23:12:16,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash 162703561, now seen corresponding path program 1 times [2023-08-30 23:12:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077762423] [2023-08-30 23:12:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077762423] [2023-08-30 23:12:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077762423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:16,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:16,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:12:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041961165] [2023-08-30 23:12:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:16,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:12:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:16,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:12:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:12:16,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 233 [2023-08-30 23:12:16,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 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-08-30 23:12:16,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:16,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 233 [2023-08-30 23:12:16,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:17,459 INFO L130 PetriNetUnfolder]: 2594/3794 cut-off events. [2023-08-30 23:12:17,459 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-30 23:12:17,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7489 conditions, 3794 events. 2594/3794 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20203 event pairs, 518 based on Foata normal form. 0/3601 useless extension candidates. Maximal degree in co-relation 7477. Up to 2797 conditions per place. [2023-08-30 23:12:17,483 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-30 23:12:17,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-08-30 23:12:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:12:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:12:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-30 23:12:17,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530758226037196 [2023-08-30 23:12:17,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-30 23:12:17,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-30 23:12:17,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:17,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-30 23:12:17,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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-08-30 23:12:17,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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-08-30 23:12:17,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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-08-30 23:12:17,518 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 371 transitions. [2023-08-30 23:12:17,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-08-30 23:12:17,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:12:17,525 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-30 23:12:17,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-30 23:12:17,531 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 23:12:17,532 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-30 23:12:17,533 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-08-30 23:12:17,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:17,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:17,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:12:17,536 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-08-30 23:12:17,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1739383187, now seen corresponding path program 1 times [2023-08-30 23:12:17,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:17,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699320239] [2023-08-30 23:12:17,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:18,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699320239] [2023-08-30 23:12:18,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699320239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:18,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:12:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306691181] [2023-08-30 23:12:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:18,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:12:18,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:12:18,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:12:18,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 23:12:18,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-08-30 23:12:18,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:18,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 23:12:18,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:19,874 INFO L130 PetriNetUnfolder]: 7071/10136 cut-off events. [2023-08-30 23:12:19,875 INFO L131 PetriNetUnfolder]: For 396/396 co-relation queries the response was YES. [2023-08-30 23:12:19,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20602 conditions, 10136 events. 7071/10136 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 56373 event pairs, 511 based on Foata normal form. 312/10448 useless extension candidates. Maximal degree in co-relation 20592. Up to 6389 conditions per place. [2023-08-30 23:12:19,935 INFO L137 encePairwiseOnDemand]: 221/233 looper letters, 47 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2023-08-30 23:12:19,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 264 flow [2023-08-30 23:12:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:12:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:12:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-08-30 23:12:19,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957081545064378 [2023-08-30 23:12:19,938 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-08-30 23:12:19,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-08-30 23:12:19,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:19,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-08-30 23:12:19,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 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-08-30 23:12:19,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:19,943 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:19,943 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 4 states and 462 transitions. [2023-08-30 23:12:19,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 264 flow [2023-08-30 23:12:19,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:12:19,946 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 160 flow [2023-08-30 23:12:19,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-08-30 23:12:19,947 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-30 23:12:19,947 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 160 flow [2023-08-30 23:12:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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-08-30 23:12:19,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:19,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:19,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:12:19,948 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-08-30 23:12:19,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1913697331, now seen corresponding path program 1 times [2023-08-30 23:12:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605311752] [2023-08-30 23:12:19,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:19,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605311752] [2023-08-30 23:12:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605311752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:12:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429295846] [2023-08-30 23:12:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:20,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:12:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:12:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:12:20,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 23:12:20,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-08-30 23:12:20,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:20,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 23:12:20,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:21,871 INFO L130 PetriNetUnfolder]: 6695/9328 cut-off events. [2023-08-30 23:12:21,871 INFO L131 PetriNetUnfolder]: For 5468/5468 co-relation queries the response was YES. [2023-08-30 23:12:21,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26755 conditions, 9328 events. 6695/9328 cut-off events. For 5468/5468 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 46346 event pairs, 1639 based on Foata normal form. 112/9432 useless extension candidates. Maximal degree in co-relation 26742. Up to 4565 conditions per place. [2023-08-30 23:12:21,948 INFO L137 encePairwiseOnDemand]: 222/233 looper letters, 51 selfloop transitions, 18 changer transitions 0/70 dead transitions. [2023-08-30 23:12:21,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 424 flow [2023-08-30 23:12:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:12:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:12:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-30 23:12:21,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48390557939914164 [2023-08-30 23:12:21,951 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-30 23:12:21,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-30 23:12:21,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:21,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-30 23:12:21,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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-08-30 23:12:21,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:21,955 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:21,955 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 160 flow. Second operand 4 states and 451 transitions. [2023-08-30 23:12:21,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 424 flow [2023-08-30 23:12:21,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 424 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:12:21,959 INFO L231 Difference]: Finished difference. Result has 47 places, 51 transitions, 328 flow [2023-08-30 23:12:21,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=47, PETRI_TRANSITIONS=51} [2023-08-30 23:12:21,961 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-30 23:12:21,964 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 51 transitions, 328 flow [2023-08-30 23:12:21,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-08-30 23:12:21,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:21,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:21,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:12:21,966 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-08-30 23:12:21,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1512512707, now seen corresponding path program 1 times [2023-08-30 23:12:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:21,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927204734] [2023-08-30 23:12:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:21,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927204734] [2023-08-30 23:12:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927204734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:12:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649152848] [2023-08-30 23:12:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:22,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:12:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:12:22,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:12:22,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 233 [2023-08-30 23:12:22,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 51 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-08-30 23:12:22,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:22,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 233 [2023-08-30 23:12:22,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:23,198 INFO L130 PetriNetUnfolder]: 5721/8335 cut-off events. [2023-08-30 23:12:23,198 INFO L131 PetriNetUnfolder]: For 14453/14535 co-relation queries the response was YES. [2023-08-30 23:12:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29099 conditions, 8335 events. 5721/8335 cut-off events. For 14453/14535 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 46218 event pairs, 1907 based on Foata normal form. 60/8323 useless extension candidates. Maximal degree in co-relation 29081. Up to 7148 conditions per place. [2023-08-30 23:12:23,263 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 57 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2023-08-30 23:12:23,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 554 flow [2023-08-30 23:12:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:12:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:12:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-30 23:12:23,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321888412017167 [2023-08-30 23:12:23,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-30 23:12:23,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-30 23:12:23,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:23,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-30 23:12:23,269 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-08-30 23:12:23,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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-08-30 23:12:23,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 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-08-30 23:12:23,271 INFO L175 Difference]: Start difference. First operand has 47 places, 51 transitions, 328 flow. Second operand 3 states and 372 transitions. [2023-08-30 23:12:23,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 554 flow [2023-08-30 23:12:23,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:12:23,284 INFO L231 Difference]: Finished difference. Result has 49 places, 56 transitions, 393 flow [2023-08-30 23:12:23,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=49, PETRI_TRANSITIONS=56} [2023-08-30 23:12:23,285 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-30 23:12:23,286 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 56 transitions, 393 flow [2023-08-30 23:12:23,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-08-30 23:12:23,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:23,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:23,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:12:23,287 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-08-30 23:12:23,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1746640828, now seen corresponding path program 1 times [2023-08-30 23:12:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237465784] [2023-08-30 23:12:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237465784] [2023-08-30 23:12:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237465784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:12:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179804996] [2023-08-30 23:12:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:24,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:12:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:24,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:12:24,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:12:24,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 23:12:24,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 56 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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-08-30 23:12:24,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:24,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 23:12:24,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:25,330 INFO L130 PetriNetUnfolder]: 8287/11708 cut-off events. [2023-08-30 23:12:25,330 INFO L131 PetriNetUnfolder]: For 19751/19751 co-relation queries the response was YES. [2023-08-30 23:12:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41412 conditions, 11708 events. 8287/11708 cut-off events. For 19751/19751 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 63105 event pairs, 1697 based on Foata normal form. 128/11836 useless extension candidates. Maximal degree in co-relation 41392. Up to 5337 conditions per place. [2023-08-30 23:12:25,380 INFO L137 encePairwiseOnDemand]: 221/233 looper letters, 60 selfloop transitions, 38 changer transitions 2/101 dead transitions. [2023-08-30 23:12:25,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 834 flow [2023-08-30 23:12:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:12:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:12:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-30 23:12:25,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978540772532189 [2023-08-30 23:12:25,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-30 23:12:25,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-30 23:12:25,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:25,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-30 23:12:25,384 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-08-30 23:12:25,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:25,386 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:25,387 INFO L175 Difference]: Start difference. First operand has 49 places, 56 transitions, 393 flow. Second operand 4 states and 464 transitions. [2023-08-30 23:12:25,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 834 flow [2023-08-30 23:12:25,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:12:25,393 INFO L231 Difference]: Finished difference. Result has 54 places, 73 transitions, 717 flow [2023-08-30 23:12:25,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=54, PETRI_TRANSITIONS=73} [2023-08-30 23:12:25,395 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-30 23:12:25,396 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 73 transitions, 717 flow [2023-08-30 23:12:25,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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-08-30 23:12:25,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:25,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:25,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:12:25,397 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-08-30 23:12:25,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1882292426, now seen corresponding path program 1 times [2023-08-30 23:12:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308194931] [2023-08-30 23:12:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308194931] [2023-08-30 23:12:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308194931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:12:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659323288] [2023-08-30 23:12:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:25,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:12:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:25,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:12:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:12:25,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-30 23:12:25,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 73 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-08-30 23:12:25,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:25,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-30 23:12:25,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:26,546 INFO L130 PetriNetUnfolder]: 5889/8767 cut-off events. [2023-08-30 23:12:26,546 INFO L131 PetriNetUnfolder]: For 40069/42383 co-relation queries the response was YES. [2023-08-30 23:12:26,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34769 conditions, 8767 events. 5889/8767 cut-off events. For 40069/42383 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 53976 event pairs, 945 based on Foata normal form. 1709/10252 useless extension candidates. Maximal degree in co-relation 34745. Up to 5633 conditions per place. [2023-08-30 23:12:26,592 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 121 selfloop transitions, 9 changer transitions 28/180 dead transitions. [2023-08-30 23:12:26,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 180 transitions, 2001 flow [2023-08-30 23:12:26,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:12:26,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:12:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-08-30 23:12:26,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012875536480687 [2023-08-30 23:12:26,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-08-30 23:12:26,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-08-30 23:12:26,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:26,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-08-30 23:12:26,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 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-08-30 23:12:26,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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-08-30 23:12:26,599 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 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-08-30 23:12:26,599 INFO L175 Difference]: Start difference. First operand has 54 places, 73 transitions, 717 flow. Second operand 5 states and 584 transitions. [2023-08-30 23:12:26,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 180 transitions, 2001 flow [2023-08-30 23:12:26,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 180 transitions, 2001 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:12:26,610 INFO L231 Difference]: Finished difference. Result has 61 places, 81 transitions, 810 flow [2023-08-30 23:12:26,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=810, PETRI_PLACES=61, PETRI_TRANSITIONS=81} [2023-08-30 23:12:26,611 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-30 23:12:26,611 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 810 flow [2023-08-30 23:12:26,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-08-30 23:12:26,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:26,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:26,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:12:26,612 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-08-30 23:12:26,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 315397254, now seen corresponding path program 1 times [2023-08-30 23:12:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027074464] [2023-08-30 23:12:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:27,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027074464] [2023-08-30 23:12:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027074464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:27,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:12:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995013055] [2023-08-30 23:12:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:12:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:12:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:12:27,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-30 23:12:27,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 810 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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-08-30 23:12:27,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:27,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-30 23:12:27,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:28,567 INFO L130 PetriNetUnfolder]: 8713/13064 cut-off events. [2023-08-30 23:12:28,567 INFO L131 PetriNetUnfolder]: For 55921/55921 co-relation queries the response was YES. [2023-08-30 23:12:28,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63708 conditions, 13064 events. 8713/13064 cut-off events. For 55921/55921 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 80654 event pairs, 2452 based on Foata normal form. 78/13142 useless extension candidates. Maximal degree in co-relation 63679. Up to 6257 conditions per place. [2023-08-30 23:12:28,635 INFO L137 encePairwiseOnDemand]: 221/233 looper letters, 82 selfloop transitions, 29 changer transitions 28/140 dead transitions. [2023-08-30 23:12:28,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 140 transitions, 1496 flow [2023-08-30 23:12:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:12:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:12:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-30 23:12:28,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989270386266094 [2023-08-30 23:12:28,638 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-30 23:12:28,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-30 23:12:28,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:28,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-30 23:12:28,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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-08-30 23:12:28,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:28,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 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-08-30 23:12:28,642 INFO L175 Difference]: Start difference. First operand has 61 places, 81 transitions, 810 flow. Second operand 4 states and 465 transitions. [2023-08-30 23:12:28,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 140 transitions, 1496 flow [2023-08-30 23:12:28,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 140 transitions, 1483 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:12:28,693 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 917 flow [2023-08-30 23:12:28,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=917, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2023-08-30 23:12:28,694 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-30 23:12:28,694 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 917 flow [2023-08-30 23:12:28,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 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-08-30 23:12:28,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:28,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:28,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:12:28,695 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-08-30 23:12:28,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -400797303, now seen corresponding path program 1 times [2023-08-30 23:12:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304163921] [2023-08-30 23:12:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304163921] [2023-08-30 23:12:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304163921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:12:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508370863] [2023-08-30 23:12:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:28,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:12:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:12:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:12:28,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-30 23:12:28,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 917 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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-08-30 23:12:28,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:28,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-30 23:12:28,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:29,574 INFO L130 PetriNetUnfolder]: 3649/5824 cut-off events. [2023-08-30 23:12:29,574 INFO L131 PetriNetUnfolder]: For 42680/44786 co-relation queries the response was YES. [2023-08-30 23:12:29,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27807 conditions, 5824 events. 3649/5824 cut-off events. For 42680/44786 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 37700 event pairs, 362 based on Foata normal form. 1290/6992 useless extension candidates. Maximal degree in co-relation 27774. Up to 2673 conditions per place. [2023-08-30 23:12:29,599 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 157 selfloop transitions, 14 changer transitions 22/212 dead transitions. [2023-08-30 23:12:29,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 212 transitions, 2765 flow [2023-08-30 23:12:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:12:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:12:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2023-08-30 23:12:29,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028612303290415 [2023-08-30 23:12:29,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 703 transitions. [2023-08-30 23:12:29,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 703 transitions. [2023-08-30 23:12:29,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:29,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 703 transitions. [2023-08-30 23:12:29,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 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-08-30 23:12:29,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 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-08-30 23:12:29,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 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-08-30 23:12:29,607 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 917 flow. Second operand 6 states and 703 transitions. [2023-08-30 23:12:29,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 212 transitions, 2765 flow [2023-08-30 23:12:29,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 212 transitions, 2725 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-30 23:12:29,650 INFO L231 Difference]: Finished difference. Result has 71 places, 85 transitions, 1001 flow [2023-08-30 23:12:29,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1001, PETRI_PLACES=71, PETRI_TRANSITIONS=85} [2023-08-30 23:12:29,651 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-30 23:12:29,651 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 85 transitions, 1001 flow [2023-08-30 23:12:29,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 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-08-30 23:12:29,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:29,652 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-08-30 23:12:29,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:12:29,652 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-08-30 23:12:29,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1438425478, now seen corresponding path program 1 times [2023-08-30 23:12:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:29,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712073308] [2023-08-30 23:12:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712073308] [2023-08-30 23:12:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712073308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:29,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:12:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265301117] [2023-08-30 23:12:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:12:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:12:29,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:12:29,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-30 23:12:29,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 85 transitions, 1001 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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-08-30 23:12:29,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:29,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-30 23:12:29,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:30,515 INFO L130 PetriNetUnfolder]: 3130/5098 cut-off events. [2023-08-30 23:12:30,515 INFO L131 PetriNetUnfolder]: For 35700/37351 co-relation queries the response was YES. [2023-08-30 23:12:30,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27605 conditions, 5098 events. 3130/5098 cut-off events. For 35700/37351 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 33515 event pairs, 186 based on Foata normal form. 908/5899 useless extension candidates. Maximal degree in co-relation 27568. Up to 2481 conditions per place. [2023-08-30 23:12:30,541 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 146 selfloop transitions, 22 changer transitions 58/243 dead transitions. [2023-08-30 23:12:30,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 243 transitions, 3171 flow [2023-08-30 23:12:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:12:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:12:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2023-08-30 23:12:30,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5021459227467812 [2023-08-30 23:12:30,548 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2023-08-30 23:12:30,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2023-08-30 23:12:30,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:30,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2023-08-30 23:12:30,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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-08-30 23:12:30,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 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-08-30 23:12:30,557 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 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-08-30 23:12:30,557 INFO L175 Difference]: Start difference. First operand has 71 places, 85 transitions, 1001 flow. Second operand 8 states and 936 transitions. [2023-08-30 23:12:30,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 243 transitions, 3171 flow [2023-08-30 23:12:30,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 243 transitions, 3108 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-30 23:12:30,775 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 1018 flow [2023-08-30 23:12:30,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1018, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2023-08-30 23:12:30,776 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-08-30 23:12:30,776 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 1018 flow [2023-08-30 23:12:30,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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-08-30 23:12:30,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:30,776 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] [2023-08-30 23:12:30,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:12:30,777 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-08-30 23:12:30,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash -555316572, now seen corresponding path program 1 times [2023-08-30 23:12:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608301640] [2023-08-30 23:12:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:30,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608301640] [2023-08-30 23:12:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608301640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:12:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356536239] [2023-08-30 23:12:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:31,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:12:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:12:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:12:31,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-30 23:12:31,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 1018 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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-08-30 23:12:31,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:31,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-30 23:12:31,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:31,665 INFO L130 PetriNetUnfolder]: 2873/4768 cut-off events. [2023-08-30 23:12:31,665 INFO L131 PetriNetUnfolder]: For 32565/33601 co-relation queries the response was YES. [2023-08-30 23:12:31,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25857 conditions, 4768 events. 2873/4768 cut-off events. For 32565/33601 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32009 event pairs, 170 based on Foata normal form. 502/5165 useless extension candidates. Maximal degree in co-relation 25818. Up to 1724 conditions per place. [2023-08-30 23:12:31,685 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 82 selfloop transitions, 21 changer transitions 122/234 dead transitions. [2023-08-30 23:12:31,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 234 transitions, 3068 flow [2023-08-30 23:12:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 23:12:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 23:12:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1144 transitions. [2023-08-30 23:12:31,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49098712446351933 [2023-08-30 23:12:31,689 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1144 transitions. [2023-08-30 23:12:31,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1144 transitions. [2023-08-30 23:12:31,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:31,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1144 transitions. [2023-08-30 23:12:31,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.4) internal successors, (1144), 10 states have internal predecessors, (1144), 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-08-30 23:12:31,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 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-08-30 23:12:31,696 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 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-08-30 23:12:31,696 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 1018 flow. Second operand 10 states and 1144 transitions. [2023-08-30 23:12:31,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 234 transitions, 3068 flow [2023-08-30 23:12:31,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 234 transitions, 2862 flow, removed 44 selfloop flow, removed 6 redundant places. [2023-08-30 23:12:31,946 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 557 flow [2023-08-30 23:12:31,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=557, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2023-08-30 23:12:31,947 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-08-30 23:12:31,947 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 557 flow [2023-08-30 23:12:31,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 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-08-30 23:12:31,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:31,948 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, 1, 1] [2023-08-30 23:12:31,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:12:31,948 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-08-30 23:12:31,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash -957372334, now seen corresponding path program 1 times [2023-08-30 23:12:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993658254] [2023-08-30 23:12:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:32,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993658254] [2023-08-30 23:12:32,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993658254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:32,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:32,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:12:32,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010824227] [2023-08-30 23:12:32,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:32,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:12:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:12:32,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:12:33,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-08-30 23:12:33,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 58 transitions, 557 flow. Second operand has 9 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 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-08-30 23:12:33,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:33,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-08-30 23:12:33,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:33,849 INFO L130 PetriNetUnfolder]: 1457/2493 cut-off events. [2023-08-30 23:12:33,849 INFO L131 PetriNetUnfolder]: For 12820/12820 co-relation queries the response was YES. [2023-08-30 23:12:33,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12902 conditions, 2493 events. 1457/2493 cut-off events. For 12820/12820 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14054 event pairs, 52 based on Foata normal form. 2/2495 useless extension candidates. Maximal degree in co-relation 12862. Up to 905 conditions per place. [2023-08-30 23:12:33,858 INFO L137 encePairwiseOnDemand]: 219/233 looper letters, 44 selfloop transitions, 9 changer transitions 207/260 dead transitions. [2023-08-30 23:12:33,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 260 transitions, 2911 flow [2023-08-30 23:12:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 23:12:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 23:12:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1376 transitions. [2023-08-30 23:12:33,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45427533839551004 [2023-08-30 23:12:33,864 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1376 transitions. [2023-08-30 23:12:33,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1376 transitions. [2023-08-30 23:12:33,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:33,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1376 transitions. [2023-08-30 23:12:33,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.84615384615384) internal successors, (1376), 13 states have internal predecessors, (1376), 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-08-30 23:12:33,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 233.0) internal successors, (3262), 14 states have internal predecessors, (3262), 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-08-30 23:12:33,873 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 233.0) internal successors, (3262), 14 states have internal predecessors, (3262), 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-08-30 23:12:33,873 INFO L175 Difference]: Start difference. First operand has 84 places, 58 transitions, 557 flow. Second operand 13 states and 1376 transitions. [2023-08-30 23:12:33,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 260 transitions, 2911 flow [2023-08-30 23:12:33,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 260 transitions, 2282 flow, removed 117 selfloop flow, removed 17 redundant places. [2023-08-30 23:12:33,908 INFO L231 Difference]: Finished difference. Result has 84 places, 42 transitions, 318 flow [2023-08-30 23:12:33,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=318, PETRI_PLACES=84, PETRI_TRANSITIONS=42} [2023-08-30 23:12:33,909 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-08-30 23:12:33,909 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 42 transitions, 318 flow [2023-08-30 23:12:33,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 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-08-30 23:12:33,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:33,910 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, 1, 1] [2023-08-30 23:12:33,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:12:33,910 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-08-30 23:12:33,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash 877810578, now seen corresponding path program 2 times [2023-08-30 23:12:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:33,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853844659] [2023-08-30 23:12:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:12:35,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:12:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:12:35,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853844659] [2023-08-30 23:12:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853844659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:12:35,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:12:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:12:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128879405] [2023-08-30 23:12:35,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:12:35,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:12:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:12:35,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:12:35,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:12:35,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-08-30 23:12:35,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 42 transitions, 318 flow. Second operand has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 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-08-30 23:12:35,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:12:35,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-08-30 23:12:35,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:12:35,598 INFO L130 PetriNetUnfolder]: 164/316 cut-off events. [2023-08-30 23:12:35,598 INFO L131 PetriNetUnfolder]: For 1154/1157 co-relation queries the response was YES. [2023-08-30 23:12:35,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 316 events. 164/316 cut-off events. For 1154/1157 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1125 event pairs, 20 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1496. Up to 152 conditions per place. [2023-08-30 23:12:35,600 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 41 selfloop transitions, 4 changer transitions 28/76 dead transitions. [2023-08-30 23:12:35,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 691 flow [2023-08-30 23:12:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:12:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:12:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 796 transitions. [2023-08-30 23:12:35,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880441446965052 [2023-08-30 23:12:35,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 796 transitions. [2023-08-30 23:12:35,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 796 transitions. [2023-08-30 23:12:35,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:12:35,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 796 transitions. [2023-08-30 23:12:35,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 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-08-30 23:12:35,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 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-08-30 23:12:35,608 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 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-08-30 23:12:35,608 INFO L175 Difference]: Start difference. First operand has 84 places, 42 transitions, 318 flow. Second operand 7 states and 796 transitions. [2023-08-30 23:12:35,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 691 flow [2023-08-30 23:12:35,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 560 flow, removed 30 selfloop flow, removed 19 redundant places. [2023-08-30 23:12:35,612 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 211 flow [2023-08-30 23:12:35,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-30 23:12:35,613 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-30 23:12:35,613 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 211 flow [2023-08-30 23:12:35,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.55555555555556) internal successors, (995), 9 states have internal predecessors, (995), 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-08-30 23:12:35,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:12:35,614 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, 1, 1] [2023-08-30 23:12:35,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:12:35,614 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-08-30 23:12:35,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:12:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1413899352, now seen corresponding path program 3 times [2023-08-30 23:12:35,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:12:35,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634041897] [2023-08-30 23:12:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:12:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:12:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:12:35,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:12:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:12:35,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:12:35,763 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:12:35,764 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:12:35,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:12:35,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:12:35,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:12:35,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:12:35,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:12:35,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:12:35,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:12:35,769 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:12:35,774 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:12:35,774 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:12:35,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:12:35 BasicIcfg [2023-08-30 23:12:35,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:12:35,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:12:35,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:12:35,860 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:12:35,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:12:11" (3/4) ... [2023-08-30 23:12:35,862 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:12:35,948 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:12:35,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:12:35,949 INFO L158 Benchmark]: Toolchain (without parser) took 26140.80ms. Allocated memory was 71.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 47.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 389.4MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,949 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.2MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:12:35,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.76ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 39.6MB in the end (delta: 7.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.80ms. Allocated memory is still 71.3MB. Free memory was 39.6MB in the beginning and 36.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,950 INFO L158 Benchmark]: Boogie Preprocessor took 61.56ms. Allocated memory is still 71.3MB. Free memory was 36.5MB in the beginning and 34.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,950 INFO L158 Benchmark]: RCFGBuilder took 731.64ms. Allocated memory is still 71.3MB. Free memory was 34.3MB in the beginning and 30.0MB in the end (delta: 4.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,951 INFO L158 Benchmark]: TraceAbstraction took 24592.91ms. Allocated memory was 71.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 29.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 353.2MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,951 INFO L158 Benchmark]: Witness Printer took 88.38ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:12:35,955 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.18ms. Allocated memory is still 54.5MB. Free memory was 32.2MB in the beginning and 32.2MB in the end (delta: 33.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.76ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 39.6MB in the end (delta: 7.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.80ms. Allocated memory is still 71.3MB. Free memory was 39.6MB in the beginning and 36.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.56ms. Allocated memory is still 71.3MB. Free memory was 36.5MB in the beginning and 34.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 731.64ms. Allocated memory is still 71.3MB. Free memory was 34.3MB in the beginning and 30.0MB in the end (delta: 4.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24592.91ms. Allocated memory was 71.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 29.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 353.2MB. Max. memory is 16.1GB. * Witness Printer took 88.38ms. Allocated memory is still 2.0GB. Free memory was 1.6GB in the beginning and 1.5GB 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: 4.9s, 134 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 28 TransitionsAfterwards, 2836 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 7579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3365, independent: 3147, independent conditional: 0, independent unconditional: 3147, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1543, independent: 1498, independent conditional: 0, independent unconditional: 1498, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3365, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1543, unknown conditional: 0, unknown unconditional: 1543] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 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; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t825, ((void *)0), P0, ((void *)0))=-3, t825={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] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t826, ((void *)0), P1, ((void *)0))=-2, t825={5:0}, t826={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] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t827, ((void *)0), P2, ((void *)0))=-1, t825={5:0}, t826={6:0}, t827={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] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t828, ((void *)0), P3, ((void *)0))=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=1, 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=2, 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_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=2, 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_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 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) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 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 [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 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_p3_EAX=2, __unbuffered_p3_EBX=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, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice2=1, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L877] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L878] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L879] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L880] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L882] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 [L887] 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_p3_EAX=2, __unbuffered_p3_EBX=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=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 855]: 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: 859]: 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: 853]: 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: 857]: 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, 162 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: 24.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 581 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1602 IncrementalHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 133 mSDtfsCounter, 1602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1018occurred in iteration=9, InterpolantAutomatonStates: 71, 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.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2505 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-08-30 23:12:35,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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