/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:48:54,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:48:54,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:48:54,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:48:54,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:48:54,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:48:54,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:48:54,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:48:54,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:48:54,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:48:54,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:48:54,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:48:54,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:48:54,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:48:54,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:48:54,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:48:54,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:48:54,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:48:54,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:48:54,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:48:54,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:48:54,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:48:54,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:48:54,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:48:54,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:48:54,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:48:54,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:48:54,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:48:54,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:48:54,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:48:54,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:48:54,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:48:54,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:48:54,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:48:54,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:48:54,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:48:54,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:48:54,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:48:54,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:48:54,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:48:54,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:48:54,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:48:54,471 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:48:54,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:48:54,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:48:54,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:48:54,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:48:54,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:48:54,473 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:48:54,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:48:54,473 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:48:54,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:48:54,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:48:54,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:48:54,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:48:54,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:48:54,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:48:54,475 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:48:54,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:48:54,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:48:54,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:48:54,624 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:48:54,625 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:48:54,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-01-28 06:48:55,639 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:48:55,778 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:48:55,779 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-01-28 06:48:55,806 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/300e120e9/284bb0dd036c4a5aa8a7ea1ec3f17409/FLAG5c85e2b04 [2023-01-28 06:48:55,815 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/300e120e9/284bb0dd036c4a5aa8a7ea1ec3f17409 [2023-01-28 06:48:55,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:48:55,817 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:48:55,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:48:55,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:48:55,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:48:55,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:48:55" (1/1) ... [2023-01-28 06:48:55,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7265cb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:55, skipping insertion in model container [2023-01-28 06:48:55,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:48:55" (1/1) ... [2023-01-28 06:48:55,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:48:55,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:48:55,978 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/mix008_tso.oepc.i[949,962] [2023-01-28 06:48:56,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:48:56,112 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:48:56,119 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/mix008_tso.oepc.i[949,962] [2023-01-28 06:48:56,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:48:56,195 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:48:56,195 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:48:56,200 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:48:56,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56 WrapperNode [2023-01-28 06:48:56,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:48:56,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:48:56,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:48:56,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:48:56,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,273 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 282 [2023-01-28 06:48:56,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:48:56,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:48:56,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:48:56,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:48:56,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,319 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:48:56,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:48:56,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:48:56,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:48:56,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (1/1) ... [2023-01-28 06:48:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:48:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:48:56,362 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-01-28 06:48:56,377 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-01-28 06:48:56,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:48:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:48:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:48:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:48:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:48:56,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:48:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:48:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:48:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:48:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:48:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:48:56,403 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:48:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:48:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:48:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:48:56,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:48:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:48:56,406 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:48:56,513 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:48:56,515 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:48:56,890 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:48:57,008 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:48:57,008 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:48:57,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:48:57 BoogieIcfgContainer [2023-01-28 06:48:57,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:48:57,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:48:57,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:48:57,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:48:57,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:48:55" (1/3) ... [2023-01-28 06:48:57,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f4c4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:48:57, skipping insertion in model container [2023-01-28 06:48:57,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:48:56" (2/3) ... [2023-01-28 06:48:57,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f4c4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:48:57, skipping insertion in model container [2023-01-28 06:48:57,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:48:57" (3/3) ... [2023-01-28 06:48:57,014 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2023-01-28 06:48:57,027 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:48:57,027 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-01-28 06:48:57,027 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:48:57,083 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:48:57,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2023-01-28 06:48:57,182 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2023-01-28 06:48:57,183 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:48:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:48:57,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2023-01-28 06:48:57,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2023-01-28 06:48:57,198 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:48:57,215 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2023-01-28 06:48:57,217 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2023-01-28 06:48:57,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2023-01-28 06:48:57,237 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2023-01-28 06:48:57,237 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:48:57,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-01-28 06:48:57,239 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-01-28 06:49:01,477 INFO L134 LiptonReduction]: Checked pairs total: 9605 [2023-01-28 06:49:01,477 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-01-28 06:49:01,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:49:01,491 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=false, 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;@60cd14ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:49:01,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-01-28 06:49:01,493 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2023-01-28 06:49:01,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:49:01,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:01,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:01,494 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:01,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1221494971, now seen corresponding path program 1 times [2023-01-28 06:49:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:01,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702259999] [2023-01-28 06:49:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702259999] [2023-01-28 06:49:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702259999] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:49:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963152860] [2023-01-28 06:49:01,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:49:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:49:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:49:01,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 276 [2023-01-28 06:49:01,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:01,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:01,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 276 [2023-01-28 06:49:01,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:03,059 INFO L130 PetriNetUnfolder]: 9255/12507 cut-off events. [2023-01-28 06:49:03,059 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-01-28 06:49:03,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25143 conditions, 12507 events. 9255/12507 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 66278 event pairs, 1807 based on Foata normal form. 432/11555 useless extension candidates. Maximal degree in co-relation 25131. Up to 10761 conditions per place. [2023-01-28 06:49:03,111 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-01-28 06:49:03,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 209 flow [2023-01-28 06:49:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:49:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:49:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-01-28 06:49:03,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314009661835749 [2023-01-28 06:49:03,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-01-28 06:49:03,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-01-28 06:49:03,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:03,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-01-28 06:49:03,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:03,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:03,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:03,138 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 440 transitions. [2023-01-28 06:49:03,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 209 flow [2023-01-28 06:49:03,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:49:03,144 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 76 flow [2023-01-28 06:49:03,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-01-28 06:49:03,149 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-01-28 06:49:03,150 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2023-01-28 06:49:03,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:03,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:03,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:03,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:49:03,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:03,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1330532711, now seen corresponding path program 1 times [2023-01-28 06:49:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052325863] [2023-01-28 06:49:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052325863] [2023-01-28 06:49:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052325863] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:03,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:03,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:49:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114000962] [2023-01-28 06:49:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:03,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:49:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:03,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:49:03,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:49:03,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 276 [2023-01-28 06:49:03,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:03,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:03,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 276 [2023-01-28 06:49:03,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:04,295 INFO L130 PetriNetUnfolder]: 7689/10893 cut-off events. [2023-01-28 06:49:04,295 INFO L131 PetriNetUnfolder]: For 435/435 co-relation queries the response was YES. [2023-01-28 06:49:04,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21901 conditions, 10893 events. 7689/10893 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 61268 event pairs, 1425 based on Foata normal form. 0/10169 useless extension candidates. Maximal degree in co-relation 21891. Up to 8281 conditions per place. [2023-01-28 06:49:04,339 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 38 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-01-28 06:49:04,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 196 flow [2023-01-28 06:49:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:49:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:49:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-01-28 06:49:04,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2023-01-28 06:49:04,341 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-01-28 06:49:04,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-01-28 06:49:04,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:04,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-01-28 06:49:04,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:04,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:04,344 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:04,344 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 3 states and 435 transitions. [2023-01-28 06:49:04,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 196 flow [2023-01-28 06:49:04,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:04,346 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-01-28 06:49:04,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-01-28 06:49:04,347 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-01-28 06:49:04,347 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-01-28 06:49:04,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:04,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:04,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:49:04,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:04,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 356018065, now seen corresponding path program 1 times [2023-01-28 06:49:04,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:04,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808191296] [2023-01-28 06:49:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:04,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808191296] [2023-01-28 06:49:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808191296] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:04,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:04,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:49:04,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320247351] [2023-01-28 06:49:04,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:04,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:04,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:04,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:04,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 276 [2023-01-28 06:49:04,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:04,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:04,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 276 [2023-01-28 06:49:04,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:06,636 INFO L130 PetriNetUnfolder]: 15385/20954 cut-off events. [2023-01-28 06:49:06,636 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2023-01-28 06:49:06,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42682 conditions, 20954 events. 15385/20954 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 106489 event pairs, 3197 based on Foata normal form. 960/21914 useless extension candidates. Maximal degree in co-relation 42672. Up to 11321 conditions per place. [2023-01-28 06:49:06,766 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 47 selfloop transitions, 12 changer transitions 44/103 dead transitions. [2023-01-28 06:49:06,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 103 transitions, 426 flow [2023-01-28 06:49:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:49:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:49:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions. [2023-01-28 06:49:06,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-01-28 06:49:06,769 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions. [2023-01-28 06:49:06,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions. [2023-01-28 06:49:06,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:06,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions. [2023-01-28 06:49:06,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:06,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:06,774 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:06,774 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 7 states and 897 transitions. [2023-01-28 06:49:06,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 103 transitions, 426 flow [2023-01-28 06:49:06,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 103 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:06,782 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 182 flow [2023-01-28 06:49:06,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-01-28 06:49:06,783 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-01-28 06:49:06,785 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 182 flow [2023-01-28 06:49:06,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:06,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:06,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:06,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:49:06,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:06,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1346434484, now seen corresponding path program 1 times [2023-01-28 06:49:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:06,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988099673] [2023-01-28 06:49:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988099673] [2023-01-28 06:49:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988099673] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:07,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:07,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:07,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033081593] [2023-01-28 06:49:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:07,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:49:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:07,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:49:07,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:49:07,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 276 [2023-01-28 06:49:07,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:07,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:07,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 276 [2023-01-28 06:49:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:09,027 INFO L130 PetriNetUnfolder]: 14347/19678 cut-off events. [2023-01-28 06:49:09,027 INFO L131 PetriNetUnfolder]: For 20384/20384 co-relation queries the response was YES. [2023-01-28 06:49:09,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62270 conditions, 19678 events. 14347/19678 cut-off events. For 20384/20384 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 101723 event pairs, 3939 based on Foata normal form. 726/20404 useless extension candidates. Maximal degree in co-relation 62254. Up to 16863 conditions per place. [2023-01-28 06:49:09,097 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 65 selfloop transitions, 17 changer transitions 48/130 dead transitions. [2023-01-28 06:49:09,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 130 transitions, 880 flow [2023-01-28 06:49:09,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:49:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:49:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2023-01-28 06:49:09,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4694616977225673 [2023-01-28 06:49:09,099 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2023-01-28 06:49:09,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2023-01-28 06:49:09,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:09,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2023-01-28 06:49:09,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:09,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:09,104 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:09,104 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 182 flow. Second operand 7 states and 907 transitions. [2023-01-28 06:49:09,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 130 transitions, 880 flow [2023-01-28 06:49:09,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 130 transitions, 872 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:09,189 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 361 flow [2023-01-28 06:49:09,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-01-28 06:49:09,190 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2023-01-28 06:49:09,190 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 361 flow [2023-01-28 06:49:09,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:09,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:09,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:09,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:49:09,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:09,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1210186592, now seen corresponding path program 1 times [2023-01-28 06:49:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771581047] [2023-01-28 06:49:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:09,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771581047] [2023-01-28 06:49:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771581047] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:49:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110776471] [2023-01-28 06:49:09,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:09,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:09,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 276 [2023-01-28 06:49:09,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:09,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:09,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 276 [2023-01-28 06:49:09,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:11,638 INFO L130 PetriNetUnfolder]: 14910/20481 cut-off events. [2023-01-28 06:49:11,639 INFO L131 PetriNetUnfolder]: For 41408/41408 co-relation queries the response was YES. [2023-01-28 06:49:11,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76009 conditions, 20481 events. 14910/20481 cut-off events. For 41408/41408 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 107639 event pairs, 2501 based on Foata normal form. 654/21135 useless extension candidates. Maximal degree in co-relation 75988. Up to 14081 conditions per place. [2023-01-28 06:49:11,740 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 70 selfloop transitions, 35 changer transitions 40/145 dead transitions. [2023-01-28 06:49:11,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 145 transitions, 1143 flow [2023-01-28 06:49:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:49:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:49:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 906 transitions. [2023-01-28 06:49:11,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468944099378882 [2023-01-28 06:49:11,742 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 906 transitions. [2023-01-28 06:49:11,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 906 transitions. [2023-01-28 06:49:11,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:11,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 906 transitions. [2023-01-28 06:49:11,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:11,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:11,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:11,747 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 361 flow. Second operand 7 states and 906 transitions. [2023-01-28 06:49:11,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 145 transitions, 1143 flow [2023-01-28 06:49:11,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 145 transitions, 1123 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:11,809 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 599 flow [2023-01-28 06:49:11,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=599, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2023-01-28 06:49:11,810 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 16 predicate places. [2023-01-28 06:49:11,810 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 599 flow [2023-01-28 06:49:11,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:11,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:11,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:49:11,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:11,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1117555465, now seen corresponding path program 1 times [2023-01-28 06:49:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:11,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733168306] [2023-01-28 06:49:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:12,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:12,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733168306] [2023-01-28 06:49:12,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733168306] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:12,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:49:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275191583] [2023-01-28 06:49:12,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:12,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:12,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:12,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 276 [2023-01-28 06:49:12,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:12,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:12,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 276 [2023-01-28 06:49:12,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:14,122 INFO L130 PetriNetUnfolder]: 13749/18890 cut-off events. [2023-01-28 06:49:14,123 INFO L131 PetriNetUnfolder]: For 62744/62744 co-relation queries the response was YES. [2023-01-28 06:49:14,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81746 conditions, 18890 events. 13749/18890 cut-off events. For 62744/62744 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 97779 event pairs, 2373 based on Foata normal form. 608/19498 useless extension candidates. Maximal degree in co-relation 81720. Up to 10017 conditions per place. [2023-01-28 06:49:14,401 INFO L137 encePairwiseOnDemand]: 263/276 looper letters, 89 selfloop transitions, 21 changer transitions 41/151 dead transitions. [2023-01-28 06:49:14,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 151 transitions, 1455 flow [2023-01-28 06:49:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:49:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:49:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2023-01-28 06:49:14,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46221532091097306 [2023-01-28 06:49:14,408 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2023-01-28 06:49:14,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2023-01-28 06:49:14,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:14,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2023-01-28 06:49:14,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:14,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:14,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:14,415 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 599 flow. Second operand 7 states and 893 transitions. [2023-01-28 06:49:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 151 transitions, 1455 flow [2023-01-28 06:49:14,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 151 transitions, 1443 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 06:49:14,496 INFO L231 Difference]: Finished difference. Result has 68 places, 84 transitions, 851 flow [2023-01-28 06:49:14,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=851, PETRI_PLACES=68, PETRI_TRANSITIONS=84} [2023-01-28 06:49:14,497 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-01-28 06:49:14,497 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 84 transitions, 851 flow [2023-01-28 06:49:14,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:14,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:14,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:14,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:49:14,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:14,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1308648227, now seen corresponding path program 1 times [2023-01-28 06:49:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861457205] [2023-01-28 06:49:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:14,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861457205] [2023-01-28 06:49:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861457205] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:14,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:14,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:49:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435058394] [2023-01-28 06:49:14,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:14,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:49:14,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:49:14,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:49:14,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-01-28 06:49:14,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 84 transitions, 851 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:14,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:14,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-01-28 06:49:14,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:15,698 INFO L130 PetriNetUnfolder]: 6849/9848 cut-off events. [2023-01-28 06:49:15,698 INFO L131 PetriNetUnfolder]: For 49682/50805 co-relation queries the response was YES. [2023-01-28 06:49:15,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46615 conditions, 9848 events. 6849/9848 cut-off events. For 49682/50805 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 52996 event pairs, 1354 based on Foata normal form. 657/10274 useless extension candidates. Maximal degree in co-relation 46584. Up to 8042 conditions per place. [2023-01-28 06:49:15,770 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 120 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2023-01-28 06:49:15,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 140 transitions, 1643 flow [2023-01-28 06:49:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:49:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:49:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-01-28 06:49:15,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096618357487923 [2023-01-28 06:49:15,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-01-28 06:49:15,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-01-28 06:49:15,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:15,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-01-28 06:49:15,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:15,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:15,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:15,774 INFO L175 Difference]: Start difference. First operand has 68 places, 84 transitions, 851 flow. Second operand 3 states and 422 transitions. [2023-01-28 06:49:15,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 140 transitions, 1643 flow [2023-01-28 06:49:15,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 140 transitions, 1608 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:15,819 INFO L231 Difference]: Finished difference. Result has 66 places, 88 transitions, 860 flow [2023-01-28 06:49:15,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=66, PETRI_TRANSITIONS=88} [2023-01-28 06:49:15,820 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2023-01-28 06:49:15,820 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 88 transitions, 860 flow [2023-01-28 06:49:15,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:15,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:15,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:15,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:49:15,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:15,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1394682624, now seen corresponding path program 1 times [2023-01-28 06:49:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:15,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132229642] [2023-01-28 06:49:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132229642] [2023-01-28 06:49:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132229642] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779766065] [2023-01-28 06:49:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:16,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 276 [2023-01-28 06:49:16,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 88 transitions, 860 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:16,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:16,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 276 [2023-01-28 06:49:16,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:17,700 INFO L130 PetriNetUnfolder]: 10208/14633 cut-off events. [2023-01-28 06:49:17,701 INFO L131 PetriNetUnfolder]: For 52603/52603 co-relation queries the response was YES. [2023-01-28 06:49:17,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70603 conditions, 14633 events. 10208/14633 cut-off events. For 52603/52603 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 78361 event pairs, 2950 based on Foata normal form. 216/14849 useless extension candidates. Maximal degree in co-relation 70571. Up to 7193 conditions per place. [2023-01-28 06:49:17,769 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 95 selfloop transitions, 15 changer transitions 46/156 dead transitions. [2023-01-28 06:49:17,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 156 transitions, 1620 flow [2023-01-28 06:49:17,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:49:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:49:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-01-28 06:49:17,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46195652173913043 [2023-01-28 06:49:17,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-01-28 06:49:17,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-01-28 06:49:17,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:17,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-01-28 06:49:17,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:17,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:17,774 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:17,774 INFO L175 Difference]: Start difference. First operand has 66 places, 88 transitions, 860 flow. Second operand 6 states and 765 transitions. [2023-01-28 06:49:17,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 156 transitions, 1620 flow [2023-01-28 06:49:17,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 156 transitions, 1603 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 06:49:17,807 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 756 flow [2023-01-28 06:49:17,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=756, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2023-01-28 06:49:17,808 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-01-28 06:49:17,808 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 756 flow [2023-01-28 06:49:17,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:17,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:17,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:17,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:49:17,808 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:17,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -242085473, now seen corresponding path program 1 times [2023-01-28 06:49:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:17,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312948046] [2023-01-28 06:49:17,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312948046] [2023-01-28 06:49:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312948046] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:49:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504044951] [2023-01-28 06:49:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:17,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:49:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:49:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:49:17,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-01-28 06:49:17,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 76 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:17,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:17,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-01-28 06:49:17,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:18,549 INFO L130 PetriNetUnfolder]: 3375/5246 cut-off events. [2023-01-28 06:49:18,549 INFO L131 PetriNetUnfolder]: For 22345/22806 co-relation queries the response was YES. [2023-01-28 06:49:18,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25536 conditions, 5246 events. 3375/5246 cut-off events. For 22345/22806 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 28471 event pairs, 625 based on Foata normal form. 566/5733 useless extension candidates. Maximal degree in co-relation 25501. Up to 2610 conditions per place. [2023-01-28 06:49:18,571 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 124 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-01-28 06:49:18,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 145 transitions, 1676 flow [2023-01-28 06:49:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:49:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:49:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-01-28 06:49:18,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117753623188406 [2023-01-28 06:49:18,573 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-01-28 06:49:18,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-01-28 06:49:18,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:18,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-01-28 06:49:18,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:18,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:18,576 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:18,576 INFO L175 Difference]: Start difference. First operand has 72 places, 76 transitions, 756 flow. Second operand 4 states and 565 transitions. [2023-01-28 06:49:18,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 145 transitions, 1676 flow [2023-01-28 06:49:18,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 145 transitions, 1620 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-01-28 06:49:18,587 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 746 flow [2023-01-28 06:49:18,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=746, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2023-01-28 06:49:18,588 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2023-01-28 06:49:18,588 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 78 transitions, 746 flow [2023-01-28 06:49:18,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:18,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:18,588 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-01-28 06:49:18,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:49:18,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:18,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1858921483, now seen corresponding path program 1 times [2023-01-28 06:49:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:18,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106287445] [2023-01-28 06:49:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106287445] [2023-01-28 06:49:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106287445] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801028792] [2023-01-28 06:49:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:18,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:18,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-01-28 06:49:18,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 78 transitions, 746 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:18,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:18,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-01-28 06:49:18,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:19,235 INFO L130 PetriNetUnfolder]: 2453/3821 cut-off events. [2023-01-28 06:49:19,235 INFO L131 PetriNetUnfolder]: For 17236/17580 co-relation queries the response was YES. [2023-01-28 06:49:19,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19809 conditions, 3821 events. 2453/3821 cut-off events. For 17236/17580 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19960 event pairs, 456 based on Foata normal form. 343/4104 useless extension candidates. Maximal degree in co-relation 19773. Up to 1811 conditions per place. [2023-01-28 06:49:19,256 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 135 selfloop transitions, 13 changer transitions 4/164 dead transitions. [2023-01-28 06:49:19,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 164 transitions, 1855 flow [2023-01-28 06:49:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-01-28 06:49:19,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115942028985507 [2023-01-28 06:49:19,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-01-28 06:49:19,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-01-28 06:49:19,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:19,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-01-28 06:49:19,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,261 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,261 INFO L175 Difference]: Start difference. First operand has 72 places, 78 transitions, 746 flow. Second operand 5 states and 706 transitions. [2023-01-28 06:49:19,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 164 transitions, 1855 flow [2023-01-28 06:49:19,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 164 transitions, 1825 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 06:49:19,280 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 764 flow [2023-01-28 06:49:19,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=764, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2023-01-28 06:49:19,280 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-01-28 06:49:19,281 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 764 flow [2023-01-28 06:49:19,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:19,281 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-01-28 06:49:19,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:49:19,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:19,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 977347383, now seen corresponding path program 1 times [2023-01-28 06:49:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500788344] [2023-01-28 06:49:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500788344] [2023-01-28 06:49:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500788344] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:49:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729774454] [2023-01-28 06:49:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:19,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:49:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:49:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:49:19,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-01-28 06:49:19,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 764 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:19,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-01-28 06:49:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:19,941 INFO L130 PetriNetUnfolder]: 2360/3635 cut-off events. [2023-01-28 06:49:19,941 INFO L131 PetriNetUnfolder]: For 17171/17502 co-relation queries the response was YES. [2023-01-28 06:49:19,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18995 conditions, 3635 events. 2360/3635 cut-off events. For 17171/17502 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18927 event pairs, 444 based on Foata normal form. 199/3775 useless extension candidates. Maximal degree in co-relation 18959. Up to 1718 conditions per place. [2023-01-28 06:49:19,956 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 122 selfloop transitions, 17 changer transitions 14/164 dead transitions. [2023-01-28 06:49:19,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 164 transitions, 1869 flow [2023-01-28 06:49:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:49:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:49:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions. [2023-01-28 06:49:19,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018115942028986 [2023-01-28 06:49:19,958 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 831 transitions. [2023-01-28 06:49:19,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions. [2023-01-28 06:49:19,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:19,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions. [2023-01-28 06:49:19,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,961 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:19,961 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 764 flow. Second operand 6 states and 831 transitions. [2023-01-28 06:49:19,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 164 transitions, 1869 flow [2023-01-28 06:49:19,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 164 transitions, 1754 flow, removed 37 selfloop flow, removed 6 redundant places. [2023-01-28 06:49:20,000 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 667 flow [2023-01-28 06:49:20,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=667, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2023-01-28 06:49:20,001 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2023-01-28 06:49:20,001 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 667 flow [2023-01-28 06:49:20,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:20,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:20,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:49:20,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:20,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1285817266, now seen corresponding path program 1 times [2023-01-28 06:49:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70242309] [2023-01-28 06:49:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:20,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:20,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70242309] [2023-01-28 06:49:20,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70242309] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:20,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:49:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347813929] [2023-01-28 06:49:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:49:20,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:49:20,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:49:20,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 276 [2023-01-28 06:49:20,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 667 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:20,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:20,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 276 [2023-01-28 06:49:20,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:20,602 INFO L130 PetriNetUnfolder]: 1599/2530 cut-off events. [2023-01-28 06:49:20,602 INFO L131 PetriNetUnfolder]: For 11848/11871 co-relation queries the response was YES. [2023-01-28 06:49:20,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13612 conditions, 2530 events. 1599/2530 cut-off events. For 11848/11871 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12099 event pairs, 279 based on Foata normal form. 21/2551 useless extension candidates. Maximal degree in co-relation 13578. Up to 1648 conditions per place. [2023-01-28 06:49:20,611 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 66 selfloop transitions, 1 changer transitions 67/138 dead transitions. [2023-01-28 06:49:20,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 1470 flow [2023-01-28 06:49:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:49:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:49:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-01-28 06:49:20,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49492753623188407 [2023-01-28 06:49:20,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-01-28 06:49:20,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-01-28 06:49:20,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:20,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-01-28 06:49:20,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:20,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:20,616 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:20,617 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 667 flow. Second operand 5 states and 683 transitions. [2023-01-28 06:49:20,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 1470 flow [2023-01-28 06:49:20,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 138 transitions, 1271 flow, removed 61 selfloop flow, removed 8 redundant places. [2023-01-28 06:49:20,642 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 430 flow [2023-01-28 06:49:20,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-01-28 06:49:20,642 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2023-01-28 06:49:20,642 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 430 flow [2023-01-28 06:49:20,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:20,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:20,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:20,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:49:20,643 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:20,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1241074676, now seen corresponding path program 2 times [2023-01-28 06:49:20,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:20,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101993711] [2023-01-28 06:49:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101993711] [2023-01-28 06:49:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101993711] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:21,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:49:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070456140] [2023-01-28 06:49:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:21,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:49:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:49:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:49:21,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 276 [2023-01-28 06:49:21,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 430 flow. Second operand has 8 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:21,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:21,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 276 [2023-01-28 06:49:21,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:21,813 INFO L130 PetriNetUnfolder]: 776/1283 cut-off events. [2023-01-28 06:49:21,814 INFO L131 PetriNetUnfolder]: For 3567/3577 co-relation queries the response was YES. [2023-01-28 06:49:21,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 1283 events. 776/1283 cut-off events. For 3567/3577 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5711 event pairs, 130 based on Foata normal form. 5/1283 useless extension candidates. Maximal degree in co-relation 5705. Up to 888 conditions per place. [2023-01-28 06:49:21,818 INFO L137 encePairwiseOnDemand]: 268/276 looper letters, 81 selfloop transitions, 11 changer transitions 7/102 dead transitions. [2023-01-28 06:49:21,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 872 flow [2023-01-28 06:49:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:49:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:49:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2023-01-28 06:49:21,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46256038647342995 [2023-01-28 06:49:21,820 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2023-01-28 06:49:21,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2023-01-28 06:49:21,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:21,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2023-01-28 06:49:21,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:21,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:21,823 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:21,824 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 430 flow. Second operand 6 states and 766 transitions. [2023-01-28 06:49:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 872 flow [2023-01-28 06:49:21,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 827 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-01-28 06:49:21,831 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 464 flow [2023-01-28 06:49:21,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-01-28 06:49:21,831 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2023-01-28 06:49:21,831 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 464 flow [2023-01-28 06:49:21,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:21,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:21,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:21,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:49:21,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:21,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1381040428, now seen corresponding path program 3 times [2023-01-28 06:49:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:21,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280312373] [2023-01-28 06:49:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:21,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280312373] [2023-01-28 06:49:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280312373] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:22,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:22,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 06:49:22,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933335164] [2023-01-28 06:49:22,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:22,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 06:49:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:22,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 06:49:22,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-01-28 06:49:22,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 276 [2023-01-28 06:49:22,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 464 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:22,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:22,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 276 [2023-01-28 06:49:22,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:23,237 INFO L130 PetriNetUnfolder]: 911/1509 cut-off events. [2023-01-28 06:49:23,237 INFO L131 PetriNetUnfolder]: For 4252/4252 co-relation queries the response was YES. [2023-01-28 06:49:23,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7186 conditions, 1509 events. 911/1509 cut-off events. For 4252/4252 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6876 event pairs, 144 based on Foata normal form. 1/1510 useless extension candidates. Maximal degree in co-relation 7161. Up to 863 conditions per place. [2023-01-28 06:49:23,243 INFO L137 encePairwiseOnDemand]: 265/276 looper letters, 83 selfloop transitions, 23 changer transitions 19/125 dead transitions. [2023-01-28 06:49:23,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 125 transitions, 1075 flow [2023-01-28 06:49:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:49:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:49:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 967 transitions. [2023-01-28 06:49:23,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4379528985507246 [2023-01-28 06:49:23,245 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 967 transitions. [2023-01-28 06:49:23,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 967 transitions. [2023-01-28 06:49:23,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:23,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 967 transitions. [2023-01-28 06:49:23,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.875) internal successors, (967), 8 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:23,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:23,249 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:23,249 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 464 flow. Second operand 8 states and 967 transitions. [2023-01-28 06:49:23,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 125 transitions, 1075 flow [2023-01-28 06:49:23,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1057 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-28 06:49:23,259 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 607 flow [2023-01-28 06:49:23,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2023-01-28 06:49:23,259 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2023-01-28 06:49:23,260 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 607 flow [2023-01-28 06:49:23,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:23,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:23,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:23,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:49:23,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:23,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1610593856, now seen corresponding path program 4 times [2023-01-28 06:49:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056782817] [2023-01-28 06:49:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:49:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:49:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:49:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056782817] [2023-01-28 06:49:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056782817] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:49:24,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:49:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:49:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671665943] [2023-01-28 06:49:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:49:24,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:49:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:49:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:49:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:49:24,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 276 [2023-01-28 06:49:24,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 607 flow. Second operand has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:49:24,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 276 [2023-01-28 06:49:24,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:49:24,573 INFO L130 PetriNetUnfolder]: 1001/1704 cut-off events. [2023-01-28 06:49:24,573 INFO L131 PetriNetUnfolder]: For 7418/7442 co-relation queries the response was YES. [2023-01-28 06:49:24,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8871 conditions, 1704 events. 1001/1704 cut-off events. For 7418/7442 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8505 event pairs, 153 based on Foata normal form. 15/1706 useless extension candidates. Maximal degree in co-relation 8843. Up to 773 conditions per place. [2023-01-28 06:49:24,579 INFO L137 encePairwiseOnDemand]: 268/276 looper letters, 67 selfloop transitions, 9 changer transitions 49/131 dead transitions. [2023-01-28 06:49:24,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 1357 flow [2023-01-28 06:49:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:49:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:49:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-01-28 06:49:24,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45893719806763283 [2023-01-28 06:49:24,581 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-01-28 06:49:24,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-01-28 06:49:24,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:49:24,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-01-28 06:49:24,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,585 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 276.0) internal successors, (2760), 10 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,585 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 607 flow. Second operand 9 states and 1140 transitions. [2023-01-28 06:49:24,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 1357 flow [2023-01-28 06:49:24,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 1321 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-28 06:49:24,601 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 537 flow [2023-01-28 06:49:24,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=537, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2023-01-28 06:49:24,601 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2023-01-28 06:49:24,601 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 537 flow [2023-01-28 06:49:24,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:49:24,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:49:24,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:24,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:49:24,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:49:24,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:49:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash 930913124, now seen corresponding path program 5 times [2023-01-28 06:49:24,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:49:24,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127230581] [2023-01-28 06:49:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:49:24,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:49:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:49:24,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:49:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:49:24,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:49:24,803 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:49:24,805 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-01-28 06:49:24,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-01-28 06:49:24,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:49:24,807 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:49:24,811 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:49:24,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:49:24,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:49:24 BasicIcfg [2023-01-28 06:49:24,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:49:24,874 INFO L158 Benchmark]: Toolchain (without parser) took 29056.28ms. Allocated memory was 381.7MB in the beginning and 2.9GB in the end (delta: 2.5GB). Free memory was 338.7MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 784.7MB. Max. memory is 16.0GB. [2023-01-28 06:49:24,874 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:49:24,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.22ms. Allocated memory is still 381.7MB. Free memory was 338.4MB in the beginning and 310.1MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 06:49:24,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.93ms. Allocated memory is still 381.7MB. Free memory was 310.1MB in the beginning and 306.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:49:24,874 INFO L158 Benchmark]: Boogie Preprocessor took 48.56ms. Allocated memory is still 381.7MB. Free memory was 306.2MB in the beginning and 303.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:49:24,874 INFO L158 Benchmark]: RCFGBuilder took 686.38ms. Allocated memory is still 381.7MB. Free memory was 303.4MB in the beginning and 312.6MB in the end (delta: -9.1MB). Peak memory consumption was 37.8MB. Max. memory is 16.0GB. [2023-01-28 06:49:24,874 INFO L158 Benchmark]: TraceAbstraction took 27862.33ms. Allocated memory was 381.7MB in the beginning and 2.9GB in the end (delta: 2.5GB). Free memory was 312.2MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 757.4MB. Max. memory is 16.0GB. [2023-01-28 06:49:24,875 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 382.22ms. Allocated memory is still 381.7MB. Free memory was 338.4MB in the beginning and 310.1MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.93ms. Allocated memory is still 381.7MB. Free memory was 310.1MB in the beginning and 306.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.56ms. Allocated memory is still 381.7MB. Free memory was 306.2MB in the beginning and 303.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 686.38ms. Allocated memory is still 381.7MB. Free memory was 303.4MB in the beginning and 312.6MB in the end (delta: -9.1MB). Peak memory consumption was 37.8MB. Max. memory is 16.0GB. * TraceAbstraction took 27862.33ms. Allocated memory was 381.7MB in the beginning and 2.9GB in the end (delta: 2.5GB). Free memory was 312.2MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 757.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 157 PlacesBefore, 46 PlacesAfterwards, 146 TransitionsBefore, 34 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 9605 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3780, independent: 3527, independent conditional: 0, independent unconditional: 3527, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1706, independent: 1661, independent conditional: 0, independent unconditional: 1661, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3780, independent: 1866, independent conditional: 0, independent unconditional: 1866, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1706, unknown conditional: 0, unknown unconditional: 1706] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L923] 0 pthread_t t233; [L924] FCALL, FORK 0 pthread_create(&t233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t233, ((void *)0), P0, ((void *)0))=-3, t233={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z$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] [L925] 0 pthread_t t234; [L926] FCALL, FORK 0 pthread_create(&t234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t234, ((void *)0), P1, ((void *)0))=-2, t233={5:0}, t234={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z$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] [L927] 0 pthread_t t235; [L928] FCALL, FORK 0 pthread_create(&t235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t235, ((void *)0), P2, ((void *)0))=-1, t233={5:0}, t234={6:0}, t235={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z$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] [L929] 0 pthread_t t236; [L805] 3 y$w_buff1 = y$w_buff0 [L806] 3 y$w_buff0 = 2 [L807] 3 y$w_buff1_used = y$w_buff0_used [L808] 3 y$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L810] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L811] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L812] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L813] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L814] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L815] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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] [L930] FCALL, FORK 0 pthread_create(&t236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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(&t236, ((void *)0), P3, ((void *)0))=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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] [L818] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 3 y$flush_delayed = weak$$choice2 [L821] 3 y$mem_tmp = y [L822] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L823] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L824] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L825] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L826] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L828] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L829] 3 __unbuffered_p2_EAX = y [L830] 3 y = y$flush_delayed ? y$mem_tmp : y [L831] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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] [L834] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 3 z$flush_delayed = weak$$choice2 [L837] 3 z$mem_tmp = z [L838] 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) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 3 __unbuffered_p2_EBX = z [L846] 3 z = z$flush_delayed ? z$mem_tmp : z [L847] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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] [L864] 4 z$w_buff1 = z$w_buff0 [L865] 4 z$w_buff0 = 1 [L866] 4 z$w_buff1_used = z$w_buff0_used [L867] 4 z$w_buff0_used = (_Bool)1 [L868] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L868] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L869] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L870] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L871] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L872] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L873] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L874] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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] [L877] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L878] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L879] 4 z$flush_delayed = weak$$choice2 [L880] 4 z$mem_tmp = z [L881] 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) [L882] 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)) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 4 __unbuffered_p3_EAX = z [L889] 4 z = z$flush_delayed ? z$mem_tmp : z [L890] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L785] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, 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] [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, 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] [L850] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L851] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L852] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L854] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L896] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L897] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L898] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L899] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L900] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L901] 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) [L902] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L903] 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 [L904] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L905] 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_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L908] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L910] 4 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L857] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L859] 3 return 0; [L932] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L934] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L934] RET 0 assume_abort_if_not(main$tmp_guard0) [L936] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L937] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L938] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L939] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L940] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L941] 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) [L942] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L943] 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 [L944] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L945] 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}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L948] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L949] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L950] 0 y$flush_delayed = weak$$choice2 [L951] 0 y$mem_tmp = y [L952] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L953] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L954] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L955] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L956] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L957] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L958] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L959] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L960] 0 y = y$flush_delayed ? y$mem_tmp : y [L961] 0 y$flush_delayed = (_Bool)0 [L963] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 926]: 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: 928]: 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: 924]: 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: 930]: 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, 188 locations, 9 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: 27.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2089 IncrementalHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 45 mSDtfsCounter, 2089 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=7, InterpolantAutomatonStates: 86, 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.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 2742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-01-28 06:49:24,910 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...