./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.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/safe031_power.opt_pso.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 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad --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:59:01,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:59:01,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:59:01,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:59:01,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:59:01,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:59:01,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:59:01,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:59:01,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:59:01,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:59:01,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:59:01,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:59:01,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:59:01,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:59:01,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:59:01,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:59:01,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:59:01,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:59:01,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:59:01,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:59:01,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:59:01,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:59:01,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:59:01,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:59:01,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:59:01,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:59:01,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:59:01,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:59:01,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:59:01,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:59:01,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:59:01,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:59:01,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:59:01,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:59:01,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:59:01,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:59:01,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:59:01,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:59:01,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:59:01,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:59:01,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:59:01,638 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:59:01,666 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:59:01,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:59:01,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:59:01,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:59:01,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:59:01,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:59:01,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:59:01,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:59:01,670 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:59:01,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:59:01,671 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:59:01,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:59:01,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:59:01,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:59:01,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:59:01,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:59:01,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:59:01,673 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:59:01,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:59:01,673 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:59:01,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:59:01,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:59:01,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:59:01,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:59:01,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:59:01,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:59:01,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:59:01,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:59:01,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:59:01,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:59:01,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:59:01,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:59:01,675 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:59:01,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:59:01,676 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:59:01,676 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 -> 740668a6bdee7f1177df0d0d81e76f2a2521fb58ce5f63a4942f3d36e11f9dad 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:59:02,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:59:02,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:59:02,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:59:02,036 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:59:02,036 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:59:02,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-08-30 16:59:03,236 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:59:03,510 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:59:03,510 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2023-08-30 16:59:03,523 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ebf7f74/e8d8665caa1b4b55a782ae1ca862be22/FLAG5761b71ed [2023-08-30 16:59:03,539 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ebf7f74/e8d8665caa1b4b55a782ae1ca862be22 [2023-08-30 16:59:03,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:59:03,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:59:03,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:59:03,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:59:03,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:59:03,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:59:03" (1/1) ... [2023-08-30 16:59:03,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de86c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:03, skipping insertion in model container [2023-08-30 16:59:03,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:59:03" (1/1) ... [2023-08-30 16:59:03,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:59:03,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:59:03,708 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 16:59:03,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:59:03,905 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:59:03,917 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2023-08-30 16:59:03,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:59:04,008 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:59:04,009 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:59:04,015 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:59:04,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04 WrapperNode [2023-08-30 16:59:04,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:59:04,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:59:04,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:59:04,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:59:04,023 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:59:04" (1/1) ... [2023-08-30 16:59:04,052 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:59:04" (1/1) ... [2023-08-30 16:59:04,088 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-30 16:59:04,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:59:04,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:59:04,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:59:04,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:59:04,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,139 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:59:04,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:59:04,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:59:04,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:59:04,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (1/1) ... [2023-08-30 16:59:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:59:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:59:04,182 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:59:04,212 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:59:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:59:04,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:59:04,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:59:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:59:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:59:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:59:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:59:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:59:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:59:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:59:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:59:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:59:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:59:04,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:59:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:59:04,230 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:59:04,406 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:59:04,408 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:59:04,756 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:59:04,852 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:59:04,852 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:59:04,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:59:04 BoogieIcfgContainer [2023-08-30 16:59:04,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:59:04,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:59:04,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:59:04,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:59:04,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:59:03" (1/3) ... [2023-08-30 16:59:04,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a10687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:59:04, skipping insertion in model container [2023-08-30 16:59:04,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:59:04" (2/3) ... [2023-08-30 16:59:04,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a10687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:59:04, skipping insertion in model container [2023-08-30 16:59:04,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:59:04" (3/3) ... [2023-08-30 16:59:04,861 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2023-08-30 16:59:04,868 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:59:04,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:59:04,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:59:04,876 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:59:04,942 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:59:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2023-08-30 16:59:05,025 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-08-30 16:59:05,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:59:05,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 16:59:05,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2023-08-30 16:59:05,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2023-08-30 16:59:05,044 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:59:05,051 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-30 16:59:05,054 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2023-08-30 16:59:05,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2023-08-30 16:59:05,077 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2023-08-30 16:59:05,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:59:05,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-30 16:59:05,079 INFO L119 LiptonReduction]: Number of co-enabled transitions 1776 [2023-08-30 16:59:09,009 INFO L134 LiptonReduction]: Checked pairs total: 4380 [2023-08-30 16:59:09,009 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-30 16:59:09,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:59:09,027 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;@2ceaff46, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:59:09,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:59:09,032 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-08-30 16:59:09,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:59:09,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:09,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:09,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:09,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1908164489, now seen corresponding path program 1 times [2023-08-30 16:59:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:09,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528775414] [2023-08-30 16:59:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:09,480 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:59:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528775414] [2023-08-30 16:59:09,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528775414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:09,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:09,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:59:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652362307] [2023-08-30 16:59:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:09,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:59:09,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:09,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:59:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:59:09,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 200 [2023-08-30 16:59:09,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:59:09,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:09,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 200 [2023-08-30 16:59:09,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:09,780 INFO L130 PetriNetUnfolder]: 511/847 cut-off events. [2023-08-30 16:59:09,780 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 16:59:09,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 847 events. 511/847 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4011 event pairs, 112 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1655. Up to 580 conditions per place. [2023-08-30 16:59:09,791 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 23 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2023-08-30 16:59:09,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 123 flow [2023-08-30 16:59:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:59:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:59:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-30 16:59:09,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116666666666667 [2023-08-30 16:59:09,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-30 16:59:09,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-30 16:59:09,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:09,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-30 16:59:09,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:59:09,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:09,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:09,818 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 307 transitions. [2023-08-30 16:59:09,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 123 flow [2023-08-30 16:59:09,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:59:09,823 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-30 16:59:09,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-30 16:59:09,827 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-30 16:59:09,827 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-30 16:59:09,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:59:09,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:09,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:09,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:59:09,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:09,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash -204910542, now seen corresponding path program 1 times [2023-08-30 16:59:09,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:09,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092976223] [2023-08-30 16:59:09,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:09,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:10,976 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:59:10,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:10,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092976223] [2023-08-30 16:59:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092976223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:59:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343533056] [2023-08-30 16:59:10,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:10,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:59:10,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:59:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:59:11,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 16:59:11,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:59:11,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:11,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 16:59:11,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:11,265 INFO L130 PetriNetUnfolder]: 798/1208 cut-off events. [2023-08-30 16:59:11,265 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-30 16:59:11,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 1208 events. 798/1208 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5229 event pairs, 161 based on Foata normal form. 24/1231 useless extension candidates. Maximal degree in co-relation 2511. Up to 1022 conditions per place. [2023-08-30 16:59:11,271 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 31 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2023-08-30 16:59:11,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 178 flow [2023-08-30 16:59:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:59:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:59:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 382 transitions. [2023-08-30 16:59:11,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775 [2023-08-30 16:59:11,275 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 382 transitions. [2023-08-30 16:59:11,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 382 transitions. [2023-08-30 16:59:11,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:11,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 382 transitions. [2023-08-30 16:59:11,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:59:11,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:59:11,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:59:11,279 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 382 transitions. [2023-08-30 16:59:11,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 178 flow [2023-08-30 16:59:11,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:59:11,281 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 102 flow [2023-08-30 16:59:11,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2023-08-30 16:59:11,282 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-30 16:59:11,282 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 102 flow [2023-08-30 16:59:11,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:59:11,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:11,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:59:11,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:11,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2057260820, now seen corresponding path program 1 times [2023-08-30 16:59:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:11,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785417376] [2023-08-30 16:59:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:11,777 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:59:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785417376] [2023-08-30 16:59:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785417376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:59:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441393562] [2023-08-30 16:59:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:11,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:59:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:11,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:59:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:59:11,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-30 16:59:11,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 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:59:11,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:11,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-30 16:59:11,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:11,981 INFO L130 PetriNetUnfolder]: 667/1049 cut-off events. [2023-08-30 16:59:11,982 INFO L131 PetriNetUnfolder]: For 438/438 co-relation queries the response was YES. [2023-08-30 16:59:11,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 1049 events. 667/1049 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4787 event pairs, 164 based on Foata normal form. 12/1012 useless extension candidates. Maximal degree in co-relation 2837. Up to 750 conditions per place. [2023-08-30 16:59:11,990 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 27 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-30 16:59:11,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 181 flow [2023-08-30 16:59:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:59:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:59:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-30 16:59:11,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116666666666667 [2023-08-30 16:59:11,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-30 16:59:11,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-30 16:59:11,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:11,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-30 16:59:11,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:59:11,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:11,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:11,996 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 102 flow. Second operand 3 states and 307 transitions. [2023-08-30 16:59:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 181 flow [2023-08-30 16:59:11,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:59:11,999 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 110 flow [2023-08-30 16:59:11,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-30 16:59:12,000 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-30 16:59:12,000 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 110 flow [2023-08-30 16:59:12,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 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:59:12,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:12,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:12,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:59:12,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:12,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1007986038, now seen corresponding path program 1 times [2023-08-30 16:59:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194922718] [2023-08-30 16:59:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:12,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:12,800 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:59:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194922718] [2023-08-30 16:59:12,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194922718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:59:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271920595] [2023-08-30 16:59:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:12,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:59:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:59:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:59:12,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 16:59:12,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:59:12,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:12,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 16:59:12,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:13,014 INFO L130 PetriNetUnfolder]: 721/1102 cut-off events. [2023-08-30 16:59:13,015 INFO L131 PetriNetUnfolder]: For 526/526 co-relation queries the response was YES. [2023-08-30 16:59:13,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1102 events. 721/1102 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4401 event pairs, 217 based on Foata normal form. 14/1112 useless extension candidates. Maximal degree in co-relation 3148. Up to 825 conditions per place. [2023-08-30 16:59:13,022 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 39 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2023-08-30 16:59:13,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 45 transitions, 271 flow [2023-08-30 16:59:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:59:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:59:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-08-30 16:59:13,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47833333333333333 [2023-08-30 16:59:13,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-08-30 16:59:13,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-08-30 16:59:13,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:13,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-08-30 16:59:13,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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:59:13,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:13,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:13,028 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 110 flow. Second operand 3 states and 287 transitions. [2023-08-30 16:59:13,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 45 transitions, 271 flow [2023-08-30 16:59:13,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:59:13,031 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 142 flow [2023-08-30 16:59:13,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-08-30 16:59:13,032 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-08-30 16:59:13,032 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 142 flow [2023-08-30 16:59:13,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:59:13,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:13,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:13,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:59:13,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:13,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1389183967, now seen corresponding path program 1 times [2023-08-30 16:59:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:13,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157441016] [2023-08-30 16:59:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:13,763 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:59:13,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157441016] [2023-08-30 16:59:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157441016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:13,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:13,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:59:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712725262] [2023-08-30 16:59:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:13,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:59:13,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:59:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:59:13,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 16:59:13,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:13,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:13,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 16:59:13,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:14,027 INFO L130 PetriNetUnfolder]: 887/1375 cut-off events. [2023-08-30 16:59:14,027 INFO L131 PetriNetUnfolder]: For 891/891 co-relation queries the response was YES. [2023-08-30 16:59:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 1375 events. 887/1375 cut-off events. For 891/891 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6156 event pairs, 233 based on Foata normal form. 40/1414 useless extension candidates. Maximal degree in co-relation 4140. Up to 782 conditions per place. [2023-08-30 16:59:14,036 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 41 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2023-08-30 16:59:14,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 321 flow [2023-08-30 16:59:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:59:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:59:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-30 16:59:14,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-08-30 16:59:14,039 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-30 16:59:14,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-30 16:59:14,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:14,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-30 16:59:14,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:59:14,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:59:14,042 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:59:14,043 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 142 flow. Second operand 4 states and 380 transitions. [2023-08-30 16:59:14,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 321 flow [2023-08-30 16:59:14,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:59:14,046 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 192 flow [2023-08-30 16:59:14,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-30 16:59:14,047 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-30 16:59:14,047 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 192 flow [2023-08-30 16:59:14,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:59:14,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:14,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:14,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:59:14,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:14,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:14,049 INFO L85 PathProgramCache]: Analyzing trace with hash -198083121, now seen corresponding path program 1 times [2023-08-30 16:59:14,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537527289] [2023-08-30 16:59:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:14,289 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:59:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537527289] [2023-08-30 16:59:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537527289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:14,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:14,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:59:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057915018] [2023-08-30 16:59:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:14,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:59:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:59:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:59:14,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 200 [2023-08-30 16:59:14,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:59:14,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:14,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 200 [2023-08-30 16:59:14,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:14,482 INFO L130 PetriNetUnfolder]: 594/1019 cut-off events. [2023-08-30 16:59:14,483 INFO L131 PetriNetUnfolder]: For 1602/1642 co-relation queries the response was YES. [2023-08-30 16:59:14,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3295 conditions, 1019 events. 594/1019 cut-off events. For 1602/1642 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5357 event pairs, 134 based on Foata normal form. 146/1127 useless extension candidates. Maximal degree in co-relation 3276. Up to 603 conditions per place. [2023-08-30 16:59:14,489 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 49 selfloop transitions, 7 changer transitions 25/86 dead transitions. [2023-08-30 16:59:14,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 86 transitions, 630 flow [2023-08-30 16:59:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:59:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:59:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-08-30 16:59:14,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.493 [2023-08-30 16:59:14,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-08-30 16:59:14,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-08-30 16:59:14,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:14,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-08-30 16:59:14,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:59:14,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:59:14,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 0 states have call successors, (0), 0 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:59:14,498 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 192 flow. Second operand 5 states and 493 transitions. [2023-08-30 16:59:14,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 86 transitions, 630 flow [2023-08-30 16:59:14,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 86 transitions, 609 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:59:14,504 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 231 flow [2023-08-30 16:59:14,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-30 16:59:14,507 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-08-30 16:59:14,507 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 231 flow [2023-08-30 16:59:14,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:59:14,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:14,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:14,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:59:14,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:14,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1343625227, now seen corresponding path program 1 times [2023-08-30 16:59:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569500769] [2023-08-30 16:59:14,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:14,768 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:59:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569500769] [2023-08-30 16:59:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569500769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:14,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:59:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502201747] [2023-08-30 16:59:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:59:14,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:59:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:59:14,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 200 [2023-08-30 16:59:14,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 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:59:14,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:14,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 200 [2023-08-30 16:59:14,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:14,986 INFO L130 PetriNetUnfolder]: 420/770 cut-off events. [2023-08-30 16:59:14,986 INFO L131 PetriNetUnfolder]: For 1841/1901 co-relation queries the response was YES. [2023-08-30 16:59:14,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 770 events. 420/770 cut-off events. For 1841/1901 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4065 event pairs, 52 based on Foata normal form. 117/861 useless extension candidates. Maximal degree in co-relation 2955. Up to 257 conditions per place. [2023-08-30 16:59:14,991 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 62 selfloop transitions, 14 changer transitions 25/106 dead transitions. [2023-08-30 16:59:14,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 106 transitions, 807 flow [2023-08-30 16:59:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:59:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:59:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-08-30 16:59:14,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49214285714285716 [2023-08-30 16:59:14,994 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-08-30 16:59:14,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-08-30 16:59:14,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:14,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-08-30 16:59:14,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 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:59:14,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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:59:14,998 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 0 states have call successors, (0), 0 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:59:14,998 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 231 flow. Second operand 7 states and 689 transitions. [2023-08-30 16:59:14,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 106 transitions, 807 flow [2023-08-30 16:59:15,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 106 transitions, 797 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:59:15,004 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 308 flow [2023-08-30 16:59:15,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-30 16:59:15,004 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2023-08-30 16:59:15,005 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 308 flow [2023-08-30 16:59:15,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 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:59:15,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:15,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:15,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:59:15,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:15,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 318972699, now seen corresponding path program 1 times [2023-08-30 16:59:15,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:15,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382187645] [2023-08-30 16:59:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:15,280 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:59:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:15,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382187645] [2023-08-30 16:59:15,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382187645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:59:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423150911] [2023-08-30 16:59:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:15,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:59:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:59:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:59:15,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 200 [2023-08-30 16:59:15,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:59:15,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:15,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 200 [2023-08-30 16:59:15,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:15,495 INFO L130 PetriNetUnfolder]: 396/715 cut-off events. [2023-08-30 16:59:15,495 INFO L131 PetriNetUnfolder]: For 2121/2153 co-relation queries the response was YES. [2023-08-30 16:59:15,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 715 events. 396/715 cut-off events. For 2121/2153 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3775 event pairs, 38 based on Foata normal form. 41/724 useless extension candidates. Maximal degree in co-relation 3133. Up to 238 conditions per place. [2023-08-30 16:59:15,500 INFO L137 encePairwiseOnDemand]: 194/200 looper letters, 57 selfloop transitions, 16 changer transitions 30/106 dead transitions. [2023-08-30 16:59:15,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 856 flow [2023-08-30 16:59:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:59:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:59:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 868 transitions. [2023-08-30 16:59:15,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822222222222222 [2023-08-30 16:59:15,504 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 868 transitions. [2023-08-30 16:59:15,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 868 transitions. [2023-08-30 16:59:15,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:15,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 868 transitions. [2023-08-30 16:59:15,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.44444444444444) internal successors, (868), 9 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:59:15,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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:59:15,509 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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:59:15,510 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 308 flow. Second operand 9 states and 868 transitions. [2023-08-30 16:59:15,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 856 flow [2023-08-30 16:59:15,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 809 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-30 16:59:15,522 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 285 flow [2023-08-30 16:59:15,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=285, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-08-30 16:59:15,523 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2023-08-30 16:59:15,523 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 285 flow [2023-08-30 16:59:15,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:59:15,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:15,524 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:59:15,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:59:15,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:15,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1263318941, now seen corresponding path program 1 times [2023-08-30 16:59:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:15,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776105832] [2023-08-30 16:59:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:15,780 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:59:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776105832] [2023-08-30 16:59:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776105832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:59:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996768706] [2023-08-30 16:59:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:15,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:59:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:59:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:59:15,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 200 [2023-08-30 16:59:15,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:59:15,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:15,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 200 [2023-08-30 16:59:15,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:15,888 INFO L130 PetriNetUnfolder]: 196/401 cut-off events. [2023-08-30 16:59:15,889 INFO L131 PetriNetUnfolder]: For 1167/1169 co-relation queries the response was YES. [2023-08-30 16:59:15,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 401 events. 196/401 cut-off events. For 1167/1169 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1857 event pairs, 28 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1724. Up to 234 conditions per place. [2023-08-30 16:59:15,892 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 32 selfloop transitions, 1 changer transitions 42/77 dead transitions. [2023-08-30 16:59:15,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 732 flow [2023-08-30 16:59:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:59:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:59:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2023-08-30 16:59:15,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2023-08-30 16:59:15,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 395 transitions. [2023-08-30 16:59:15,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 395 transitions. [2023-08-30 16:59:15,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:15,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 395 transitions. [2023-08-30 16:59:15,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 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:59:15,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:59:15,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 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:59:15,897 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 285 flow. Second operand 4 states and 395 transitions. [2023-08-30 16:59:15,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 732 flow [2023-08-30 16:59:15,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 603 flow, removed 25 selfloop flow, removed 11 redundant places. [2023-08-30 16:59:15,905 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 166 flow [2023-08-30 16:59:15,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-30 16:59:15,906 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-08-30 16:59:15,906 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 166 flow [2023-08-30 16:59:15,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:59:15,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:15,906 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:59:15,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:59:15,907 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:15,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash 415372011, now seen corresponding path program 2 times [2023-08-30 16:59:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:15,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533780565] [2023-08-30 16:59:15,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:59:17,504 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:59:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:59:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533780565] [2023-08-30 16:59:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533780565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:59:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:59:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:59:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825437929] [2023-08-30 16:59:17,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:59:17,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:59:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:59:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:59:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:59:17,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 200 [2023-08-30 16:59:17,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 166 flow. Second operand has 8 states, 8 states have (on average 84.5) internal successors, (676), 8 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:59:17,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:59:17,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 200 [2023-08-30 16:59:17,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:59:17,913 INFO L130 PetriNetUnfolder]: 90/212 cut-off events. [2023-08-30 16:59:17,913 INFO L131 PetriNetUnfolder]: For 333/333 co-relation queries the response was YES. [2023-08-30 16:59:17,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 212 events. 90/212 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 747 event pairs, 21 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 822. Up to 82 conditions per place. [2023-08-30 16:59:17,914 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 36 selfloop transitions, 6 changer transitions 30/72 dead transitions. [2023-08-30 16:59:17,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 552 flow [2023-08-30 16:59:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:59:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:59:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 792 transitions. [2023-08-30 16:59:17,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-30 16:59:17,918 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 792 transitions. [2023-08-30 16:59:17,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 792 transitions. [2023-08-30 16:59:17,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:59:17,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 792 transitions. [2023-08-30 16:59:17,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 0 states have call successors, (0), 0 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:59:17,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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:59:17,923 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 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:59:17,923 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 166 flow. Second operand 9 states and 792 transitions. [2023-08-30 16:59:17,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 552 flow [2023-08-30 16:59:17,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 492 flow, removed 20 selfloop flow, removed 8 redundant places. [2023-08-30 16:59:17,926 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 152 flow [2023-08-30 16:59:17,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=152, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2023-08-30 16:59:17,927 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-08-30 16:59:17,927 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 152 flow [2023-08-30 16:59:17,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 84.5) internal successors, (676), 8 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:59:17,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:59:17,927 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:59:17,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:59:17,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:59:17,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:59:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash -196144137, now seen corresponding path program 3 times [2023-08-30 16:59:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:59:17,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838955222] [2023-08-30 16:59:17,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:59:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:59:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:59:17,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:59:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:59:18,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:59:18,044 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:59:18,045 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:59:18,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:59:18,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:59:18,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:59:18,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:59:18,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:59:18,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:59:18,048 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:59:18,053 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:59:18,054 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:59:18,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:59:18 BasicIcfg [2023-08-30 16:59:18,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:59:18,114 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:59:18,114 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:59:18,114 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:59:18,115 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:59:04" (3/4) ... [2023-08-30 16:59:18,116 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:59:18,168 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:59:18,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:59:18,169 INFO L158 Benchmark]: Toolchain (without parser) took 14627.04ms. Allocated memory was 73.4MB in the beginning and 293.6MB in the end (delta: 220.2MB). Free memory was 49.1MB in the beginning and 212.6MB in the end (delta: -163.4MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,169 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 73.4MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:59:18,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.24ms. Allocated memory is still 73.4MB. Free memory was 48.9MB in the beginning and 44.9MB in the end (delta: 4.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.77ms. Allocated memory is still 73.4MB. Free memory was 44.9MB in the beginning and 42.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,170 INFO L158 Benchmark]: Boogie Preprocessor took 52.88ms. Allocated memory is still 73.4MB. Free memory was 42.2MB in the beginning and 40.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,170 INFO L158 Benchmark]: RCFGBuilder took 710.80ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.2MB in the beginning and 48.7MB in the end (delta: -8.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,170 INFO L158 Benchmark]: TraceAbstraction took 13257.72ms. Allocated memory was 96.5MB in the beginning and 293.6MB in the end (delta: 197.1MB). Free memory was 48.3MB in the beginning and 222.0MB in the end (delta: -173.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,171 INFO L158 Benchmark]: Witness Printer took 53.99ms. Allocated memory is still 293.6MB. Free memory was 221.0MB in the beginning and 212.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 16:59:18,172 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.21ms. Allocated memory is still 73.4MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.24ms. Allocated memory is still 73.4MB. Free memory was 48.9MB in the beginning and 44.9MB in the end (delta: 4.1MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.77ms. Allocated memory is still 73.4MB. Free memory was 44.9MB in the beginning and 42.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.88ms. Allocated memory is still 73.4MB. Free memory was 42.2MB in the beginning and 40.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 710.80ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 40.2MB in the beginning and 48.7MB in the end (delta: -8.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13257.72ms. Allocated memory was 96.5MB in the beginning and 293.6MB in the end (delta: 197.1MB). Free memory was 48.3MB in the beginning and 222.0MB in the end (delta: -173.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 53.99ms. Allocated memory is still 293.6MB. Free memory was 221.0MB in the beginning and 212.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 111 PlacesBefore, 32 PlacesAfterwards, 103 TransitionsBefore, 22 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 4380 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2228, independent: 2081, independent conditional: 0, independent unconditional: 2081, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 983, independent: 942, independent conditional: 0, independent unconditional: 942, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2228, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 983, unknown conditional: 0, unknown unconditional: 983] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-2, t2516={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=-1, t2516={5:0}, t2517={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=0, t2516={5:0}, t2517={6:0}, t2518={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] 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) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 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 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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$$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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L824] RET 0 assume_abort_if_not(main$tmp_guard0) [L826] 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) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2516={5:0}, t2517={6:0}, t2518={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L848] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 820]: 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: 818]: 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: 816]: 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 7 procedures, 132 locations, 6 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: 13.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 395 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 889 IncrementalHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 54 mSDtfsCounter, 889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:59:18,196 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