./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:51:17,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:51:17,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:51:17,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:51:17,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:51:17,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:51:17,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:51:17,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:51:17,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:51:17,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:51:17,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:51:17,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:51:17,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:51:17,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:51:17,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:51:17,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:51:17,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:51:17,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:51:17,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:51:17,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:51:17,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:51:17,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:51:17,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:51:17,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:51:17,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:51:17,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:51:17,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:51:17,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:51:17,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:51:17,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:51:17,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:51:17,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:51:17,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:51:17,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:51:17,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:51:17,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:51:17,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:51:17,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:51:17,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:51:17,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:51:17,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:51:17,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:51:17,838 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:51:17,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:51:17,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:51:17,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:51:17,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:51:17,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:51:17,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:51:17,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:51:17,841 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:51:17,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:51:17,842 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:51:17,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:51:17,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:51:17,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:51:17,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:51:17,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:51:17,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:51:17,844 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:51:17,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:51:17,844 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:51:17,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:51:17,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:51:17,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:51:17,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:51:17,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:51:17,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:51:17,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:51:17,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:51:17,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:51:17,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:51:17,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:51:17,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:51:17,846 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:51:17,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:51:17,847 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:51:17,847 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:51:18,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:51:18,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:51:18,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:51:18,170 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:51:18,170 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:51:18,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-09-01 09:51:19,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:51:19,687 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:51:19,697 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-09-01 09:51:19,709 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c2b0674/03652b9f3cf5494a85979ec13a1e2647/FLAGd0dae9f7f [2023-09-01 09:51:19,725 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c2b0674/03652b9f3cf5494a85979ec13a1e2647 [2023-09-01 09:51:19,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:51:19,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:51:19,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:51:19,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:51:19,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:51:19,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:51:19" (1/1) ... [2023-09-01 09:51:19,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29093146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:19, skipping insertion in model container [2023-09-01 09:51:19,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:51:19" (1/1) ... [2023-09-01 09:51:19,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:51:19,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:51:19,911 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/mix046.opt.i[944,957] [2023-09-01 09:51:20,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:51:20,124 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:51:20,138 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/mix046.opt.i[944,957] [2023-09-01 09:51:20,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:51:20,247 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:51:20,247 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:51:20,253 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:51:20,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20 WrapperNode [2023-09-01 09:51:20,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:51:20,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:51:20,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:51:20,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:51:20,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,329 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-09-01 09:51:20,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:51:20,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:51:20,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:51:20,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:51:20,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,380 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:51:20,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:51:20,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:51:20,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:51:20,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (1/1) ... [2023-09-01 09:51:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:51:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:51:20,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:51:20,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:51:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:51:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:51:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:51:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:51:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:51:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:51:20,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:51:20,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:51:20,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:51:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:51:20,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:51:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:51:20,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:51:20,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:51:20,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:51:20,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:51:20,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:51:20,474 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:51:20,657 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:51:20,659 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:51:20,976 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:51:21,111 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:51:21,111 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:51:21,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:51:21 BoogieIcfgContainer [2023-09-01 09:51:21,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:51:21,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:51:21,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:51:21,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:51:21,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:51:19" (1/3) ... [2023-09-01 09:51:21,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79657f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:51:21, skipping insertion in model container [2023-09-01 09:51:21,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:51:20" (2/3) ... [2023-09-01 09:51:21,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79657f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:51:21, skipping insertion in model container [2023-09-01 09:51:21,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:51:21" (3/3) ... [2023-09-01 09:51:21,121 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2023-09-01 09:51:21,128 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:51:21,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:51:21,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:51:21,137 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:51:21,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:51:21,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:51:21,320 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:51:21,320 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:51:21,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:51:21,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:51:21,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:21,340 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:51:21,360 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:21,364 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:21,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-09-01 09:51:21,416 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:51:21,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:51:21,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:51:21,421 INFO L119 LiptonReduction]: Number of co-enabled transitions 2936 [2023-09-01 09:51:25,442 INFO L134 LiptonReduction]: Checked pairs total: 7888 [2023-09-01 09:51:25,443 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-09-01 09:51:25,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:51:25,460 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;@58a8c493, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:51:25,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:51:25,466 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-09-01 09:51:25,466 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:51:25,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:25,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:25,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:25,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -549343229, now seen corresponding path program 1 times [2023-09-01 09:51:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11778911] [2023-09-01 09:51:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:25,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11778911] [2023-09-01 09:51:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11778911] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:25,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:51:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341589514] [2023-09-01 09:51:25,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:25,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:51:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:51:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:51:25,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 238 [2023-09-01 09:51:25,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:25,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:25,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 238 [2023-09-01 09:51:25,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:26,589 INFO L130 PetriNetUnfolder]: 3632/5266 cut-off events. [2023-09-01 09:51:26,590 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-09-01 09:51:26,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10359 conditions, 5266 events. 3632/5266 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29262 event pairs, 668 based on Foata normal form. 180/5073 useless extension candidates. Maximal degree in co-relation 10347. Up to 3973 conditions per place. [2023-09-01 09:51:26,624 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-09-01 09:51:26,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 172 flow [2023-09-01 09:51:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-09-01 09:51:26,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5448179271708683 [2023-09-01 09:51:26,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-09-01 09:51:26,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-09-01 09:51:26,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:26,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-09-01 09:51:26,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:26,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:26,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:26,671 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 389 transitions. [2023-09-01 09:51:26,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 172 flow [2023-09-01 09:51:26,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:26,677 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-09-01 09:51:26,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-09-01 09:51:26,682 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-09-01 09:51:26,682 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-09-01 09:51:26,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:26,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:26,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:26,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:51:26,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:26,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1655972183, now seen corresponding path program 1 times [2023-09-01 09:51:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:26,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277743329] [2023-09-01 09:51:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:26,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:27,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277743329] [2023-09-01 09:51:27,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277743329] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:27,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:27,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:51:27,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299217341] [2023-09-01 09:51:27,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:27,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:51:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:51:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:51:27,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-09-01 09:51:27,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:27,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:27,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-09-01 09:51:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:28,548 INFO L130 PetriNetUnfolder]: 7831/10840 cut-off events. [2023-09-01 09:51:28,548 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2023-09-01 09:51:28,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22086 conditions, 10840 events. 7831/10840 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 54337 event pairs, 1655 based on Foata normal form. 512/11332 useless extension candidates. Maximal degree in co-relation 22076. Up to 5665 conditions per place. [2023-09-01 09:51:28,610 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 41 selfloop transitions, 9 changer transitions 35/86 dead transitions. [2023-09-01 09:51:28,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 86 transitions, 356 flow [2023-09-01 09:51:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2023-09-01 09:51:28,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48559423769507803 [2023-09-01 09:51:28,614 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 809 transitions. [2023-09-01 09:51:28,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 809 transitions. [2023-09-01 09:51:28,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:28,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 809 transitions. [2023-09-01 09:51:28,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:28,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:28,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:28,622 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 7 states and 809 transitions. [2023-09-01 09:51:28,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 86 transitions, 356 flow [2023-09-01 09:51:28,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 86 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:28,630 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 148 flow [2023-09-01 09:51:28,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-09-01 09:51:28,631 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-09-01 09:51:28,631 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 148 flow [2023-09-01 09:51:28,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:28,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:28,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:28,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:51:28,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:28,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2124299327, now seen corresponding path program 1 times [2023-09-01 09:51:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635397302] [2023-09-01 09:51:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635397302] [2023-09-01 09:51:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635397302] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:28,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:51:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827579431] [2023-09-01 09:51:28,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:28,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:28,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:28,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 238 [2023-09-01 09:51:28,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:28,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:28,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 238 [2023-09-01 09:51:28,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:29,907 INFO L130 PetriNetUnfolder]: 6126/9007 cut-off events. [2023-09-01 09:51:29,907 INFO L131 PetriNetUnfolder]: For 9378/9603 co-relation queries the response was YES. [2023-09-01 09:51:29,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25807 conditions, 9007 events. 6126/9007 cut-off events. For 9378/9603 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 50904 event pairs, 2148 based on Foata normal form. 374/9174 useless extension candidates. Maximal degree in co-relation 25791. Up to 6667 conditions per place. [2023-09-01 09:51:29,969 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 41 selfloop transitions, 4 changer transitions 21/71 dead transitions. [2023-09-01 09:51:29,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 424 flow [2023-09-01 09:51:29,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:51:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:51:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-09-01 09:51:29,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243697478991597 [2023-09-01 09:51:29,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-09-01 09:51:29,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-09-01 09:51:29,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:29,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-09-01 09:51:29,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:29,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:29,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:29,978 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 148 flow. Second operand 5 states and 624 transitions. [2023-09-01 09:51:29,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 424 flow [2023-09-01 09:51:30,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 417 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:30,009 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 188 flow [2023-09-01 09:51:30,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-09-01 09:51:30,010 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-09-01 09:51:30,011 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 188 flow [2023-09-01 09:51:30,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:30,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:30,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:30,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:51:30,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:30,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1428745234, now seen corresponding path program 1 times [2023-09-01 09:51:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:30,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302414087] [2023-09-01 09:51:30,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:30,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302414087] [2023-09-01 09:51:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302414087] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671098407] [2023-09-01 09:51:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:30,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:30,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:30,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:30,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:30,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:30,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:31,691 INFO L130 PetriNetUnfolder]: 6897/9945 cut-off events. [2023-09-01 09:51:31,691 INFO L131 PetriNetUnfolder]: For 12573/12908 co-relation queries the response was YES. [2023-09-01 09:51:31,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29700 conditions, 9945 events. 6897/9945 cut-off events. For 12573/12908 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 53842 event pairs, 2097 based on Foata normal form. 390/10080 useless extension candidates. Maximal degree in co-relation 29681. Up to 6565 conditions per place. [2023-09-01 09:51:31,753 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 49 selfloop transitions, 6 changer transitions 21/84 dead transitions. [2023-09-01 09:51:31,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 535 flow [2023-09-01 09:51:31,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:51:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:51:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-09-01 09:51:31,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161064425770309 [2023-09-01 09:51:31,756 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-09-01 09:51:31,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-09-01 09:51:31,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:31,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-09-01 09:51:31,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:31,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:31,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:31,763 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 188 flow. Second operand 6 states and 737 transitions. [2023-09-01 09:51:31,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 535 flow [2023-09-01 09:51:31,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 523 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 09:51:31,789 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 233 flow [2023-09-01 09:51:31,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-09-01 09:51:31,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-09-01 09:51:31,791 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 233 flow [2023-09-01 09:51:31,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:31,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:31,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:31,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:51:31,792 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:31,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1807966998, now seen corresponding path program 1 times [2023-09-01 09:51:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822433402] [2023-09-01 09:51:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:32,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822433402] [2023-09-01 09:51:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822433402] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:32,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356019303] [2023-09-01 09:51:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:32,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:32,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:32,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:32,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:32,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:32,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:32,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:33,378 INFO L130 PetriNetUnfolder]: 7937/11283 cut-off events. [2023-09-01 09:51:33,378 INFO L131 PetriNetUnfolder]: For 19768/20377 co-relation queries the response was YES. [2023-09-01 09:51:33,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36835 conditions, 11283 events. 7937/11283 cut-off events. For 19768/20377 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 61809 event pairs, 4552 based on Foata normal form. 492/11448 useless extension candidates. Maximal degree in co-relation 36813. Up to 7888 conditions per place. [2023-09-01 09:51:33,461 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 48 selfloop transitions, 16 changer transitions 19/91 dead transitions. [2023-09-01 09:51:33,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 639 flow [2023-09-01 09:51:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-09-01 09:51:33,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096038415366146 [2023-09-01 09:51:33,464 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-09-01 09:51:33,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-09-01 09:51:33,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:33,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-09-01 09:51:33,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:33,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:33,470 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:33,470 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 233 flow. Second operand 7 states and 849 transitions. [2023-09-01 09:51:33,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 639 flow [2023-09-01 09:51:33,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 635 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 09:51:33,502 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 389 flow [2023-09-01 09:51:33,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-09-01 09:51:33,503 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-09-01 09:51:33,503 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 389 flow [2023-09-01 09:51:33,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:33,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:33,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:33,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:51:33,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:33,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:33,505 INFO L85 PathProgramCache]: Analyzing trace with hash -935485018, now seen corresponding path program 2 times [2023-09-01 09:51:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:33,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447489334] [2023-09-01 09:51:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447489334] [2023-09-01 09:51:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447489334] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376695877] [2023-09-01 09:51:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:34,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:51:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:34,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:51:34,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:51:34,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:34,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:34,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:34,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:34,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:35,194 INFO L130 PetriNetUnfolder]: 8844/12627 cut-off events. [2023-09-01 09:51:35,194 INFO L131 PetriNetUnfolder]: For 37116/38191 co-relation queries the response was YES. [2023-09-01 09:51:35,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47707 conditions, 12627 events. 8844/12627 cut-off events. For 37116/38191 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 70967 event pairs, 1541 based on Foata normal form. 446/12632 useless extension candidates. Maximal degree in co-relation 47680. Up to 8453 conditions per place. [2023-09-01 09:51:35,287 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 68 selfloop transitions, 15 changer transitions 11/102 dead transitions. [2023-09-01 09:51:35,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 840 flow [2023-09-01 09:51:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:51:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:51:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-09-01 09:51:35,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-09-01 09:51:35,290 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-09-01 09:51:35,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-09-01 09:51:35,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:35,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-09-01 09:51:35,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:35,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:35,295 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:35,295 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 389 flow. Second operand 6 states and 735 transitions. [2023-09-01 09:51:35,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 840 flow [2023-09-01 09:51:35,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 811 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-09-01 09:51:35,406 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 524 flow [2023-09-01 09:51:35,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2023-09-01 09:51:35,409 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-09-01 09:51:35,409 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 524 flow [2023-09-01 09:51:35,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:35,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:35,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:35,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:51:35,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:35,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1842044058, now seen corresponding path program 3 times [2023-09-01 09:51:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438253454] [2023-09-01 09:51:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438253454] [2023-09-01 09:51:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438253454] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:35,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132942900] [2023-09-01 09:51:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:35,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:51:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:51:35,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:51:35,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-09-01 09:51:35,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 524 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:35,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:35,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-09-01 09:51:35,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:37,331 INFO L130 PetriNetUnfolder]: 8787/12576 cut-off events. [2023-09-01 09:51:37,331 INFO L131 PetriNetUnfolder]: For 39902/40961 co-relation queries the response was YES. [2023-09-01 09:51:37,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49678 conditions, 12576 events. 8787/12576 cut-off events. For 39902/40961 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 71129 event pairs, 1684 based on Foata normal form. 838/13030 useless extension candidates. Maximal degree in co-relation 49650. Up to 8133 conditions per place. [2023-09-01 09:51:37,451 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 63 selfloop transitions, 21 changer transitions 11/103 dead transitions. [2023-09-01 09:51:37,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 901 flow [2023-09-01 09:51:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2023-09-01 09:51:37,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054021608643458 [2023-09-01 09:51:37,454 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2023-09-01 09:51:37,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2023-09-01 09:51:37,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:37,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2023-09-01 09:51:37,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:37,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:37,461 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:37,461 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 524 flow. Second operand 7 states and 842 transitions. [2023-09-01 09:51:37,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 901 flow [2023-09-01 09:51:37,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 103 transitions, 859 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:37,603 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 572 flow [2023-09-01 09:51:37,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2023-09-01 09:51:37,604 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-09-01 09:51:37,604 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 572 flow [2023-09-01 09:51:37,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:37,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:37,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:37,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:51:37,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:37,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 206644262, now seen corresponding path program 4 times [2023-09-01 09:51:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209529102] [2023-09-01 09:51:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:38,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:38,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209529102] [2023-09-01 09:51:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209529102] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:38,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170383102] [2023-09-01 09:51:38,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:38,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:51:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:51:38,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:51:38,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 238 [2023-09-01 09:51:38,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 572 flow. Second operand has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:38,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:38,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 238 [2023-09-01 09:51:38,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:40,193 INFO L130 PetriNetUnfolder]: 12277/17106 cut-off events. [2023-09-01 09:51:40,193 INFO L131 PetriNetUnfolder]: For 47527/47527 co-relation queries the response was YES. [2023-09-01 09:51:40,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67560 conditions, 17106 events. 12277/17106 cut-off events. For 47527/47527 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 90446 event pairs, 899 based on Foata normal form. 488/17594 useless extension candidates. Maximal degree in co-relation 67532. Up to 8912 conditions per place. [2023-09-01 09:51:40,281 INFO L137 encePairwiseOnDemand]: 225/238 looper letters, 92 selfloop transitions, 56 changer transitions 45/193 dead transitions. [2023-09-01 09:51:40,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 193 transitions, 1781 flow [2023-09-01 09:51:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:51:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:51:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1128 transitions. [2023-09-01 09:51:40,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47394957983193275 [2023-09-01 09:51:40,286 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1128 transitions. [2023-09-01 09:51:40,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1128 transitions. [2023-09-01 09:51:40,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:40,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1128 transitions. [2023-09-01 09:51:40,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:40,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:40,295 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 238.0) internal successors, (2618), 11 states have internal predecessors, (2618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:40,295 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 572 flow. Second operand 10 states and 1128 transitions. [2023-09-01 09:51:40,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 193 transitions, 1781 flow [2023-09-01 09:51:40,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 193 transitions, 1774 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:40,451 INFO L231 Difference]: Finished difference. Result has 80 places, 103 transitions, 1193 flow [2023-09-01 09:51:40,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1193, PETRI_PLACES=80, PETRI_TRANSITIONS=103} [2023-09-01 09:51:40,454 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2023-09-01 09:51:40,454 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 103 transitions, 1193 flow [2023-09-01 09:51:40,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:40,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:40,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:40,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:51:40,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:40,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:40,459 INFO L85 PathProgramCache]: Analyzing trace with hash -173942689, now seen corresponding path program 1 times [2023-09-01 09:51:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141145182] [2023-09-01 09:51:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:40,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141145182] [2023-09-01 09:51:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141145182] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:41,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:51:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324700995] [2023-09-01 09:51:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:51:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:51:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:51:41,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:41,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 103 transitions, 1193 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:41,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:41,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:41,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:42,802 INFO L130 PetriNetUnfolder]: 10196/14838 cut-off events. [2023-09-01 09:51:42,802 INFO L131 PetriNetUnfolder]: For 91127/92292 co-relation queries the response was YES. [2023-09-01 09:51:42,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71990 conditions, 14838 events. 10196/14838 cut-off events. For 91127/92292 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 87241 event pairs, 1551 based on Foata normal form. 550/15260 useless extension candidates. Maximal degree in co-relation 71954. Up to 9127 conditions per place. [2023-09-01 09:51:42,917 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 89 selfloop transitions, 30 changer transitions 14/151 dead transitions. [2023-09-01 09:51:42,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 151 transitions, 1755 flow [2023-09-01 09:51:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-09-01 09:51:42,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-09-01 09:51:42,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-09-01 09:51:42,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-09-01 09:51:42,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:42,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-09-01 09:51:42,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:42,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:42,928 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:42,928 INFO L175 Difference]: Start difference. First operand has 80 places, 103 transitions, 1193 flow. Second operand 7 states and 854 transitions. [2023-09-01 09:51:42,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 151 transitions, 1755 flow [2023-09-01 09:51:43,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 151 transitions, 1698 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-09-01 09:51:43,211 INFO L231 Difference]: Finished difference. Result has 84 places, 112 transitions, 1373 flow [2023-09-01 09:51:43,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1373, PETRI_PLACES=84, PETRI_TRANSITIONS=112} [2023-09-01 09:51:43,212 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-09-01 09:51:43,212 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 112 transitions, 1373 flow [2023-09-01 09:51:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:43,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:43,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:51:43,213 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:43,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 210446017, now seen corresponding path program 2 times [2023-09-01 09:51:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219267771] [2023-09-01 09:51:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219267771] [2023-09-01 09:51:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219267771] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:51:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498497160] [2023-09-01 09:51:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:43,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:51:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:51:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:51:43,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:51:43,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 112 transitions, 1373 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:43,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:43,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:51:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:45,338 INFO L130 PetriNetUnfolder]: 9803/14281 cut-off events. [2023-09-01 09:51:45,338 INFO L131 PetriNetUnfolder]: For 94003/94906 co-relation queries the response was YES. [2023-09-01 09:51:45,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70742 conditions, 14281 events. 9803/14281 cut-off events. For 94003/94906 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 83257 event pairs, 1767 based on Foata normal form. 550/14767 useless extension candidates. Maximal degree in co-relation 70703. Up to 5450 conditions per place. [2023-09-01 09:51:45,463 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 92 selfloop transitions, 36 changer transitions 14/160 dead transitions. [2023-09-01 09:51:45,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1975 flow [2023-09-01 09:51:45,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-09-01 09:51:45,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49939975990396157 [2023-09-01 09:51:45,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-09-01 09:51:45,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-09-01 09:51:45,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:45,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-09-01 09:51:45,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:45,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:45,471 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:45,471 INFO L175 Difference]: Start difference. First operand has 84 places, 112 transitions, 1373 flow. Second operand 7 states and 832 transitions. [2023-09-01 09:51:45,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1975 flow [2023-09-01 09:51:45,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1893 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-09-01 09:51:45,759 INFO L231 Difference]: Finished difference. Result has 87 places, 112 transitions, 1409 flow [2023-09-01 09:51:45,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1409, PETRI_PLACES=87, PETRI_TRANSITIONS=112} [2023-09-01 09:51:45,760 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-09-01 09:51:45,760 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 112 transitions, 1409 flow [2023-09-01 09:51:45,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:45,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:45,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:45,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:51:45,761 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:45,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1269016347, now seen corresponding path program 1 times [2023-09-01 09:51:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406993135] [2023-09-01 09:51:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406993135] [2023-09-01 09:51:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406993135] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:45,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:51:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154523660] [2023-09-01 09:51:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:45,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:51:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:51:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:51:45,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:45,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 112 transitions, 1409 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:45,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:45,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:45,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:46,816 INFO L130 PetriNetUnfolder]: 5480/8296 cut-off events. [2023-09-01 09:51:46,816 INFO L131 PetriNetUnfolder]: For 67130/68270 co-relation queries the response was YES. [2023-09-01 09:51:46,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42271 conditions, 8296 events. 5480/8296 cut-off events. For 67130/68270 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 50012 event pairs, 1077 based on Foata normal form. 762/8847 useless extension candidates. Maximal degree in co-relation 42231. Up to 6781 conditions per place. [2023-09-01 09:51:46,880 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 128 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2023-09-01 09:51:46,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 2218 flow [2023-09-01 09:51:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:51:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:51:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-09-01 09:51:46,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280112044817927 [2023-09-01 09:51:46,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-09-01 09:51:46,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-09-01 09:51:46,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:46,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-09-01 09:51:46,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:46,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:46,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:46,884 INFO L175 Difference]: Start difference. First operand has 87 places, 112 transitions, 1409 flow. Second operand 3 states and 377 transitions. [2023-09-01 09:51:46,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 2218 flow [2023-09-01 09:51:46,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 156 transitions, 2100 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-09-01 09:51:46,936 INFO L231 Difference]: Finished difference. Result has 81 places, 116 transitions, 1360 flow [2023-09-01 09:51:46,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1360, PETRI_PLACES=81, PETRI_TRANSITIONS=116} [2023-09-01 09:51:46,937 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-09-01 09:51:46,937 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 116 transitions, 1360 flow [2023-09-01 09:51:46,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:46,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:46,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:46,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:51:46,937 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:46,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 133075035, now seen corresponding path program 1 times [2023-09-01 09:51:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984457215] [2023-09-01 09:51:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984457215] [2023-09-01 09:51:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984457215] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:47,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:51:47,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809554304] [2023-09-01 09:51:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:47,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:51:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:51:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:51:47,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:47,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 116 transitions, 1360 flow. Second operand has 4 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-09-01 09:51:47,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:47,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:47,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:47,678 INFO L130 PetriNetUnfolder]: 2668/4287 cut-off events. [2023-09-01 09:51:47,678 INFO L131 PetriNetUnfolder]: For 29227/29820 co-relation queries the response was YES. [2023-09-01 09:51:47,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22556 conditions, 4287 events. 2668/4287 cut-off events. For 29227/29820 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 24737 event pairs, 358 based on Foata normal form. 638/4825 useless extension candidates. Maximal degree in co-relation 22518. Up to 2185 conditions per place. [2023-09-01 09:51:47,705 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 160 selfloop transitions, 9 changer transitions 0/192 dead transitions. [2023-09-01 09:51:47,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 192 transitions, 2624 flow [2023-09-01 09:51:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:51:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:51:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-09-01 09:51:47,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2023-09-01 09:51:47,707 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-09-01 09:51:47,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-09-01 09:51:47,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:47,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-09-01 09:51:47,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:47,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:47,711 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:47,711 INFO L175 Difference]: Start difference. First operand has 81 places, 116 transitions, 1360 flow. Second operand 4 states and 504 transitions. [2023-09-01 09:51:47,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 192 transitions, 2624 flow [2023-09-01 09:51:47,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 192 transitions, 2619 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:51:47,746 INFO L231 Difference]: Finished difference. Result has 84 places, 114 transitions, 1325 flow [2023-09-01 09:51:47,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1325, PETRI_PLACES=84, PETRI_TRANSITIONS=114} [2023-09-01 09:51:47,747 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-09-01 09:51:47,747 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 114 transitions, 1325 flow [2023-09-01 09:51:47,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-09-01 09:51:47,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:47,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:47,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:51:47,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:47,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 517969105, now seen corresponding path program 1 times [2023-09-01 09:51:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113005044] [2023-09-01 09:51:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113005044] [2023-09-01 09:51:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113005044] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124142795] [2023-09-01 09:51:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:48,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:51:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:51:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:51:48,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-09-01 09:51:48,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 114 transitions, 1325 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:48,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:48,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-09-01 09:51:48,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:48,946 INFO L130 PetriNetUnfolder]: 4207/6624 cut-off events. [2023-09-01 09:51:48,946 INFO L131 PetriNetUnfolder]: For 41796/42050 co-relation queries the response was YES. [2023-09-01 09:51:48,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37052 conditions, 6624 events. 4207/6624 cut-off events. For 41796/42050 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37986 event pairs, 717 based on Foata normal form. 300/6885 useless extension candidates. Maximal degree in co-relation 37012. Up to 3354 conditions per place. [2023-09-01 09:51:48,983 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 102 selfloop transitions, 15 changer transitions 72/193 dead transitions. [2023-09-01 09:51:48,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 193 transitions, 2431 flow [2023-09-01 09:51:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:51:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:51:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2023-09-01 09:51:48,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2023-09-01 09:51:48,985 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 693 transitions. [2023-09-01 09:51:48,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions. [2023-09-01 09:51:48,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:48,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions. [2023-09-01 09:51:48,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:48,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:48,990 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:48,990 INFO L175 Difference]: Start difference. First operand has 84 places, 114 transitions, 1325 flow. Second operand 6 states and 693 transitions. [2023-09-01 09:51:48,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 193 transitions, 2431 flow [2023-09-01 09:51:49,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 193 transitions, 2391 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-09-01 09:51:49,067 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 965 flow [2023-09-01 09:51:49,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=965, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2023-09-01 09:51:49,068 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2023-09-01 09:51:49,069 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 965 flow [2023-09-01 09:51:49,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:49,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:49,069 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] [2023-09-01 09:51:49,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:51:49,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:49,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1726447487, now seen corresponding path program 1 times [2023-09-01 09:51:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:49,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281222748] [2023-09-01 09:51:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:49,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281222748] [2023-09-01 09:51:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281222748] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:49,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217055261] [2023-09-01 09:51:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:49,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-09-01 09:51:49,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 965 flow. Second operand has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:49,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:49,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-09-01 09:51:49,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:50,674 INFO L130 PetriNetUnfolder]: 4507/7316 cut-off events. [2023-09-01 09:51:50,674 INFO L131 PetriNetUnfolder]: For 49790/50110 co-relation queries the response was YES. [2023-09-01 09:51:50,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40894 conditions, 7316 events. 4507/7316 cut-off events. For 49790/50110 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 45961 event pairs, 529 based on Foata normal form. 356/7643 useless extension candidates. Maximal degree in co-relation 40850. Up to 3372 conditions per place. [2023-09-01 09:51:50,724 INFO L137 encePairwiseOnDemand]: 225/238 looper letters, 110 selfloop transitions, 25 changer transitions 115/254 dead transitions. [2023-09-01 09:51:50,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 254 transitions, 3082 flow [2023-09-01 09:51:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 815 transitions. [2023-09-01 09:51:50,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891956782713085 [2023-09-01 09:51:50,728 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 815 transitions. [2023-09-01 09:51:50,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 815 transitions. [2023-09-01 09:51:50,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:50,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 815 transitions. [2023-09-01 09:51:50,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:50,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:50,733 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:50,733 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 965 flow. Second operand 7 states and 815 transitions. [2023-09-01 09:51:50,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 254 transitions, 3082 flow [2023-09-01 09:51:50,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 254 transitions, 3006 flow, removed 38 selfloop flow, removed 3 redundant places. [2023-09-01 09:51:50,835 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 1038 flow [2023-09-01 09:51:50,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1038, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2023-09-01 09:51:50,836 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2023-09-01 09:51:50,837 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 1038 flow [2023-09-01 09:51:50,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:50,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:50,837 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] [2023-09-01 09:51:50,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:51:50,838 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:50,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash -47871991, now seen corresponding path program 2 times [2023-09-01 09:51:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:50,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223197831] [2023-09-01 09:51:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:51,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223197831] [2023-09-01 09:51:51,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223197831] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:51,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:51,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:51:51,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659068760] [2023-09-01 09:51:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:51,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:51:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:51:51,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:51:51,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:51,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 1038 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:51,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:51,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:51,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:51,513 INFO L130 PetriNetUnfolder]: 1570/2657 cut-off events. [2023-09-01 09:51:51,513 INFO L131 PetriNetUnfolder]: For 19752/20273 co-relation queries the response was YES. [2023-09-01 09:51:51,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14435 conditions, 2657 events. 1570/2657 cut-off events. For 19752/20273 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15808 event pairs, 213 based on Foata normal form. 548/3105 useless extension candidates. Maximal degree in co-relation 14387. Up to 899 conditions per place. [2023-09-01 09:51:51,534 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 112 selfloop transitions, 13 changer transitions 20/160 dead transitions. [2023-09-01 09:51:51,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 160 transitions, 2218 flow [2023-09-01 09:51:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:51:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:51:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2023-09-01 09:51:51,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252100840336135 [2023-09-01 09:51:51,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 625 transitions. [2023-09-01 09:51:51,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 625 transitions. [2023-09-01 09:51:51,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:51,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 625 transitions. [2023-09-01 09:51:51,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:51,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:51,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:51,540 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 1038 flow. Second operand 5 states and 625 transitions. [2023-09-01 09:51:51,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 160 transitions, 2218 flow [2023-09-01 09:51:51,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 160 transitions, 2192 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-09-01 09:51:51,571 INFO L231 Difference]: Finished difference. Result has 97 places, 79 transitions, 926 flow [2023-09-01 09:51:51,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=926, PETRI_PLACES=97, PETRI_TRANSITIONS=79} [2023-09-01 09:51:51,572 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2023-09-01 09:51:51,572 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 926 flow [2023-09-01 09:51:51,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:51,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:51,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:51,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:51:51,573 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:51,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash -653521600, now seen corresponding path program 1 times [2023-09-01 09:51:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65366984] [2023-09-01 09:51:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:51,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65366984] [2023-09-01 09:51:51,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65366984] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:51,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130125429] [2023-09-01 09:51:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:51,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:52,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-09-01 09:51:52,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 926 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:52,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:52,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-09-01 09:51:52,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:52,626 INFO L130 PetriNetUnfolder]: 2143/3709 cut-off events. [2023-09-01 09:51:52,627 INFO L131 PetriNetUnfolder]: For 31867/32104 co-relation queries the response was YES. [2023-09-01 09:51:52,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21982 conditions, 3709 events. 2143/3709 cut-off events. For 31867/32104 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23025 event pairs, 315 based on Foata normal form. 179/3862 useless extension candidates. Maximal degree in co-relation 21934. Up to 1435 conditions per place. [2023-09-01 09:51:52,650 INFO L137 encePairwiseOnDemand]: 226/238 looper letters, 104 selfloop transitions, 21 changer transitions 66/194 dead transitions. [2023-09-01 09:51:52,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 194 transitions, 2505 flow [2023-09-01 09:51:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:51:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:51:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 798 transitions. [2023-09-01 09:51:52,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789915966386555 [2023-09-01 09:51:52,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 798 transitions. [2023-09-01 09:51:52,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 798 transitions. [2023-09-01 09:51:52,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:52,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 798 transitions. [2023-09-01 09:51:52,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:52,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:52,658 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:52,658 INFO L175 Difference]: Start difference. First operand has 97 places, 79 transitions, 926 flow. Second operand 7 states and 798 transitions. [2023-09-01 09:51:52,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 194 transitions, 2505 flow [2023-09-01 09:51:52,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 194 transitions, 2362 flow, removed 33 selfloop flow, removed 5 redundant places. [2023-09-01 09:51:52,733 INFO L231 Difference]: Finished difference. Result has 101 places, 76 transitions, 888 flow [2023-09-01 09:51:52,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=888, PETRI_PLACES=101, PETRI_TRANSITIONS=76} [2023-09-01 09:51:52,735 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places. [2023-09-01 09:51:52,735 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 76 transitions, 888 flow [2023-09-01 09:51:52,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:52,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:52,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:52,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 09:51:52,736 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:52,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -885582626, now seen corresponding path program 1 times [2023-09-01 09:51:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536237275] [2023-09-01 09:51:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:51:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:51:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:51:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536237275] [2023-09-01 09:51:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536237275] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:51:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:51:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:51:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106766977] [2023-09-01 09:51:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:51:53,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:51:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:51:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:51:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:51:53,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:51:53,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 76 transitions, 888 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:53,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:51:53,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:51:53,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:51:53,381 INFO L130 PetriNetUnfolder]: 1387/2368 cut-off events. [2023-09-01 09:51:53,381 INFO L131 PetriNetUnfolder]: For 17267/17714 co-relation queries the response was YES. [2023-09-01 09:51:53,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12891 conditions, 2368 events. 1387/2368 cut-off events. For 17267/17714 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14327 event pairs, 181 based on Foata normal form. 361/2633 useless extension candidates. Maximal degree in co-relation 12852. Up to 866 conditions per place. [2023-09-01 09:51:53,397 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 47 selfloop transitions, 17 changer transitions 72/141 dead transitions. [2023-09-01 09:51:53,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 141 transitions, 1954 flow [2023-09-01 09:51:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:51:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:51:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-09-01 09:51:53,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161064425770309 [2023-09-01 09:51:53,401 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-09-01 09:51:53,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-09-01 09:51:53,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:51:53,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-09-01 09:51:53,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:53,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:53,408 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:53,408 INFO L175 Difference]: Start difference. First operand has 101 places, 76 transitions, 888 flow. Second operand 6 states and 737 transitions. [2023-09-01 09:51:53,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 141 transitions, 1954 flow [2023-09-01 09:51:53,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 141 transitions, 1742 flow, removed 24 selfloop flow, removed 12 redundant places. [2023-09-01 09:51:53,451 INFO L231 Difference]: Finished difference. Result has 94 places, 45 transitions, 424 flow [2023-09-01 09:51:53,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=94, PETRI_TRANSITIONS=45} [2023-09-01 09:51:53,452 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-09-01 09:51:53,452 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 45 transitions, 424 flow [2023-09-01 09:51:53,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:51:53,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:51:53,453 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, 1] [2023-09-01 09:51:53,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 09:51:53,453 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:51:53,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:51:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1214942254, now seen corresponding path program 1 times [2023-09-01 09:51:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:51:53,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847544523] [2023-09-01 09:51:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:51:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:51:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:51:53,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:51:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:51:53,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:51:53,566 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:51:53,566 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:51:53,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:51:53,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:51:53,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:51:53,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:51:53,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:51:53,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:51:53,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-09-01 09:51:53,575 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:51:53,581 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:51:53,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:51:53,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:51:53 BasicIcfg [2023-09-01 09:51:53,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:51:53,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:51:53,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:51:53,674 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:51:53,674 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:51:21" (3/4) ... [2023-09-01 09:51:53,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:51:53,770 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:51:53,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:51:53,771 INFO L158 Benchmark]: Toolchain (without parser) took 34042.35ms. Allocated memory was 65.0MB in the beginning and 2.9GB in the end (delta: 2.9GB). Free memory was 41.3MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 348.7MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,771 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 65.0MB. Free memory is still 42.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:51:53,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.31ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 41.1MB in the beginning and 55.5MB in the end (delta: -14.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.57ms. Allocated memory is still 86.0MB. Free memory was 55.5MB in the beginning and 52.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,772 INFO L158 Benchmark]: Boogie Preprocessor took 58.35ms. Allocated memory is still 86.0MB. Free memory was 52.6MB in the beginning and 50.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,772 INFO L158 Benchmark]: RCFGBuilder took 723.50ms. Allocated memory is still 86.0MB. Free memory was 50.5MB in the beginning and 57.2MB in the end (delta: -6.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,773 INFO L158 Benchmark]: TraceAbstraction took 32557.96ms. Allocated memory was 86.0MB in the beginning and 2.9GB in the end (delta: 2.9GB). Free memory was 56.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 322.8MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,773 INFO L158 Benchmark]: Witness Printer took 96.55ms. Allocated memory is still 2.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:51:53,775 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.19ms. Allocated memory is still 65.0MB. Free memory is still 42.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.31ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 41.1MB in the beginning and 55.5MB in the end (delta: -14.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.57ms. Allocated memory is still 86.0MB. Free memory was 55.5MB in the beginning and 52.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.35ms. Allocated memory is still 86.0MB. Free memory was 52.6MB in the beginning and 50.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.50ms. Allocated memory is still 86.0MB. Free memory was 50.5MB in the beginning and 57.2MB in the end (delta: -6.7MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32557.96ms. Allocated memory was 86.0MB in the beginning and 2.9GB in the end (delta: 2.9GB). Free memory was 56.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 322.8MB. Max. memory is 16.1GB. * Witness Printer took 96.55ms. Allocated memory is still 2.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 7888 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3749, independent: 3528, independent conditional: 0, independent unconditional: 3528, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1559, independent: 1527, independent conditional: 0, independent unconditional: 1527, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3749, independent: 2001, independent conditional: 0, independent unconditional: 2001, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1559, unknown conditional: 0, unknown unconditional: 1559] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-2, t1221={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] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-1, t1221={5:0}, t1222={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] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={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] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=1, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=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] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L788] 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) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 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 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L824] 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) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 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 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 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 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 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_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] 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_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 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: 32.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 926 mSDsluCounter, 699 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 599 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2885 IncrementalHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 100 mSDtfsCounter, 2885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1409occurred in iteration=10, InterpolantAutomatonStates: 103, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 2223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:51:53,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE