./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014.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 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:43:24,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:43:24,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:43:24,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:43:24,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:43:24,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:43:24,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:43:24,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:43:24,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:43:24,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:43:24,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:43:24,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:43:24,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:43:24,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:43:24,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:43:24,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:43:24,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:43:24,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:43:24,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:43:24,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:43:24,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:43:24,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:43:24,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:43:24,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:43:24,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:43:24,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:43:24,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:43:24,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:43:24,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:43:24,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:43:24,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:43:24,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:43:24,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:43:24,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:43:24,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:43:24,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:43:24,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:43:24,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:43:24,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:43:24,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:43:24,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:43:24,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:43:24,522 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:43:24,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:43:24,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:43:24,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:43:24,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:43:24,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:43:24,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:43:24,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:43:24,526 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:43:24,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:43:24,527 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:43:24,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:43:24,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:43:24,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:43:24,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:43:24,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:43:24,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:43:24,528 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:43:24,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:43:24,528 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:43:24,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:43:24,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:43:24,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:43:24,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:43:24,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:24,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:43:24,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:43:24,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:43:24,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:43:24,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:43:24,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:43:24,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:43:24,531 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:43:24,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:43:24,531 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:43:24,531 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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:43:24,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:43:24,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:43:24,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:43:24,769 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:43:24,769 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:43:24,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-09-01 09:43:25,712 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:43:25,887 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:43:25,887 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-09-01 09:43:25,898 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c79d9df7/d3d5720a6da14927902eee918b66eb98/FLAGeff202bbd [2023-09-01 09:43:25,910 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c79d9df7/d3d5720a6da14927902eee918b66eb98 [2023-09-01 09:43:25,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:43:25,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:43:25,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:25,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:43:25,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:43:25,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:25" (1/1) ... [2023-09-01 09:43:25,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768eee4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:25, skipping insertion in model container [2023-09-01 09:43:25,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:43:25" (1/1) ... [2023-09-01 09:43:25,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:43:25,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:43:26,059 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/mix014.opt.i[944,957] [2023-09-01 09:43:26,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:26,227 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:43:26,236 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/mix014.opt.i[944,957] [2023-09-01 09:43:26,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:43:26,313 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:26,313 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:43:26,318 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:43:26,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26 WrapperNode [2023-09-01 09:43:26,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:43:26,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:26,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:43:26,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:43:26,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,383 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-09-01 09:43:26,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:43:26,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:43:26,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:43:26,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:43:26,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,415 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:43:26,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:43:26,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:43:26,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:43:26,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (1/1) ... [2023-09-01 09:43:26,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:43:26,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:43:26,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:43:26,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:43:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:43:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:43:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:43:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:43:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:43:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:43:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:43:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:43:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:43:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:43:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:43:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:43:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:43:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:43:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:43:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:43:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:43:26,487 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:43:26,645 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:43:26,646 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:43:26,926 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:43:27,011 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:43:27,012 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:43:27,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:27 BoogieIcfgContainer [2023-09-01 09:43:27,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:43:27,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:43:27,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:43:27,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:43:27,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:43:25" (1/3) ... [2023-09-01 09:43:27,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d486602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:27, skipping insertion in model container [2023-09-01 09:43:27,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:43:26" (2/3) ... [2023-09-01 09:43:27,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d486602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:43:27, skipping insertion in model container [2023-09-01 09:43:27,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:27" (3/3) ... [2023-09-01 09:43:27,019 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-09-01 09:43:27,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:43:27,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:43:27,030 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:43:27,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:43:27,065 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:43:27,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:43:27,124 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:43:27,125 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:27,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:43:27,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:43:27,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-09-01 09:43:27,134 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:43:27,140 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:43:27,141 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:43:27,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-09-01 09:43:27,158 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:43:27,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:27,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-09-01 09:43:27,160 INFO L119 LiptonReduction]: Number of co-enabled transitions 2850 [2023-09-01 09:43:30,806 INFO L134 LiptonReduction]: Checked pairs total: 7552 [2023-09-01 09:43:30,806 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-09-01 09:43:30,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:43:30,827 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;@6a0d210d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:43:30,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:43:30,833 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-09-01 09:43:30,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:43:30,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:30,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:30,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:30,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1279332643, now seen corresponding path program 1 times [2023-09-01 09:43:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960139062] [2023-09-01 09:43:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:31,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:31,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960139062] [2023-09-01 09:43:31,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960139062] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:31,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:43:31,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727689579] [2023-09-01 09:43:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:31,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:31,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:31,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 240 [2023-09-01 09:43:31,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:31,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:31,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 240 [2023-09-01 09:43:31,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:31,677 INFO L130 PetriNetUnfolder]: 2594/3779 cut-off events. [2023-09-01 09:43:31,677 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-09-01 09:43:31,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 3779 events. 2594/3779 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20289 event pairs, 518 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7462. Up to 2797 conditions per place. [2023-09-01 09:43:31,694 INFO L137 encePairwiseOnDemand]: 236/240 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-09-01 09:43:31,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-09-01 09:43:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-09-01 09:43:31,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2023-09-01 09:43:31,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-09-01 09:43:31,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-09-01 09:43:31,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:31,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-09-01 09:43:31,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:31,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:31,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:31,722 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 385 transitions. [2023-09-01 09:43:31,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-09-01 09:43:31,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:43:31,727 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-09-01 09:43:31,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-09-01 09:43:31,732 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-09-01 09:43:31,732 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-09-01 09:43:31,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:31,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:31,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:31,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:43:31,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:31,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:31,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1078106122, now seen corresponding path program 1 times [2023-09-01 09:43:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:31,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133534320] [2023-09-01 09:43:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133534320] [2023-09-01 09:43:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133534320] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:43:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144049724] [2023-09-01 09:43:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:31,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:43:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:43:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:43:32,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-09-01 09:43:32,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:32,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-09-01 09:43:32,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:32,834 INFO L130 PetriNetUnfolder]: 8269/11398 cut-off events. [2023-09-01 09:43:32,834 INFO L131 PetriNetUnfolder]: For 416/416 co-relation queries the response was YES. [2023-09-01 09:43:32,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23554 conditions, 11398 events. 8269/11398 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 56920 event pairs, 3053 based on Foata normal form. 248/11646 useless extension candidates. Maximal degree in co-relation 23544. Up to 8473 conditions per place. [2023-09-01 09:43:32,873 INFO L137 encePairwiseOnDemand]: 231/240 looper letters, 39 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2023-09-01 09:43:32,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2023-09-01 09:43:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:43:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:43:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-09-01 09:43:32,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-09-01 09:43:32,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-09-01 09:43:32,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-09-01 09:43:32,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:32,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-09-01 09:43:32,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,878 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 366 transitions. [2023-09-01 09:43:32,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2023-09-01 09:43:32,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:32,885 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2023-09-01 09:43:32,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-09-01 09:43:32,886 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-09-01 09:43:32,886 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2023-09-01 09:43:32,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:32,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:32,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:32,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:43:32,887 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:32,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -938450733, now seen corresponding path program 1 times [2023-09-01 09:43:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550303625] [2023-09-01 09:43:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:33,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:33,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550303625] [2023-09-01 09:43:33,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550303625] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:33,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:33,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625057468] [2023-09-01 09:43:33,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:33,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:33,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:33,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:33,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-09-01 09:43:33,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:33,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-09-01 09:43:33,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:33,837 INFO L130 PetriNetUnfolder]: 7657/10570 cut-off events. [2023-09-01 09:43:33,837 INFO L131 PetriNetUnfolder]: For 4380/4380 co-relation queries the response was YES. [2023-09-01 09:43:33,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27160 conditions, 10570 events. 7657/10570 cut-off events. For 4380/4380 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 50316 event pairs, 2197 based on Foata normal form. 144/10714 useless extension candidates. Maximal degree in co-relation 27148. Up to 5597 conditions per place. [2023-09-01 09:43:33,881 INFO L137 encePairwiseOnDemand]: 231/240 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2023-09-01 09:43:33,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 312 flow [2023-09-01 09:43:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-09-01 09:43:33,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2023-09-01 09:43:33,883 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-09-01 09:43:33,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-09-01 09:43:33,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:33,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-09-01 09:43:33,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,886 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,886 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 476 transitions. [2023-09-01 09:43:33,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 312 flow [2023-09-01 09:43:33,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:43:33,905 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 174 flow [2023-09-01 09:43:33,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-09-01 09:43:33,906 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-09-01 09:43:33,906 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 174 flow [2023-09-01 09:43:33,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:33,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:33,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:33,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:43:33,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:33,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:33,907 INFO L85 PathProgramCache]: Analyzing trace with hash 970492933, now seen corresponding path program 1 times [2023-09-01 09:43:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:33,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762055826] [2023-09-01 09:43:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:33,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762055826] [2023-09-01 09:43:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762055826] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:34,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:43:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829384823] [2023-09-01 09:43:34,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:34,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:34,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-09-01 09:43:34,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:34,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-09-01 09:43:34,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:34,825 INFO L130 PetriNetUnfolder]: 7113/9834 cut-off events. [2023-09-01 09:43:34,825 INFO L131 PetriNetUnfolder]: For 6988/6988 co-relation queries the response was YES. [2023-09-01 09:43:34,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26767 conditions, 9834 events. 7113/9834 cut-off events. For 6988/6988 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 48449 event pairs, 1753 based on Foata normal form. 128/9962 useless extension candidates. Maximal degree in co-relation 26752. Up to 4989 conditions per place. [2023-09-01 09:43:34,855 INFO L137 encePairwiseOnDemand]: 232/240 looper letters, 61 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2023-09-01 09:43:34,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 440 flow [2023-09-01 09:43:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-09-01 09:43:34,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2023-09-01 09:43:34,857 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-09-01 09:43:34,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-09-01 09:43:34,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:34,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-09-01 09:43:34,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,861 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 174 flow. Second operand 4 states and 485 transitions. [2023-09-01 09:43:34,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 440 flow [2023-09-01 09:43:34,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:34,871 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 276 flow [2023-09-01 09:43:34,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-09-01 09:43:34,872 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-09-01 09:43:34,872 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 276 flow [2023-09-01 09:43:34,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:34,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:34,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:34,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:43:34,873 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:34,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1146665568, now seen corresponding path program 1 times [2023-09-01 09:43:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422819016] [2023-09-01 09:43:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:35,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422819016] [2023-09-01 09:43:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422819016] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:35,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:35,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772714202] [2023-09-01 09:43:35,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:35,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:35,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:35,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:35,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-09-01 09:43:35,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:35,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-09-01 09:43:35,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:35,559 INFO L130 PetriNetUnfolder]: 4745/7064 cut-off events. [2023-09-01 09:43:35,559 INFO L131 PetriNetUnfolder]: For 7789/8478 co-relation queries the response was YES. [2023-09-01 09:43:35,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19538 conditions, 7064 events. 4745/7064 cut-off events. For 7789/8478 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 42245 event pairs, 971 based on Foata normal form. 654/7262 useless extension candidates. Maximal degree in co-relation 19519. Up to 4450 conditions per place. [2023-09-01 09:43:35,592 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 84 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2023-09-01 09:43:35,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 108 transitions, 799 flow [2023-09-01 09:43:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-09-01 09:43:35,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2023-09-01 09:43:35,594 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-09-01 09:43:35,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-09-01 09:43:35,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:35,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-09-01 09:43:35,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,597 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,597 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 276 flow. Second operand 5 states and 604 transitions. [2023-09-01 09:43:35,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 108 transitions, 799 flow [2023-09-01 09:43:35,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 795 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:35,607 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 347 flow [2023-09-01 09:43:35,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-09-01 09:43:35,608 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-09-01 09:43:35,609 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 347 flow [2023-09-01 09:43:35,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:35,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:35,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:43:35,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:35,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:35,610 INFO L85 PathProgramCache]: Analyzing trace with hash 552993468, now seen corresponding path program 1 times [2023-09-01 09:43:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253093215] [2023-09-01 09:43:35,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253093215] [2023-09-01 09:43:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253093215] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:43:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774916688] [2023-09-01 09:43:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:35,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:43:35,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:35,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:43:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:43:35,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-09-01 09:43:35,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:35,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:35,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-09-01 09:43:35,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:36,376 INFO L130 PetriNetUnfolder]: 3916/6022 cut-off events. [2023-09-01 09:43:36,376 INFO L131 PetriNetUnfolder]: For 9369/10622 co-relation queries the response was YES. [2023-09-01 09:43:36,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21360 conditions, 6022 events. 3916/6022 cut-off events. For 9369/10622 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 36951 event pairs, 423 based on Foata normal form. 772/6430 useless extension candidates. Maximal degree in co-relation 21337. Up to 2157 conditions per place. [2023-09-01 09:43:36,407 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 115 selfloop transitions, 19 changer transitions 1/149 dead transitions. [2023-09-01 09:43:36,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 149 transitions, 1192 flow [2023-09-01 09:43:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:43:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:43:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-09-01 09:43:36,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2023-09-01 09:43:36,410 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-09-01 09:43:36,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-09-01 09:43:36,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:36,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-09-01 09:43:36,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:36,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:36,414 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 240.0) internal successors, (1920), 8 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:36,414 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 347 flow. Second operand 7 states and 847 transitions. [2023-09-01 09:43:36,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 149 transitions, 1192 flow [2023-09-01 09:43:36,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 149 transitions, 1187 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:36,429 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 476 flow [2023-09-01 09:43:36,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-09-01 09:43:36,430 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-09-01 09:43:36,430 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 476 flow [2023-09-01 09:43:36,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:36,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:36,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:36,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:43:36,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:36,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash 693074741, now seen corresponding path program 1 times [2023-09-01 09:43:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:36,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485591690] [2023-09-01 09:43:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:36,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485591690] [2023-09-01 09:43:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485591690] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:36,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659909532] [2023-09-01 09:43:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:36,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:36,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:36,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:36,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:36,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 240 [2023-09-01 09:43:36,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:36,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:36,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 240 [2023-09-01 09:43:36,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:37,492 INFO L130 PetriNetUnfolder]: 5395/8354 cut-off events. [2023-09-01 09:43:37,493 INFO L131 PetriNetUnfolder]: For 25940/26960 co-relation queries the response was YES. [2023-09-01 09:43:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35955 conditions, 8354 events. 5395/8354 cut-off events. For 25940/26960 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 53928 event pairs, 734 based on Foata normal form. 323/8414 useless extension candidates. Maximal degree in co-relation 35928. Up to 4490 conditions per place. [2023-09-01 09:43:37,534 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 83 selfloop transitions, 3 changer transitions 33/130 dead transitions. [2023-09-01 09:43:37,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 130 transitions, 1240 flow [2023-09-01 09:43:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-09-01 09:43:37,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5239583333333333 [2023-09-01 09:43:37,536 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-09-01 09:43:37,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-09-01 09:43:37,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:37,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-09-01 09:43:37,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,539 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,539 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 476 flow. Second operand 4 states and 503 transitions. [2023-09-01 09:43:37,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 130 transitions, 1240 flow [2023-09-01 09:43:37,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 130 transitions, 1105 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-09-01 09:43:37,737 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 437 flow [2023-09-01 09:43:37,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=437, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-09-01 09:43:37,738 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-09-01 09:43:37,738 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 437 flow [2023-09-01 09:43:37,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:37,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:37,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:43:37,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:37,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1164834199, now seen corresponding path program 1 times [2023-09-01 09:43:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017106081] [2023-09-01 09:43:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017106081] [2023-09-01 09:43:37,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017106081] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:37,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:37,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:43:37,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872333605] [2023-09-01 09:43:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:37,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:43:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:43:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:43:37,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-09-01 09:43:37,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 437 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:37,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:37,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-09-01 09:43:37,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:38,633 INFO L130 PetriNetUnfolder]: 4090/6467 cut-off events. [2023-09-01 09:43:38,633 INFO L131 PetriNetUnfolder]: For 16470/18077 co-relation queries the response was YES. [2023-09-01 09:43:38,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24952 conditions, 6467 events. 4090/6467 cut-off events. For 16470/18077 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 41893 event pairs, 359 based on Foata normal form. 855/6962 useless extension candidates. Maximal degree in co-relation 24924. Up to 1873 conditions per place. [2023-09-01 09:43:38,659 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 125 selfloop transitions, 25 changer transitions 13/179 dead transitions. [2023-09-01 09:43:38,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 179 transitions, 1523 flow [2023-09-01 09:43:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:43:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:43:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1085 transitions. [2023-09-01 09:43:38,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023148148148148 [2023-09-01 09:43:38,662 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1085 transitions. [2023-09-01 09:43:38,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1085 transitions. [2023-09-01 09:43:38,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:38,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1085 transitions. [2023-09-01 09:43:38,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:38,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:38,667 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 240.0) internal successors, (2400), 10 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:38,667 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 437 flow. Second operand 9 states and 1085 transitions. [2023-09-01 09:43:38,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 179 transitions, 1523 flow [2023-09-01 09:43:38,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 179 transitions, 1515 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:43:38,783 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 608 flow [2023-09-01 09:43:38,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2023-09-01 09:43:38,784 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2023-09-01 09:43:38,785 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 608 flow [2023-09-01 09:43:38,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:38,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:38,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:38,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:43:38,785 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:38,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1036540121, now seen corresponding path program 1 times [2023-09-01 09:43:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:38,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596946284] [2023-09-01 09:43:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:39,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:39,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596946284] [2023-09-01 09:43:39,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596946284] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:39,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:39,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:43:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485661351] [2023-09-01 09:43:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:43:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:43:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:43:39,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 240 [2023-09-01 09:43:39,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 608 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:39,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:39,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 240 [2023-09-01 09:43:39,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:39,663 INFO L130 PetriNetUnfolder]: 4004/6312 cut-off events. [2023-09-01 09:43:39,663 INFO L131 PetriNetUnfolder]: For 20179/21517 co-relation queries the response was YES. [2023-09-01 09:43:39,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27535 conditions, 6312 events. 4004/6312 cut-off events. For 20179/21517 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 40799 event pairs, 349 based on Foata normal form. 535/6488 useless extension candidates. Maximal degree in co-relation 27503. Up to 1848 conditions per place. [2023-09-01 09:43:39,688 INFO L137 encePairwiseOnDemand]: 233/240 looper letters, 94 selfloop transitions, 29 changer transitions 42/180 dead transitions. [2023-09-01 09:43:39,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 180 transitions, 1619 flow [2023-09-01 09:43:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 09:43:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 09:43:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1302 transitions. [2023-09-01 09:43:39,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49318181818181817 [2023-09-01 09:43:39,692 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1302 transitions. [2023-09-01 09:43:39,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1302 transitions. [2023-09-01 09:43:39,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:39,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1302 transitions. [2023-09-01 09:43:39,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.36363636363636) internal successors, (1302), 11 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:39,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 240.0) internal successors, (2880), 12 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:39,702 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 240.0) internal successors, (2880), 12 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:39,702 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 608 flow. Second operand 11 states and 1302 transitions. [2023-09-01 09:43:39,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 180 transitions, 1619 flow [2023-09-01 09:43:40,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 180 transitions, 1497 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-09-01 09:43:40,053 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 550 flow [2023-09-01 09:43:40,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2023-09-01 09:43:40,054 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2023-09-01 09:43:40,054 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 550 flow [2023-09-01 09:43:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:40,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:40,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:40,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:43:40,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:40,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash -192576404, now seen corresponding path program 1 times [2023-09-01 09:43:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:40,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017304303] [2023-09-01 09:43:40,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017304303] [2023-09-01 09:43:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017304303] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225758244] [2023-09-01 09:43:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:40,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:40,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 240 [2023-09-01 09:43:40,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:40,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:40,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 240 [2023-09-01 09:43:40,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:40,958 INFO L130 PetriNetUnfolder]: 6143/9509 cut-off events. [2023-09-01 09:43:40,958 INFO L131 PetriNetUnfolder]: For 31982/31982 co-relation queries the response was YES. [2023-09-01 09:43:40,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41574 conditions, 9509 events. 6143/9509 cut-off events. For 31982/31982 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 58306 event pairs, 1207 based on Foata normal form. 1/9510 useless extension candidates. Maximal degree in co-relation 41540. Up to 4705 conditions per place. [2023-09-01 09:43:40,988 INFO L137 encePairwiseOnDemand]: 230/240 looper letters, 78 selfloop transitions, 23 changer transitions 54/155 dead transitions. [2023-09-01 09:43:40,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 155 transitions, 1489 flow [2023-09-01 09:43:40,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:43:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:43:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-09-01 09:43:40,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2023-09-01 09:43:40,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-09-01 09:43:40,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-09-01 09:43:40,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:40,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-09-01 09:43:40,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:40,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:40,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:40,994 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 550 flow. Second operand 5 states and 596 transitions. [2023-09-01 09:43:40,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 155 transitions, 1489 flow [2023-09-01 09:43:41,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 155 transitions, 1244 flow, removed 53 selfloop flow, removed 10 redundant places. [2023-09-01 09:43:41,362 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 506 flow [2023-09-01 09:43:41,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2023-09-01 09:43:41,363 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-09-01 09:43:41,363 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 506 flow [2023-09-01 09:43:41,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:41,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:41,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:43:41,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:41,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:41,364 INFO L85 PathProgramCache]: Analyzing trace with hash 386977460, now seen corresponding path program 2 times [2023-09-01 09:43:41,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656783954] [2023-09-01 09:43:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:41,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656783954] [2023-09-01 09:43:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656783954] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731398471] [2023-09-01 09:43:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:41,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:41,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:41,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:41,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:41,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 240 [2023-09-01 09:43:41,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:41,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 240 [2023-09-01 09:43:41,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:41,800 INFO L130 PetriNetUnfolder]: 1840/3149 cut-off events. [2023-09-01 09:43:41,800 INFO L131 PetriNetUnfolder]: For 8342/8454 co-relation queries the response was YES. [2023-09-01 09:43:41,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12964 conditions, 3149 events. 1840/3149 cut-off events. For 8342/8454 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18802 event pairs, 400 based on Foata normal form. 25/3099 useless extension candidates. Maximal degree in co-relation 12937. Up to 1467 conditions per place. [2023-09-01 09:43:41,810 INFO L137 encePairwiseOnDemand]: 237/240 looper letters, 45 selfloop transitions, 1 changer transitions 56/108 dead transitions. [2023-09-01 09:43:41,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 948 flow [2023-09-01 09:43:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-09-01 09:43:41,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2023-09-01 09:43:41,813 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-09-01 09:43:41,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-09-01 09:43:41,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:41,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-09-01 09:43:41,814 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-09-01 09:43:41,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,816 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,816 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 506 flow. Second operand 4 states and 502 transitions. [2023-09-01 09:43:41,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 948 flow [2023-09-01 09:43:41,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 918 flow, removed 15 selfloop flow, removed 7 redundant places. [2023-09-01 09:43:41,857 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 301 flow [2023-09-01 09:43:41,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2023-09-01 09:43:41,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-09-01 09:43:41,858 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 301 flow [2023-09-01 09:43:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:41,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:41,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:43:41,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:41,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1731206528, now seen corresponding path program 3 times [2023-09-01 09:43:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959481427] [2023-09-01 09:43:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:43:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:43:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:43:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959481427] [2023-09-01 09:43:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959481427] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:43:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:43:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:43:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707094223] [2023-09-01 09:43:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:43:42,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:43:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:43:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:43:42,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:43:42,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2023-09-01 09:43:42,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:42,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:43:42,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2023-09-01 09:43:42,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:43:42,182 INFO L130 PetriNetUnfolder]: 1079/1787 cut-off events. [2023-09-01 09:43:42,182 INFO L131 PetriNetUnfolder]: For 5660/5660 co-relation queries the response was YES. [2023-09-01 09:43:42,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7455 conditions, 1787 events. 1079/1787 cut-off events. For 5660/5660 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8790 event pairs, 411 based on Foata normal form. 1/1788 useless extension candidates. Maximal degree in co-relation 7433. Up to 1144 conditions per place. [2023-09-01 09:43:42,187 INFO L137 encePairwiseOnDemand]: 235/240 looper letters, 39 selfloop transitions, 4 changer transitions 30/73 dead transitions. [2023-09-01 09:43:42,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 585 flow [2023-09-01 09:43:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:43:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:43:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-09-01 09:43:42,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490625 [2023-09-01 09:43:42,189 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-09-01 09:43:42,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-09-01 09:43:42,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:43:42,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-09-01 09:43:42,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:42,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:42,191 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:42,191 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 301 flow. Second operand 4 states and 471 transitions. [2023-09-01 09:43:42,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 585 flow [2023-09-01 09:43:42,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 522 flow, removed 8 selfloop flow, removed 9 redundant places. [2023-09-01 09:43:42,203 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 203 flow [2023-09-01 09:43:42,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2023-09-01 09:43:42,204 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-09-01 09:43:42,204 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 203 flow [2023-09-01 09:43:42,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:43:42,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:43:42,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:42,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:43:42,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:43:42,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:43:42,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1810377108, now seen corresponding path program 4 times [2023-09-01 09:43:42,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:43:42,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529277206] [2023-09-01 09:43:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:43:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:43:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:42,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:43:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:43:42,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:43:42,358 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:43:42,359 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:43:42,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:43:42,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:43:42,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:43:42,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:43:42,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:43:42,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:43:42,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:43:42,361 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:43:42,365 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:43:42,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:43:42,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:43:42 BasicIcfg [2023-09-01 09:43:42,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:43:42,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:43:42,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:43:42,473 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:43:42,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:43:27" (3/4) ... [2023-09-01 09:43:42,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:43:42,562 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:43:42,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:43:42,562 INFO L158 Benchmark]: Toolchain (without parser) took 16649.66ms. Allocated memory was 67.1MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 36.2MB in the beginning and 919.0MB in the end (delta: -882.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-09-01 09:43:42,563 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:43:42,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.95ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 27.2MB in the end (delta: 8.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-09-01 09:43:42,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.82ms. Allocated memory is still 67.1MB. Free memory was 27.2MB in the beginning and 44.0MB in the end (delta: -16.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:43:42,563 INFO L158 Benchmark]: Boogie Preprocessor took 34.51ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 41.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:43:42,564 INFO L158 Benchmark]: RCFGBuilder took 594.07ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.9MB in the beginning and 52.8MB in the end (delta: -10.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-09-01 09:43:42,564 INFO L158 Benchmark]: TraceAbstraction took 15457.77ms. Allocated memory was 81.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 52.0MB in the beginning and 934.7MB in the end (delta: -882.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-09-01 09:43:42,567 INFO L158 Benchmark]: Witness Printer took 89.24ms. Allocated memory is still 2.2GB. Free memory was 934.7MB in the beginning and 919.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:43:42,568 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.10ms. Allocated memory is still 54.5MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.95ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 27.2MB in the end (delta: 8.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.82ms. Allocated memory is still 67.1MB. Free memory was 27.2MB in the beginning and 44.0MB in the end (delta: -16.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.51ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 41.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.07ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.9MB in the beginning and 52.8MB in the end (delta: -10.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15457.77ms. Allocated memory was 81.8MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 52.0MB in the beginning and 934.7MB in the end (delta: -882.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 89.24ms. Allocated memory is still 2.2GB. Free memory was 934.7MB in the beginning and 919.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 137 PlacesBefore, 41 PlacesAfterwards, 126 TransitionsBefore, 29 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 7552 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3401, independent: 3181, independent conditional: 0, independent unconditional: 3181, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1538, independent: 1500, independent conditional: 0, independent unconditional: 1500, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3401, independent: 1681, independent conditional: 0, independent unconditional: 1681, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1538, unknown conditional: 0, unknown unconditional: 1538] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [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; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-3, t357={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] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=-2, t357={5:0}, t358={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] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=-1, t357={5:0}, t358={6:0}, t359={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] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={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] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 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) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 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) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 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 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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: 874]: 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: 876]: 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: 872]: 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: 870]: 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: 15.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1249 IncrementalHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 69 mSDtfsCounter, 1249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=8, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:43:42,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE