./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix039.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/mix039.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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --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:50:29,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:29,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:29,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:29,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:29,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:29,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:29,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:29,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:29,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:29,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:29,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:29,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:29,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:29,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:29,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:29,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:29,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:29,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:29,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:29,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:29,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:29,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:29,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:29,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:29,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:29,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:29,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:29,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:29,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:29,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:29,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:29,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:29,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:29,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:29,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:29,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:29,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:29,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:29,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:29,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:29,622 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:50:29,647 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:29,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:29,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:29,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:29,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:29,649 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:29,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:29,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:29,649 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:29,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:29,650 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:29,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:29,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:29,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:29,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:29,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:29,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:29,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:29,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:29,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:29,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:29,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:29,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:29,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:29,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:29,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:29,653 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:29,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:29,654 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:29,654 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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc 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:50:29,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:30,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:30,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:30,028 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:30,028 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:30,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-08-30 16:50:31,173 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:31,409 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:31,411 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2023-08-30 16:50:31,425 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f84f658/f71c8445bb07480382f46f0e23c6dd90/FLAG0dcf54ae8 [2023-08-30 16:50:31,439 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f84f658/f71c8445bb07480382f46f0e23c6dd90 [2023-08-30 16:50:31,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:31,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:31,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:31,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:31,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:31,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cdaf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31, skipping insertion in model container [2023-08-30 16:50:31,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:31,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:31,606 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/mix039.opt.i[944,957] [2023-08-30 16:50:31,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:31,777 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:31,786 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/mix039.opt.i[944,957] [2023-08-30 16:50:31,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:31,844 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:31,844 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:31,848 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:31,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31 WrapperNode [2023-08-30 16:50:31,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:31,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:31,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:31,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:31,854 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:50:31" (1/1) ... [2023-08-30 16:50:31,863 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:50:31" (1/1) ... [2023-08-30 16:50:31,877 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-30 16:50:31,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:31,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:31,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:31,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:31,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:31,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:31,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:31,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:31,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (1/1) ... [2023-08-30 16:50:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:31,919 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:50:31,921 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:50:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:31,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:50:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:50:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:50:31,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:50:31,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:31,942 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:50:32,031 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:32,032 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:32,315 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:32,419 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:32,419 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:32,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:32 BoogieIcfgContainer [2023-08-30 16:50:32,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:32,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:32,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:32,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:32,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:31" (1/3) ... [2023-08-30 16:50:32,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43336779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:32, skipping insertion in model container [2023-08-30 16:50:32,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:31" (2/3) ... [2023-08-30 16:50:32,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43336779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:32, skipping insertion in model container [2023-08-30 16:50:32,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:32" (3/3) ... [2023-08-30 16:50:32,426 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-08-30 16:50:32,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:32,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:32,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:32,441 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:32,499 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:32,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:50:32,599 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:50:32,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:32,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:50:32,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-08-30 16:50:32,609 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:32,612 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:32,621 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:32,624 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:32,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-08-30 16:50:32,657 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 16:50:32,658 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:32,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 16:50:32,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 2816 [2023-08-30 16:50:35,976 INFO L134 LiptonReduction]: Checked pairs total: 6492 [2023-08-30 16:50:35,976 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-30 16:50:35,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:35,989 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;@5d77313d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:35,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:50:35,996 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 16:50:35,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:35,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:35,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:35,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:36,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash -656996611, now seen corresponding path program 1 times [2023-08-30 16:50:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639604257] [2023-08-30 16:50:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:36,364 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:50:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639604257] [2023-08-30 16:50:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639604257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:36,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:36,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596393693] [2023-08-30 16:50:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:36,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:36,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:36,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-08-30 16:50:36,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:50:36,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:36,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-08-30 16:50:36,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:36,830 INFO L130 PetriNetUnfolder]: 2594/3779 cut-off events. [2023-08-30 16:50:36,830 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-30 16:50:36,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 3779 events. 2594/3779 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19592 event pairs, 518 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 7462. Up to 2797 conditions per place. [2023-08-30 16:50:36,847 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-30 16:50:36,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-08-30 16:50:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 16:50:36,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2023-08-30 16:50:36,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 16:50:36,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 16:50:36,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:36,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 16:50:36,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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:50:36,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:50:36,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:50:36,866 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 388 transitions. [2023-08-30 16:50:36,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-08-30 16:50:36,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:36,871 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-08-30 16:50:36,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-30 16:50:36,874 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-30 16:50:36,875 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-08-30 16:50:36,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:50:36,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:36,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:36,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:36,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:36,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -13465944, now seen corresponding path program 1 times [2023-08-30 16:50:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:36,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516650122] [2023-08-30 16:50:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:37,070 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:50:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516650122] [2023-08-30 16:50:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516650122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719683262] [2023-08-30 16:50:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:37,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:37,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:50:37,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:50:37,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:37,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:50:37,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:37,774 INFO L130 PetriNetUnfolder]: 6447/8936 cut-off events. [2023-08-30 16:50:37,775 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2023-08-30 16:50:37,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18470 conditions, 8936 events. 6447/8936 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 43213 event pairs, 2195 based on Foata normal form. 200/9136 useless extension candidates. Maximal degree in co-relation 18460. Up to 6533 conditions per place. [2023-08-30 16:50:37,801 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-30 16:50:37,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 208 flow [2023-08-30 16:50:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-30 16:50:37,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512396694214876 [2023-08-30 16:50:37,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-30 16:50:37,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-30 16:50:37,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:37,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-30 16:50:37,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:37,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:50:37,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:50:37,807 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 372 transitions. [2023-08-30 16:50:37,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 208 flow [2023-08-30 16:50:37,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:37,811 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 112 flow [2023-08-30 16:50:37,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-30 16:50:37,812 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-30 16:50:37,812 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 112 flow [2023-08-30 16:50:37,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:50:37,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:37,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:37,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:37,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:37,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash -417445636, now seen corresponding path program 1 times [2023-08-30 16:50:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681271500] [2023-08-30 16:50:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:38,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681271500] [2023-08-30 16:50:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681271500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:38,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:38,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774225109] [2023-08-30 16:50:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:38,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:38,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:38,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:38,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:50:38,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:50:38,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:38,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:50:38,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:38,645 INFO L130 PetriNetUnfolder]: 5983/8304 cut-off events. [2023-08-30 16:50:38,645 INFO L131 PetriNetUnfolder]: For 3308/3308 co-relation queries the response was YES. [2023-08-30 16:50:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21088 conditions, 8304 events. 5983/8304 cut-off events. For 3308/3308 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 38685 event pairs, 1691 based on Foata normal form. 112/8416 useless extension candidates. Maximal degree in co-relation 21076. Up to 4373 conditions per place. [2023-08-30 16:50:38,682 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-30 16:50:38,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 284 flow [2023-08-30 16:50:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-30 16:50:38,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2023-08-30 16:50:38,684 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-30 16:50:38,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-30 16:50:38,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:38,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-30 16:50:38,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:50:38,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:38,687 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:38,688 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 112 flow. Second operand 4 states and 481 transitions. [2023-08-30 16:50:38,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 284 flow [2023-08-30 16:50:38,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:38,700 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 156 flow [2023-08-30 16:50:38,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-30 16:50:38,701 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-30 16:50:38,701 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 156 flow [2023-08-30 16:50:38,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:50:38,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:38,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:38,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:38,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:38,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash -121816418, now seen corresponding path program 1 times [2023-08-30 16:50:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:38,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765372238] [2023-08-30 16:50:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:38,820 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:50:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765372238] [2023-08-30 16:50:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765372238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:38,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445042064] [2023-08-30 16:50:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:38,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:38,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:38,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-08-30 16:50:38,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:50:38,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:38,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-08-30 16:50:38,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:39,333 INFO L130 PetriNetUnfolder]: 5106/7329 cut-off events. [2023-08-30 16:50:39,333 INFO L131 PetriNetUnfolder]: For 4673/4701 co-relation queries the response was YES. [2023-08-30 16:50:39,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19088 conditions, 7329 events. 5106/7329 cut-off events. For 4673/4701 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 37773 event pairs, 1383 based on Foata normal form. 32/7303 useless extension candidates. Maximal degree in co-relation 19073. Up to 6436 conditions per place. [2023-08-30 16:50:39,375 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 42 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2023-08-30 16:50:39,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 320 flow [2023-08-30 16:50:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-30 16:50:39,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289256198347108 [2023-08-30 16:50:39,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-30 16:50:39,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-30 16:50:39,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:39,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-30 16:50:39,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:50:39,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:50:39,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:50:39,384 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 156 flow. Second operand 3 states and 384 transitions. [2023-08-30 16:50:39,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 320 flow [2023-08-30 16:50:39,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:39,392 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 205 flow [2023-08-30 16:50:39,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-30 16:50:39,393 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-30 16:50:39,393 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 205 flow [2023-08-30 16:50:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:50:39,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:39,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:39,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:50:39,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:39,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 518648596, now seen corresponding path program 1 times [2023-08-30 16:50:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144695434] [2023-08-30 16:50:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:39,651 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:50:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144695434] [2023-08-30 16:50:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144695434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:39,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:39,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:39,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565908126] [2023-08-30 16:50:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:39,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:39,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:39,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:39,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:39,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:39,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:40,220 INFO L130 PetriNetUnfolder]: 4087/6071 cut-off events. [2023-08-30 16:50:40,220 INFO L131 PetriNetUnfolder]: For 5282/5690 co-relation queries the response was YES. [2023-08-30 16:50:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16317 conditions, 6071 events. 4087/6071 cut-off events. For 5282/5690 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 34328 event pairs, 734 based on Foata normal form. 589/6497 useless extension candidates. Maximal degree in co-relation 16300. Up to 4018 conditions per place. [2023-08-30 16:50:40,278 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 78 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2023-08-30 16:50:40,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 98 transitions, 641 flow [2023-08-30 16:50:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-30 16:50:40,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515702479338843 [2023-08-30 16:50:40,280 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-30 16:50:40,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-30 16:50:40,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:40,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-30 16:50:40,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 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:50:40,284 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 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:50:40,284 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 205 flow. Second operand 5 states and 624 transitions. [2023-08-30 16:50:40,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 98 transitions, 641 flow [2023-08-30 16:50:40,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:40,289 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 274 flow [2023-08-30 16:50:40,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-30 16:50:40,291 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-30 16:50:40,291 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 274 flow [2023-08-30 16:50:40,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:40,292 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:50:40,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:50:40,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:40,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1739531479, now seen corresponding path program 1 times [2023-08-30 16:50:40,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:40,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686243109] [2023-08-30 16:50:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:40,525 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:50:40,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:40,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686243109] [2023-08-30 16:50:40,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686243109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:40,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:40,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313127185] [2023-08-30 16:50:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:40,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:40,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:40,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2023-08-30 16:50:40,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:50:40,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:40,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2023-08-30 16:50:40,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:41,182 INFO L130 PetriNetUnfolder]: 6450/9383 cut-off events. [2023-08-30 16:50:41,182 INFO L131 PetriNetUnfolder]: For 13431/13431 co-relation queries the response was YES. [2023-08-30 16:50:41,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33428 conditions, 9383 events. 6450/9383 cut-off events. For 13431/13431 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 50705 event pairs, 1481 based on Foata normal form. 101/9484 useless extension candidates. Maximal degree in co-relation 33407. Up to 4781 conditions per place. [2023-08-30 16:50:41,219 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 61 selfloop transitions, 11 changer transitions 14/86 dead transitions. [2023-08-30 16:50:41,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 610 flow [2023-08-30 16:50:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-08-30 16:50:41,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506198347107438 [2023-08-30 16:50:41,221 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-08-30 16:50:41,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-08-30 16:50:41,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:41,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-08-30 16:50:41,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 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:50:41,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:41,224 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:41,224 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 274 flow. Second operand 4 states and 490 transitions. [2023-08-30 16:50:41,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 610 flow [2023-08-30 16:50:41,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 86 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:41,236 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 278 flow [2023-08-30 16:50:41,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 16:50:41,236 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-30 16:50:41,237 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 278 flow [2023-08-30 16:50:41,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:50:41,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:41,237 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:50:41,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:50:41,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:41,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash 786394610, now seen corresponding path program 1 times [2023-08-30 16:50:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:41,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113197564] [2023-08-30 16:50:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:41,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:41,399 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:50:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113197564] [2023-08-30 16:50:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113197564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:41,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887874232] [2023-08-30 16:50:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:41,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:41,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:41,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:41,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:41,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:50:41,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:41,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:41,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:41,741 INFO L130 PetriNetUnfolder]: 2453/3916 cut-off events. [2023-08-30 16:50:41,742 INFO L131 PetriNetUnfolder]: For 5738/6001 co-relation queries the response was YES. [2023-08-30 16:50:41,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13598 conditions, 3916 events. 2453/3916 cut-off events. For 5738/6001 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 22605 event pairs, 310 based on Foata normal form. 445/4279 useless extension candidates. Maximal degree in co-relation 13574. Up to 1663 conditions per place. [2023-08-30 16:50:41,762 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 87 selfloop transitions, 14 changer transitions 3/114 dead transitions. [2023-08-30 16:50:41,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 114 transitions, 884 flow [2023-08-30 16:50:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-30 16:50:41,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172176308539945 [2023-08-30 16:50:41,764 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-30 16:50:41,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-30 16:50:41,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:41,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-30 16:50:41,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 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:50:41,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 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:50:41,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 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:50:41,768 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 278 flow. Second operand 6 states and 751 transitions. [2023-08-30 16:50:41,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 114 transitions, 884 flow [2023-08-30 16:50:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 114 transitions, 856 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:41,782 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 386 flow [2023-08-30 16:50:41,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-30 16:50:41,782 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-30 16:50:41,783 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 386 flow [2023-08-30 16:50:41,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:50:41,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:41,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:41,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:50:41,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:41,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 951218603, now seen corresponding path program 1 times [2023-08-30 16:50:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394486693] [2023-08-30 16:50:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:41,950 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:50:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394486693] [2023-08-30 16:50:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394486693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:41,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195962871] [2023-08-30 16:50:41,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:41,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:41,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:41,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:41,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:41,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:41,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 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:50:41,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:41,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:41,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:42,304 INFO L130 PetriNetUnfolder]: 2118/3419 cut-off events. [2023-08-30 16:50:42,304 INFO L131 PetriNetUnfolder]: For 7040/7408 co-relation queries the response was YES. [2023-08-30 16:50:42,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14196 conditions, 3419 events. 2118/3419 cut-off events. For 7040/7408 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19614 event pairs, 211 based on Foata normal form. 301/3650 useless extension candidates. Maximal degree in co-relation 14168. Up to 1528 conditions per place. [2023-08-30 16:50:42,323 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 94 selfloop transitions, 23 changer transitions 16/143 dead transitions. [2023-08-30 16:50:42,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 143 transitions, 1180 flow [2023-08-30 16:50:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:50:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:50:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 16:50:42,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165289256198347 [2023-08-30 16:50:42,326 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 16:50:42,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 16:50:42,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:42,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 16:50:42,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 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:50:42,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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:50:42,330 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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:50:42,331 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 386 flow. Second operand 8 states and 1000 transitions. [2023-08-30 16:50:42,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 143 transitions, 1180 flow [2023-08-30 16:50:42,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 143 transitions, 1136 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:42,403 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 510 flow [2023-08-30 16:50:42,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-30 16:50:42,405 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-30 16:50:42,405 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 510 flow [2023-08-30 16:50:42,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 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:50:42,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:42,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:42,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:50:42,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:42,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:42,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1526752606, now seen corresponding path program 1 times [2023-08-30 16:50:42,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870526285] [2023-08-30 16:50:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:42,593 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:50:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870526285] [2023-08-30 16:50:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870526285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:42,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:42,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178210068] [2023-08-30 16:50:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:42,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:42,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:42,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:42,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:50:42,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:50:42,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:42,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:50:42,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:43,058 INFO L130 PetriNetUnfolder]: 3201/5214 cut-off events. [2023-08-30 16:50:43,058 INFO L131 PetriNetUnfolder]: For 18355/18432 co-relation queries the response was YES. [2023-08-30 16:50:43,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22911 conditions, 5214 events. 3201/5214 cut-off events. For 18355/18432 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 31937 event pairs, 830 based on Foata normal form. 65/5202 useless extension candidates. Maximal degree in co-relation 22880. Up to 2719 conditions per place. [2023-08-30 16:50:43,078 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 72 selfloop transitions, 2 changer transitions 57/137 dead transitions. [2023-08-30 16:50:43,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1405 flow [2023-08-30 16:50:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-30 16:50:43,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289256198347108 [2023-08-30 16:50:43,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-30 16:50:43,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-30 16:50:43,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:43,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-30 16:50:43,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:50:43,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:43,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:43,083 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 510 flow. Second operand 4 states and 512 transitions. [2023-08-30 16:50:43,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1405 flow [2023-08-30 16:50:43,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 137 transitions, 1144 flow, removed 105 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:43,265 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 380 flow [2023-08-30 16:50:43,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2023-08-30 16:50:43,266 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-30 16:50:43,266 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 380 flow [2023-08-30 16:50:43,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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:50:43,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:43,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:43,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:50:43,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:43,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1920149196, now seen corresponding path program 2 times [2023-08-30 16:50:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124199296] [2023-08-30 16:50:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:43,481 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:50:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124199296] [2023-08-30 16:50:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124199296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:43,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:43,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:50:43,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282403967] [2023-08-30 16:50:43,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:43,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:43,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:43,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:43,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 242 [2023-08-30 16:50:43,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:50:43,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:43,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 242 [2023-08-30 16:50:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:44,007 INFO L130 PetriNetUnfolder]: 2423/4112 cut-off events. [2023-08-30 16:50:44,009 INFO L131 PetriNetUnfolder]: For 7802/8094 co-relation queries the response was YES. [2023-08-30 16:50:44,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15309 conditions, 4112 events. 2423/4112 cut-off events. For 7802/8094 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 27147 event pairs, 253 based on Foata normal form. 244/4227 useless extension candidates. Maximal degree in co-relation 15277. Up to 1081 conditions per place. [2023-08-30 16:50:44,050 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 62 selfloop transitions, 21 changer transitions 49/138 dead transitions. [2023-08-30 16:50:44,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1106 flow [2023-08-30 16:50:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 16:50:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 16:50:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1220 transitions. [2023-08-30 16:50:44,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2023-08-30 16:50:44,053 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1220 transitions. [2023-08-30 16:50:44,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1220 transitions. [2023-08-30 16:50:44,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:44,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1220 transitions. [2023-08-30 16:50:44,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 0 states have call successors, (0), 0 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:50:44,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 0 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:50:44,065 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 0 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:50:44,065 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 380 flow. Second operand 10 states and 1220 transitions. [2023-08-30 16:50:44,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1106 flow [2023-08-30 16:50:44,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 138 transitions, 1081 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:44,213 INFO L231 Difference]: Finished difference. Result has 78 places, 48 transitions, 369 flow [2023-08-30 16:50:44,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=369, PETRI_PLACES=78, PETRI_TRANSITIONS=48} [2023-08-30 16:50:44,215 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2023-08-30 16:50:44,215 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 48 transitions, 369 flow [2023-08-30 16:50:44,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:50:44,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:44,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:44,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:50:44,216 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:44,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1954655115, now seen corresponding path program 1 times [2023-08-30 16:50:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:44,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217158738] [2023-08-30 16:50:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:44,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:44,414 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:50:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217158738] [2023-08-30 16:50:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217158738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:44,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:44,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404948687] [2023-08-30 16:50:44,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:44,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:44,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:44,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-08-30 16:50:44,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 48 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:50:44,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:44,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-08-30 16:50:44,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:44,637 INFO L130 PetriNetUnfolder]: 914/1589 cut-off events. [2023-08-30 16:50:44,638 INFO L131 PetriNetUnfolder]: For 4950/4950 co-relation queries the response was YES. [2023-08-30 16:50:44,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6833 conditions, 1589 events. 914/1589 cut-off events. For 4950/4950 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8319 event pairs, 168 based on Foata normal form. 1/1590 useless extension candidates. Maximal degree in co-relation 6805. Up to 855 conditions per place. [2023-08-30 16:50:44,645 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 63 selfloop transitions, 15 changer transitions 43/121 dead transitions. [2023-08-30 16:50:44,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 1121 flow [2023-08-30 16:50:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-30 16:50:44,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983471074380165 [2023-08-30 16:50:44,647 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-30 16:50:44,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-30 16:50:44,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:44,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-30 16:50:44,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 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:50:44,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 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:50:44,651 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 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:50:44,651 INFO L175 Difference]: Start difference. First operand has 78 places, 48 transitions, 369 flow. Second operand 5 states and 603 transitions. [2023-08-30 16:50:44,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 1121 flow [2023-08-30 16:50:44,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 906 flow, removed 43 selfloop flow, removed 14 redundant places. [2023-08-30 16:50:44,667 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 362 flow [2023-08-30 16:50:44,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2023-08-30 16:50:44,668 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-30 16:50:44,668 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 362 flow [2023-08-30 16:50:44,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:50:44,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:44,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:50:44,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:44,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -71108669, now seen corresponding path program 2 times [2023-08-30 16:50:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89051240] [2023-08-30 16:50:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:44,833 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:50:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89051240] [2023-08-30 16:50:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89051240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335816613] [2023-08-30 16:50:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:44,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-08-30 16:50:44,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:50:44,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:44,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-08-30 16:50:44,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:44,970 INFO L130 PetriNetUnfolder]: 533/966 cut-off events. [2023-08-30 16:50:44,971 INFO L131 PetriNetUnfolder]: For 2633/2651 co-relation queries the response was YES. [2023-08-30 16:50:44,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3988 conditions, 966 events. 533/966 cut-off events. For 2633/2651 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4486 event pairs, 129 based on Foata normal form. 10/968 useless extension candidates. Maximal degree in co-relation 3958. Up to 496 conditions per place. [2023-08-30 16:50:44,974 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 36 selfloop transitions, 1 changer transitions 44/83 dead transitions. [2023-08-30 16:50:44,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 678 flow [2023-08-30 16:50:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-30 16:50:44,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518595041322314 [2023-08-30 16:50:44,976 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-30 16:50:44,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-30 16:50:44,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:44,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-30 16:50:44,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:50:44,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:44,979 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:50:44,980 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 362 flow. Second operand 4 states and 502 transitions. [2023-08-30 16:50:44,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 678 flow [2023-08-30 16:50:44,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 665 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:44,987 INFO L231 Difference]: Finished difference. Result has 65 places, 37 transitions, 218 flow [2023-08-30 16:50:44,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2023-08-30 16:50:44,988 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-08-30 16:50:44,988 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 218 flow [2023-08-30 16:50:44,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:50:44,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:44,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:44,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:50:44,989 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:44,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1138885233, now seen corresponding path program 3 times [2023-08-30 16:50:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996975578] [2023-08-30 16:50:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996975578] [2023-08-30 16:50:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996975578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536209689] [2023-08-30 16:50:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:45,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:45,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:45,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:45,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-08-30 16:50:45,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 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:50:45,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:45,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-08-30 16:50:45,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:45,499 INFO L130 PetriNetUnfolder]: 165/337 cut-off events. [2023-08-30 16:50:45,499 INFO L131 PetriNetUnfolder]: For 939/939 co-relation queries the response was YES. [2023-08-30 16:50:45,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 337 events. 165/337 cut-off events. For 939/939 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1303 event pairs, 10 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 1402. Up to 125 conditions per place. [2023-08-30 16:50:45,501 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 43 selfloop transitions, 7 changer transitions 27/77 dead transitions. [2023-08-30 16:50:45,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 614 flow [2023-08-30 16:50:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:50:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:50:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 870 transitions. [2023-08-30 16:50:45,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4493801652892562 [2023-08-30 16:50:45,503 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 870 transitions. [2023-08-30 16:50:45,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 870 transitions. [2023-08-30 16:50:45,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:45,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 870 transitions. [2023-08-30 16:50:45,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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:50:45,507 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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:50:45,508 INFO L175 Difference]: Start difference. First operand has 65 places, 37 transitions, 218 flow. Second operand 8 states and 870 transitions. [2023-08-30 16:50:45,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 614 flow [2023-08-30 16:50:45,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 543 flow, removed 8 selfloop flow, removed 15 redundant places. [2023-08-30 16:50:45,511 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 194 flow [2023-08-30 16:50:45,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-30 16:50:45,511 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-30 16:50:45,511 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 194 flow [2023-08-30 16:50:45,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 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:50:45,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:45,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:50:45,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:45,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1811272273, now seen corresponding path program 4 times [2023-08-30 16:50:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35455566] [2023-08-30 16:50:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:45,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:50:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:45,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:50:45,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:50:45,582 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:50:45,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:50:45,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:50:45,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:50:45,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:50:45,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:50:45,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:50:45,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:50:45,584 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:45,588 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:50:45,589 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:50:45,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:50:45 BasicIcfg [2023-08-30 16:50:45,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:50:45,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:50:45,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:50:45,633 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:50:45,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:32" (3/4) ... [2023-08-30 16:50:45,635 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:50:45,682 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:50:45,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:50:45,682 INFO L158 Benchmark]: Toolchain (without parser) took 14240.80ms. Allocated memory was 79.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 55.9MB in the beginning and 748.8MB in the end (delta: -692.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-30 16:50:45,683 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:50:45,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.41ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 51.3MB in the end (delta: 4.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:45,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.21ms. Allocated memory is still 79.7MB. Free memory was 51.3MB in the beginning and 48.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:45,683 INFO L158 Benchmark]: Boogie Preprocessor took 18.53ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 46.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:45,683 INFO L158 Benchmark]: RCFGBuilder took 523.98ms. Allocated memory is still 79.7MB. Free memory was 46.8MB in the beginning and 46.5MB in the end (delta: 296.7kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-30 16:50:45,684 INFO L158 Benchmark]: TraceAbstraction took 13210.31ms. Allocated memory was 79.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 45.6MB in the beginning and 763.5MB in the end (delta: -717.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-30 16:50:45,684 INFO L158 Benchmark]: Witness Printer took 49.40ms. Allocated memory is still 2.0GB. Free memory was 763.5MB in the beginning and 748.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:50:45,685 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.08ms. Allocated memory is still 60.8MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.41ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 51.3MB in the end (delta: 4.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.21ms. Allocated memory is still 79.7MB. Free memory was 51.3MB in the beginning and 48.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.53ms. Allocated memory is still 79.7MB. Free memory was 48.9MB in the beginning and 46.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.98ms. Allocated memory is still 79.7MB. Free memory was 46.8MB in the beginning and 46.5MB in the end (delta: 296.7kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13210.31ms. Allocated memory was 79.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 45.6MB in the beginning and 763.5MB in the end (delta: -717.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 49.40ms. Allocated memory is still 2.0GB. Free memory was 763.5MB in the beginning and 748.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 137 PlacesBefore, 40 PlacesAfterwards, 126 TransitionsBefore, 28 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 6492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3567, independent: 3374, independent conditional: 0, independent unconditional: 3374, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1600, independent: 1559, independent conditional: 0, independent unconditional: 1559, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3567, independent: 1815, independent conditional: 0, independent unconditional: 1815, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1600, unknown conditional: 0, unknown unconditional: 1600] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1029, ((void *)0), P0, ((void *)0))=-1, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1030, ((void *)0), P1, ((void *)0))=0, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1031, ((void *)0), P2, ((void *)0))=1, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1032, ((void *)0), P3, ((void *)0))=2, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1340 IncrementalHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 61 mSDtfsCounter, 1340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=8, InterpolantAutomatonStates: 67, 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.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:50:45,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE