./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix017_power.opt_rmo.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 c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:45:42,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:45:42,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:45:42,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:45:42,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:45:42,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:45:42,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:45:42,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:45:42,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:45:42,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:45:42,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:45:42,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:45:42,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:45:42,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:45:42,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:45:42,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:45:42,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:45:42,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:45:42,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:45:42,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:45:42,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:45:42,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:45:42,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:45:42,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:45:42,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:45:42,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:45:42,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:45:42,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:45:42,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:45:42,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:45:42,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:45:42,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:45:42,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:45:42,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:45:42,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:45:42,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:45:42,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:45:42,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:45:42,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:45:42,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:45:42,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:45:42,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:45:42,631 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:45:42,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:45:42,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:45:42,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:45:42,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:45:42,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:45:42,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:45:42,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:45:42,634 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:45:42,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:45:42,635 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:45:42,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:45:42,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:45:42,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:45:42,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:45:42,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:45:42,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:45:42,637 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:45:42,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:45:42,637 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:45:42,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:45:42,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:45:42,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:45:42,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:45:42,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:45:42,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:45:42,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:45:42,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:45:42,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:45:42,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:45:42,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:45:42,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:45:42,640 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:45:42,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:45:42,640 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:45:42,640 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 -> c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 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 -> AFTER [2023-08-30 16:45:42,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:45:42,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:45:42,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:45:42,964 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:45:42,964 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:45:42,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-08-30 16:45:44,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:45:44,304 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:45:44,305 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-08-30 16:45:44,316 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4aadd4d/58fd5a8cfdc24036aa957d2ead91c803/FLAG84c6ba9a5 [2023-08-30 16:45:44,334 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4aadd4d/58fd5a8cfdc24036aa957d2ead91c803 [2023-08-30 16:45:44,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:45:44,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:45:44,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:45:44,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:45:44,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:45:44,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e55597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44, skipping insertion in model container [2023-08-30 16:45:44,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:45:44,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:45:44,572 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/mix017_power.opt_rmo.opt.i[958,971] [2023-08-30 16:45:44,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:45:44,800 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:45:44,810 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/mix017_power.opt_rmo.opt.i[958,971] [2023-08-30 16:45:44,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:45:44,899 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:45:44,900 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:45:44,905 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:45:44,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44 WrapperNode [2023-08-30 16:45:44,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:45:44,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:45:44,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:45:44,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:45:44,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,982 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 16:45:44,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:45:44,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:45:44,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:45:44,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:45:44,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:44,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:45,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:45,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:45,006 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:45,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:45,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:45:45,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:45:45,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:45:45,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:45:45,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (1/1) ... [2023-08-30 16:45:45,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:45:45,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:45:45,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:45:45,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:45:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:45:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:45:45,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:45:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:45:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:45:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:45:45,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:45:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:45:45,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:45:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:45:45,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:45:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:45:45,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:45:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:45:45,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:45:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:45:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:45:45,084 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:45:45,256 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:45:45,272 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:45:45,546 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:45:45,683 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:45:45,683 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:45:45,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:45:45 BoogieIcfgContainer [2023-08-30 16:45:45,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:45:45,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:45:45,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:45:45,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:45:45,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:45:44" (1/3) ... [2023-08-30 16:45:45,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1e4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:45:45, skipping insertion in model container [2023-08-30 16:45:45,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:45:44" (2/3) ... [2023-08-30 16:45:45,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db1e4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:45:45, skipping insertion in model container [2023-08-30 16:45:45,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:45:45" (3/3) ... [2023-08-30 16:45:45,697 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2023-08-30 16:45:45,705 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:45:45,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:45:45,714 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:45:45,714 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:45:45,791 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:45:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:45:45,912 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:45:45,912 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:45:45,918 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 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:45:45,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:45:45,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-30 16:45:45,929 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:45:45,944 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:45:45,947 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:45:45,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-30 16:45:45,988 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:45:45,989 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:45:45,991 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 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:45:45,994 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-08-30 16:45:49,727 INFO L134 LiptonReduction]: Checked pairs total: 7686 [2023-08-30 16:45:49,728 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-30 16:45:49,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:45:49,745 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;@2ec5779a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:45:49,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:45:49,750 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-08-30 16:45:49,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:45:49,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:49,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:49,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:49,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:49,761 INFO L85 PathProgramCache]: Analyzing trace with hash 361439951, now seen corresponding path program 1 times [2023-08-30 16:45:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817621346] [2023-08-30 16:45:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817621346] [2023-08-30 16:45:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817621346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:45:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523764516] [2023-08-30 16:45:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:50,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:45:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:45:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:45:50,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 236 [2023-08-30 16:45:50,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:50,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:50,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 236 [2023-08-30 16:45:50,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:50,960 INFO L130 PetriNetUnfolder]: 3415/5055 cut-off events. [2023-08-30 16:45:50,960 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-30 16:45:50,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9883 conditions, 5055 events. 3415/5055 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 28429 event pairs, 649 based on Foata normal form. 0/4826 useless extension candidates. Maximal degree in co-relation 9871. Up to 3703 conditions per place. [2023-08-30 16:45:50,989 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-30 16:45:50,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 179 flow [2023-08-30 16:45:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:45:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:45:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-08-30 16:45:51,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508474576271186 [2023-08-30 16:45:51,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-08-30 16:45:51,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-08-30 16:45:51,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:51,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-08-30 16:45:51,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:51,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:51,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:51,015 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 390 transitions. [2023-08-30 16:45:51,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 179 flow [2023-08-30 16:45:51,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:45:51,020 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-30 16:45:51,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:45:51,025 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 16:45:51,025 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-30 16:45:51,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:51,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:51,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:51,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:45:51,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:51,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1738333228, now seen corresponding path program 1 times [2023-08-30 16:45:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480196012] [2023-08-30 16:45:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:51,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480196012] [2023-08-30 16:45:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480196012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:51,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:45:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961698792] [2023-08-30 16:45:51,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:45:51,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:45:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:45:51,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 236 [2023-08-30 16:45:51,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:51,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:51,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 236 [2023-08-30 16:45:51,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:52,033 INFO L130 PetriNetUnfolder]: 3527/5104 cut-off events. [2023-08-30 16:45:52,034 INFO L131 PetriNetUnfolder]: For 330/330 co-relation queries the response was YES. [2023-08-30 16:45:52,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 5104 events. 3527/5104 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26305 event pairs, 1111 based on Foata normal form. 240/5331 useless extension candidates. Maximal degree in co-relation 10464. Up to 2761 conditions per place. [2023-08-30 16:45:52,062 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 32 selfloop transitions, 2 changer transitions 21/58 dead transitions. [2023-08-30 16:45:52,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 244 flow [2023-08-30 16:45:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:45:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:45:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-30 16:45:52,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186440677966102 [2023-08-30 16:45:52,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-30 16:45:52,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-30 16:45:52,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:52,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-30 16:45:52,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,075 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,075 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 612 transitions. [2023-08-30 16:45:52,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 244 flow [2023-08-30 16:45:52,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:45:52,078 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 74 flow [2023-08-30 16:45:52,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-30 16:45:52,079 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-30 16:45:52,079 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 74 flow [2023-08-30 16:45:52,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:52,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:52,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:45:52,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:52,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash 172889075, now seen corresponding path program 1 times [2023-08-30 16:45:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088869906] [2023-08-30 16:45:52,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088869906] [2023-08-30 16:45:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088869906] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:45:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719107435] [2023-08-30 16:45:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:52,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:45:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:45:52,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:45:52,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 236 [2023-08-30 16:45:52,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:52,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 236 [2023-08-30 16:45:52,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:52,751 INFO L130 PetriNetUnfolder]: 2253/3299 cut-off events. [2023-08-30 16:45:52,751 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-30 16:45:52,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 3299 events. 2253/3299 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16538 event pairs, 452 based on Foata normal form. 192/3461 useless extension candidates. Maximal degree in co-relation 7037. Up to 2372 conditions per place. [2023-08-30 16:45:52,767 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 35 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-30 16:45:52,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 286 flow [2023-08-30 16:45:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:45:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:45:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 620 transitions. [2023-08-30 16:45:52,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2023-08-30 16:45:52,770 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 620 transitions. [2023-08-30 16:45:52,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 620 transitions. [2023-08-30 16:45:52,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:52,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 620 transitions. [2023-08-30 16:45:52,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,775 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 74 flow. Second operand 5 states and 620 transitions. [2023-08-30 16:45:52,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 286 flow [2023-08-30 16:45:52,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 278 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:45:52,781 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow [2023-08-30 16:45:52,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 16:45:52,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-30 16:45:52,782 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 111 flow [2023-08-30 16:45:52,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:52,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:52,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:45:52,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:52,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 101892049, now seen corresponding path program 1 times [2023-08-30 16:45:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483777555] [2023-08-30 16:45:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:52,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483777555] [2023-08-30 16:45:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483777555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:52,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:45:52,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433420653] [2023-08-30 16:45:52,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:52,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:45:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:52,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:45:52,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:45:52,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 236 [2023-08-30 16:45:52,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:52,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:52,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 236 [2023-08-30 16:45:52,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:53,301 INFO L130 PetriNetUnfolder]: 1272/1982 cut-off events. [2023-08-30 16:45:53,302 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2023-08-30 16:45:53,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5521 conditions, 1982 events. 1272/1982 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9714 event pairs, 216 based on Foata normal form. 138/2104 useless extension candidates. Maximal degree in co-relation 5507. Up to 844 conditions per place. [2023-08-30 16:45:53,313 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 46 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-30 16:45:53,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 429 flow [2023-08-30 16:45:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:45:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:45:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-30 16:45:53,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268361581920904 [2023-08-30 16:45:53,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-30 16:45:53,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-30 16:45:53,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:53,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-30 16:45:53,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:53,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:53,321 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:53,321 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 111 flow. Second operand 6 states and 746 transitions. [2023-08-30 16:45:53,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 429 flow [2023-08-30 16:45:53,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:45:53,328 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow [2023-08-30 16:45:53,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 16:45:53,329 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-30 16:45:53,330 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 176 flow [2023-08-30 16:45:53,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:53,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:53,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:53,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:45:53,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:53,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1428647012, now seen corresponding path program 1 times [2023-08-30 16:45:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:53,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884151401] [2023-08-30 16:45:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:53,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884151401] [2023-08-30 16:45:53,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884151401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:53,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:53,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:45:53,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544192079] [2023-08-30 16:45:53,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:53,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:45:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:53,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:45:53,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:45:53,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-30 16:45:53,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:53,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:53,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-30 16:45:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:54,012 INFO L130 PetriNetUnfolder]: 1779/2778 cut-off events. [2023-08-30 16:45:54,012 INFO L131 PetriNetUnfolder]: For 4196/4196 co-relation queries the response was YES. [2023-08-30 16:45:54,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 2778 events. 1779/2778 cut-off events. For 4196/4196 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14562 event pairs, 265 based on Foata normal form. 32/2786 useless extension candidates. Maximal degree in co-relation 9225. Up to 1532 conditions per place. [2023-08-30 16:45:54,031 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 62 selfloop transitions, 2 changer transitions 24/91 dead transitions. [2023-08-30 16:45:54,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 91 transitions, 668 flow [2023-08-30 16:45:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:45:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:45:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-30 16:45:54,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186440677966102 [2023-08-30 16:45:54,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-30 16:45:54,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-30 16:45:54,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:54,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-30 16:45:54,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,039 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,039 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 176 flow. Second operand 5 states and 612 transitions. [2023-08-30 16:45:54,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 91 transitions, 668 flow [2023-08-30 16:45:54,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 91 transitions, 558 flow, removed 43 selfloop flow, removed 4 redundant places. [2023-08-30 16:45:54,057 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 153 flow [2023-08-30 16:45:54,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-08-30 16:45:54,058 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-30 16:45:54,059 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 153 flow [2023-08-30 16:45:54,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:54,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:54,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:45:54,060 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:54,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1516710080, now seen corresponding path program 2 times [2023-08-30 16:45:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112945309] [2023-08-30 16:45:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112945309] [2023-08-30 16:45:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112945309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:54,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:45:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885840431] [2023-08-30 16:45:54,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:54,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:45:54,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:45:54,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:45:54,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 236 [2023-08-30 16:45:54,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:54,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 236 [2023-08-30 16:45:54,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:54,690 INFO L130 PetriNetUnfolder]: 1115/1816 cut-off events. [2023-08-30 16:45:54,690 INFO L131 PetriNetUnfolder]: For 1333/1333 co-relation queries the response was YES. [2023-08-30 16:45:54,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5309 conditions, 1816 events. 1115/1816 cut-off events. For 1333/1333 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9208 event pairs, 219 based on Foata normal form. 96/1858 useless extension candidates. Maximal degree in co-relation 5292. Up to 584 conditions per place. [2023-08-30 16:45:54,708 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 55 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-08-30 16:45:54,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 558 flow [2023-08-30 16:45:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:45:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:45:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 870 transitions. [2023-08-30 16:45:54,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266343825665859 [2023-08-30 16:45:54,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 870 transitions. [2023-08-30 16:45:54,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 870 transitions. [2023-08-30 16:45:54,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:54,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 870 transitions. [2023-08-30 16:45:54,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.28571428571429) internal successors, (870), 7 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,718 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 153 flow. Second operand 7 states and 870 transitions. [2023-08-30 16:45:54,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 558 flow [2023-08-30 16:45:54,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 550 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:45:54,724 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 238 flow [2023-08-30 16:45:54,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-30 16:45:54,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-30 16:45:54,727 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 238 flow [2023-08-30 16:45:54,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:54,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:54,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:54,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:45:54,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:54,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1208311678, now seen corresponding path program 1 times [2023-08-30 16:45:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003845410] [2023-08-30 16:45:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:55,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003845410] [2023-08-30 16:45:55,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003845410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:55,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:55,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:45:55,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17362489] [2023-08-30 16:45:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:55,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:45:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:55,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:45:55,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:45:55,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-30 16:45:55,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:55,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:55,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-30 16:45:55,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:55,561 INFO L130 PetriNetUnfolder]: 2519/3880 cut-off events. [2023-08-30 16:45:55,562 INFO L131 PetriNetUnfolder]: For 6197/6197 co-relation queries the response was YES. [2023-08-30 16:45:55,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12738 conditions, 3880 events. 2519/3880 cut-off events. For 6197/6197 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19148 event pairs, 567 based on Foata normal form. 18/3898 useless extension candidates. Maximal degree in co-relation 12718. Up to 2641 conditions per place. [2023-08-30 16:45:55,587 INFO L137 encePairwiseOnDemand]: 227/236 looper letters, 99 selfloop transitions, 11 changer transitions 20/130 dead transitions. [2023-08-30 16:45:55,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 130 transitions, 997 flow [2023-08-30 16:45:55,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:45:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:45:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2023-08-30 16:45:55,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927360774818402 [2023-08-30 16:45:55,590 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2023-08-30 16:45:55,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2023-08-30 16:45:55,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:55,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2023-08-30 16:45:55,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:55,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:55,595 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:55,595 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 238 flow. Second operand 7 states and 814 transitions. [2023-08-30 16:45:55,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 130 transitions, 997 flow [2023-08-30 16:45:55,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 130 transitions, 843 flow, removed 54 selfloop flow, removed 5 redundant places. [2023-08-30 16:45:55,635 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 275 flow [2023-08-30 16:45:55,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-30 16:45:55,636 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-08-30 16:45:55,637 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 275 flow [2023-08-30 16:45:55,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:55,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:55,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:45:55,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:55,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1753835686, now seen corresponding path program 2 times [2023-08-30 16:45:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458488491] [2023-08-30 16:45:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:55,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458488491] [2023-08-30 16:45:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458488491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:45:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553223535] [2023-08-30 16:45:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:55,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:45:55,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:45:55,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:45:55,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-30 16:45:55,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:55,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:55,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-30 16:45:55,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:56,565 INFO L130 PetriNetUnfolder]: 2885/4512 cut-off events. [2023-08-30 16:45:56,565 INFO L131 PetriNetUnfolder]: For 8108/8108 co-relation queries the response was YES. [2023-08-30 16:45:56,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16333 conditions, 4512 events. 2885/4512 cut-off events. For 8108/8108 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23526 event pairs, 611 based on Foata normal form. 14/4526 useless extension candidates. Maximal degree in co-relation 16310. Up to 2366 conditions per place. [2023-08-30 16:45:56,595 INFO L137 encePairwiseOnDemand]: 227/236 looper letters, 83 selfloop transitions, 10 changer transitions 41/134 dead transitions. [2023-08-30 16:45:56,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 134 transitions, 984 flow [2023-08-30 16:45:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:45:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:45:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2023-08-30 16:45:56,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927360774818402 [2023-08-30 16:45:56,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2023-08-30 16:45:56,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2023-08-30 16:45:56,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:56,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2023-08-30 16:45:56,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:56,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:56,604 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:56,604 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 275 flow. Second operand 7 states and 814 transitions. [2023-08-30 16:45:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 134 transitions, 984 flow [2023-08-30 16:45:56,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 134 transitions, 978 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 16:45:56,657 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 292 flow [2023-08-30 16:45:56,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-30 16:45:56,660 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-08-30 16:45:56,660 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 292 flow [2023-08-30 16:45:56,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:56,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:56,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:45:56,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:45:56,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:56,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1143594532, now seen corresponding path program 3 times [2023-08-30 16:45:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925262091] [2023-08-30 16:45:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925262091] [2023-08-30 16:45:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925262091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:45:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604395433] [2023-08-30 16:45:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:56,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:45:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:56,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:45:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:45:56,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 236 [2023-08-30 16:45:57,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:57,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:57,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 236 [2023-08-30 16:45:57,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:57,399 INFO L130 PetriNetUnfolder]: 1669/2745 cut-off events. [2023-08-30 16:45:57,401 INFO L131 PetriNetUnfolder]: For 4537/4665 co-relation queries the response was YES. [2023-08-30 16:45:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9388 conditions, 2745 events. 1669/2745 cut-off events. For 4537/4665 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15553 event pairs, 295 based on Foata normal form. 93/2719 useless extension candidates. Maximal degree in co-relation 9367. Up to 1032 conditions per place. [2023-08-30 16:45:57,415 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 39 selfloop transitions, 18 changer transitions 30/93 dead transitions. [2023-08-30 16:45:57,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 648 flow [2023-08-30 16:45:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:45:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:45:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 970 transitions. [2023-08-30 16:45:57,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513771186440678 [2023-08-30 16:45:57,419 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 970 transitions. [2023-08-30 16:45:57,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 970 transitions. [2023-08-30 16:45:57,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:57,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 970 transitions. [2023-08-30 16:45:57,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:57,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:57,425 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:57,425 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 292 flow. Second operand 8 states and 970 transitions. [2023-08-30 16:45:57,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 648 flow [2023-08-30 16:45:57,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 591 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-08-30 16:45:57,472 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 264 flow [2023-08-30 16:45:57,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=264, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-08-30 16:45:57,473 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-30 16:45:57,473 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 264 flow [2023-08-30 16:45:57,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:57,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:57,474 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-08-30 16:45:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:45:57,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:57,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash 149175588, now seen corresponding path program 1 times [2023-08-30 16:45:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417246729] [2023-08-30 16:45:57,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:58,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417246729] [2023-08-30 16:45:58,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417246729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:58,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:58,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:45:58,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347900622] [2023-08-30 16:45:58,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:58,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:45:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:58,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:45:58,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:45:58,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 236 [2023-08-30 16:45:58,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:58,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:58,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 236 [2023-08-30 16:45:58,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:58,544 INFO L130 PetriNetUnfolder]: 1091/1879 cut-off events. [2023-08-30 16:45:58,544 INFO L131 PetriNetUnfolder]: For 4456/4480 co-relation queries the response was YES. [2023-08-30 16:45:58,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7253 conditions, 1879 events. 1091/1879 cut-off events. For 4456/4480 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10141 event pairs, 132 based on Foata normal form. 2/1816 useless extension candidates. Maximal degree in co-relation 7227. Up to 597 conditions per place. [2023-08-30 16:45:58,555 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 71 selfloop transitions, 6 changer transitions 48/131 dead transitions. [2023-08-30 16:45:58,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 1175 flow [2023-08-30 16:45:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:45:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:45:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 924 transitions. [2023-08-30 16:45:58,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894067796610169 [2023-08-30 16:45:58,558 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 924 transitions. [2023-08-30 16:45:58,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 924 transitions. [2023-08-30 16:45:58,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:58,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 924 transitions. [2023-08-30 16:45:58,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.5) internal successors, (924), 8 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:58,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:58,564 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:58,564 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 264 flow. Second operand 8 states and 924 transitions. [2023-08-30 16:45:58,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 1175 flow [2023-08-30 16:45:58,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 131 transitions, 904 flow, removed 79 selfloop flow, removed 8 redundant places. [2023-08-30 16:45:58,589 INFO L231 Difference]: Finished difference. Result has 66 places, 46 transitions, 238 flow [2023-08-30 16:45:58,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=66, PETRI_TRANSITIONS=46} [2023-08-30 16:45:58,590 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-30 16:45:58,590 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 238 flow [2023-08-30 16:45:58,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:58,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:58,591 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-08-30 16:45:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:45:58,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:58,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1638797586, now seen corresponding path program 2 times [2023-08-30 16:45:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552641159] [2023-08-30 16:45:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:58,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:58,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552641159] [2023-08-30 16:45:58,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552641159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:58,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:45:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549121189] [2023-08-30 16:45:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:58,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:45:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:45:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:45:58,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-30 16:45:58,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:58,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:45:58,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-30 16:45:58,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:45:59,133 INFO L130 PetriNetUnfolder]: 1242/2147 cut-off events. [2023-08-30 16:45:59,133 INFO L131 PetriNetUnfolder]: For 3802/3802 co-relation queries the response was YES. [2023-08-30 16:45:59,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 2147 events. 1242/2147 cut-off events. For 3802/3802 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12001 event pairs, 415 based on Foata normal form. 1/2097 useless extension candidates. Maximal degree in co-relation 7830. Up to 850 conditions per place. [2023-08-30 16:45:59,142 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 39 selfloop transitions, 1 changer transitions 46/89 dead transitions. [2023-08-30 16:45:59,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 654 flow [2023-08-30 16:45:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:45:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:45:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-08-30 16:45:59,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016949152542373 [2023-08-30 16:45:59,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-08-30 16:45:59,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-08-30 16:45:59,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:45:59,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-08-30 16:45:59,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:59,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:59,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:59,149 INFO L175 Difference]: Start difference. First operand has 66 places, 46 transitions, 238 flow. Second operand 5 states and 592 transitions. [2023-08-30 16:45:59,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 654 flow [2023-08-30 16:45:59,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 643 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-30 16:45:59,171 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 212 flow [2023-08-30 16:45:59,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2023-08-30 16:45:59,172 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-30 16:45:59,172 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 212 flow [2023-08-30 16:45:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:45:59,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:45:59,172 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-08-30 16:45:59,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:45:59,173 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:45:59,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:45:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1866302834, now seen corresponding path program 3 times [2023-08-30 16:45:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:45:59,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190656300] [2023-08-30 16:45:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:45:59,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:45:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:45:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:45:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:45:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190656300] [2023-08-30 16:45:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190656300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:45:59,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:45:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:45:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545857257] [2023-08-30 16:45:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:45:59,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:45:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:45:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:45:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:46:00,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-08-30 16:46:00,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 212 flow. Second operand has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:00,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:46:00,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-08-30 16:46:00,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:46:00,421 INFO L130 PetriNetUnfolder]: 568/968 cut-off events. [2023-08-30 16:46:00,422 INFO L131 PetriNetUnfolder]: For 1700/1721 co-relation queries the response was YES. [2023-08-30 16:46:00,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 968 events. 568/968 cut-off events. For 1700/1721 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4293 event pairs, 92 based on Foata normal form. 10/952 useless extension candidates. Maximal degree in co-relation 3516. Up to 603 conditions per place. [2023-08-30 16:46:00,426 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 43 selfloop transitions, 5 changer transitions 28/80 dead transitions. [2023-08-30 16:46:00,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 574 flow [2023-08-30 16:46:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:46:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:46:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 910 transitions. [2023-08-30 16:46:00,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819915254237288 [2023-08-30 16:46:00,431 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 910 transitions. [2023-08-30 16:46:00,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 910 transitions. [2023-08-30 16:46:00,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:46:00,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 910 transitions. [2023-08-30 16:46:00,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.75) internal successors, (910), 8 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:00,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:00,437 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:00,438 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 212 flow. Second operand 8 states and 910 transitions. [2023-08-30 16:46:00,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 574 flow [2023-08-30 16:46:00,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 551 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-30 16:46:00,449 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 216 flow [2023-08-30 16:46:00,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2023-08-30 16:46:00,450 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-30 16:46:00,450 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 216 flow [2023-08-30 16:46:00,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.875) internal successors, (887), 8 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:46:00,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:46:00,451 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-08-30 16:46:00,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:46:00,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:46:00,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:46:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -342472698, now seen corresponding path program 4 times [2023-08-30 16:46:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:46:00,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467865216] [2023-08-30 16:46:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:46:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:46:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:46:00,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:46:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:46:00,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:46:00,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:46:00,607 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:46:00,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:46:00,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:46:00,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:46:00,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:46:00,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:46:00,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:46:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:46:00,610 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2023-08-30 16:46:00,614 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:46:00,615 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:46:00,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:46:00 BasicIcfg [2023-08-30 16:46:00,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:46:00,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:46:00,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:46:00,689 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:46:00,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:45:45" (3/4) ... [2023-08-30 16:46:00,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:46:00,760 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:46:00,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:46:00,760 INFO L158 Benchmark]: Toolchain (without parser) took 16423.42ms. Allocated memory was 71.3MB in the beginning and 805.3MB in the end (delta: 734.0MB). Free memory was 42.0MB in the beginning and 616.5MB in the end (delta: -574.4MB). Peak memory consumption was 158.9MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,761 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:46:00,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.74ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 36.2MB in the end (delta: 5.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.52ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 33.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,761 INFO L158 Benchmark]: Boogie Preprocessor took 27.70ms. Allocated memory is still 71.3MB. Free memory was 33.5MB in the beginning and 31.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,762 INFO L158 Benchmark]: RCFGBuilder took 679.31ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 39.4MB in the end (delta: -8.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,762 INFO L158 Benchmark]: TraceAbstraction took 14996.39ms. Allocated memory was 71.3MB in the beginning and 805.3MB in the end (delta: 734.0MB). Free memory was 38.7MB in the beginning and 632.2MB in the end (delta: -593.5MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,762 INFO L158 Benchmark]: Witness Printer took 71.11ms. Allocated memory is still 805.3MB. Free memory was 631.1MB in the beginning and 616.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:46:00,764 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.20ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.74ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 36.2MB in the end (delta: 5.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.52ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 33.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.70ms. Allocated memory is still 71.3MB. Free memory was 33.5MB in the beginning and 31.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 679.31ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 39.4MB in the end (delta: -8.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14996.39ms. Allocated memory was 71.3MB in the beginning and 805.3MB in the end (delta: 734.0MB). Free memory was 38.7MB in the beginning and 632.2MB in the end (delta: -593.5MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. * Witness Printer took 71.11ms. Allocated memory is still 805.3MB. Free memory was 631.1MB in the beginning and 616.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 30 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 7686 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3764, independent: 3549, independent conditional: 0, independent unconditional: 3549, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1544, independent: 1511, independent conditional: 0, independent unconditional: 1511, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3764, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1544, unknown conditional: 0, unknown unconditional: 1544] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] 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_p1_EAX=0, __unbuffered_p2_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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 865]: 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 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: 14.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 742 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2044 IncrementalHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 41 mSDtfsCounter, 2044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=8, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:46:00,782 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