/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_rmo_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:24:14,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:24:14,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:24:14,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:24:14,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:24:14,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:24:14,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:24:14,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:24:14,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:24:14,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:24:14,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:24:14,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:24:14,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:24:14,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:24:14,543 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:24:14,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:24:14,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:24:14,544 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:24:14,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:24:14,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:24:14,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:24:14,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:24:14,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:24:14,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:24:14,546 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:24:14,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:24:14,547 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:24:14,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:24:14,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:24:14,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:24:14,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:14,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:24:14,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:24:14,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:24:14,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:24:14,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:24:14,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:24:14,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:24:14,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:24:14,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:24:14,550 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:24:14,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 07:24:14,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:24:14,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:24:14,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:24:14,735 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:24:14,738 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:24:14,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_rmo_bound2.i [2023-08-04 07:24:15,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:24:16,100 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:24:16,101 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_rmo_bound2.i [2023-08-04 07:24:16,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da810801/1d10cf6090334a6d95b2e83f64a72037/FLAG6a2326727 [2023-08-04 07:24:16,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da810801/1d10cf6090334a6d95b2e83f64a72037 [2023-08-04 07:24:16,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:24:16,141 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:24:16,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:16,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:24:16,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:24:16,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297616b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16, skipping insertion in model container [2023-08-04 07:24:16,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,194 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:24:16,309 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_rmo_bound2.i[988,1001] [2023-08-04 07:24:16,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:16,496 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:24:16,512 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe028_rmo_bound2.i[988,1001] [2023-08-04 07:24:16,522 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 07:24:16,528 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 07:24:16,575 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:24:16,600 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:16,601 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:24:16,607 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:24:16,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16 WrapperNode [2023-08-04 07:24:16,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:24:16,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:16,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:24:16,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:24:16,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,683 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2023-08-04 07:24:16,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:24:16,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:24:16,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:24:16,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:24:16,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:24:16,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:24:16,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:24:16,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:24:16,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (1/1) ... [2023-08-04 07:24:16,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:24:16,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:16,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 07:24:16,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:24:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:24:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:24:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:24:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:24:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 07:24:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 07:24:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:24:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:24:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:24:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:24:16,809 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 07:24:16,935 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:24:16,936 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:24:17,320 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:24:17,551 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:24:17,552 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 07:24:17,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:24:17 BoogieIcfgContainer [2023-08-04 07:24:17,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:24:17,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:24:17,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:24:17,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:24:17,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:24:16" (1/3) ... [2023-08-04 07:24:17,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2cd13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:24:17, skipping insertion in model container [2023-08-04 07:24:17,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:24:16" (2/3) ... [2023-08-04 07:24:17,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2cd13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:24:17, skipping insertion in model container [2023-08-04 07:24:17,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:24:17" (3/3) ... [2023-08-04 07:24:17,565 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe028_rmo_bound2.i [2023-08-04 07:24:17,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:24:17,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:24:17,578 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 07:24:17,578 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:24:17,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:24:17,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 145 transitions, 305 flow [2023-08-04 07:24:17,826 INFO L124 PetriNetUnfolderBase]: 30/463 cut-off events. [2023-08-04 07:24:17,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:17,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 463 events. 30/463 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1921 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. [2023-08-04 07:24:17,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 145 transitions, 305 flow [2023-08-04 07:24:17,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 130 transitions, 269 flow [2023-08-04 07:24:17,842 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:17,860 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 130 transitions, 269 flow [2023-08-04 07:24:17,862 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 130 transitions, 269 flow [2023-08-04 07:24:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 130 transitions, 269 flow [2023-08-04 07:24:17,914 INFO L124 PetriNetUnfolderBase]: 22/360 cut-off events. [2023-08-04 07:24:17,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:17,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 360 events. 22/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1316 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 230. Up to 16 conditions per place. [2023-08-04 07:24:17,921 INFO L119 LiptonReduction]: Number of co-enabled transitions 1732 [2023-08-04 07:24:22,846 INFO L134 LiptonReduction]: Checked pairs total: 4393 [2023-08-04 07:24:22,847 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-04 07:24:22,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:24:22,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e13901, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:22,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:24:22,871 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:22,871 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-08-04 07:24:22,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:22,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:22,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:22,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:22,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash 587029327, now seen corresponding path program 1 times [2023-08-04 07:24:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841698085] [2023-08-04 07:24:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:22,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:24:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:23,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841698085] [2023-08-04 07:24:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841698085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:23,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:23,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851821480] [2023-08-04 07:24:23,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:23,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:23,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:23,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:23,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 255 [2023-08-04 07:24:23,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:23,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:23,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 255 [2023-08-04 07:24:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:23,700 INFO L124 PetriNetUnfolderBase]: 1545/2507 cut-off events. [2023-08-04 07:24:23,700 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:24:23,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 2507 events. 1545/2507 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12490 event pairs, 912 based on Foata normal form. 100/2339 useless extension candidates. Maximal degree in co-relation 4944. Up to 2390 conditions per place. [2023-08-04 07:24:23,714 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 26 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-04 07:24:23,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 131 flow [2023-08-04 07:24:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-04 07:24:23,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5359477124183006 [2023-08-04 07:24:23,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-04 07:24:23,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-04 07:24:23,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:23,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-04 07:24:23,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:23,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:23,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:23,740 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 65 flow. Second operand 3 states and 410 transitions. [2023-08-04 07:24:23,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 131 flow [2023-08-04 07:24:23,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:23,743 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 69 flow [2023-08-04 07:24:23,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-08-04 07:24:23,747 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 07:24:23,748 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 69 flow [2023-08-04 07:24:23,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:23,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:23,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:23,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:24:23,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:23,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -298118653, now seen corresponding path program 1 times [2023-08-04 07:24:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:23,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921912264] [2023-08-04 07:24:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:24:23,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:23,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921912264] [2023-08-04 07:24:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921912264] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35977129] [2023-08-04 07:24:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:23,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:23,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:23,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:24:23,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 07:24:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:23,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:24:23,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:24:23,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:24:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35977129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:24:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:24:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422935133] [2023-08-04 07:24:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:23,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:23,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:24,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 255 [2023-08-04 07:24:24,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:24,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:24,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 255 [2023-08-04 07:24:24,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:24,326 INFO L124 PetriNetUnfolderBase]: 1176/1886 cut-off events. [2023-08-04 07:24:24,327 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 07:24:24,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 1886 events. 1176/1886 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8546 event pairs, 726 based on Foata normal form. 0/1774 useless extension candidates. Maximal degree in co-relation 3722. Up to 1749 conditions per place. [2023-08-04 07:24:24,338 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 29 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2023-08-04 07:24:24,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 147 flow [2023-08-04 07:24:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-04 07:24:24,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372549019607843 [2023-08-04 07:24:24,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-04 07:24:24,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-04 07:24:24,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:24,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-04 07:24:24,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:24,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:24,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:24,351 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 69 flow. Second operand 3 states and 411 transitions. [2023-08-04 07:24:24,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 147 flow [2023-08-04 07:24:24,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:24:24,353 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 73 flow [2023-08-04 07:24:24,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-08-04 07:24:24,357 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 07:24:24,357 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 73 flow [2023-08-04 07:24:24,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:24,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:24,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:24,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 07:24:24,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:24,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:24,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 576586335, now seen corresponding path program 1 times [2023-08-04 07:24:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557430765] [2023-08-04 07:24:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:24:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557430765] [2023-08-04 07:24:24,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557430765] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084337593] [2023-08-04 07:24:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:24,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:24:24,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 07:24:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:24,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:24:24,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:24,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:24:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084337593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:24,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:24:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:24:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171935951] [2023-08-04 07:24:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:24,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:24,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 255 [2023-08-04 07:24:24,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:24,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:24,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 255 [2023-08-04 07:24:24,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:25,055 INFO L124 PetriNetUnfolderBase]: 1080/1646 cut-off events. [2023-08-04 07:24:25,055 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 07:24:25,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3386 conditions, 1646 events. 1080/1646 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7135 event pairs, 648 based on Foata normal form. 0/1582 useless extension candidates. Maximal degree in co-relation 3370. Up to 1391 conditions per place. [2023-08-04 07:24:25,065 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 32 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 07:24:25,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 163 flow [2023-08-04 07:24:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-04 07:24:25,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2023-08-04 07:24:25,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-04 07:24:25,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-04 07:24:25,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:25,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-04 07:24:25,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,070 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 73 flow. Second operand 3 states and 414 transitions. [2023-08-04 07:24:25,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 163 flow [2023-08-04 07:24:25,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 07:24:25,074 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 77 flow [2023-08-04 07:24:25,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-04 07:24:25,075 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-04 07:24:25,075 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 77 flow [2023-08-04 07:24:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:25,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:25,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 07:24:25,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 07:24:25,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:25,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1808349227, now seen corresponding path program 1 times [2023-08-04 07:24:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:25,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415922544] [2023-08-04 07:24:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:25,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:25,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:25,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415922544] [2023-08-04 07:24:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415922544] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:24:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989755261] [2023-08-04 07:24:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:25,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:25,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:24:25,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:24:25,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 07:24:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:25,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:24:25,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:24:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:25,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:24:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:24:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989755261] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:24:25,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:24:25,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:24:25,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652261779] [2023-08-04 07:24:25,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:24:25,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:24:25,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:24:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:24:25,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 255 [2023-08-04 07:24:25,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:25,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 255 [2023-08-04 07:24:25,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:25,578 INFO L124 PetriNetUnfolderBase]: 6/20 cut-off events. [2023-08-04 07:24:25,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 20 events. 6/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 4/24 useless extension candidates. Maximal degree in co-relation 46. Up to 14 conditions per place. [2023-08-04 07:24:25,578 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 07:24:25,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 11 transitions, 49 flow [2023-08-04 07:24:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:24:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:24:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-04 07:24:25,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-08-04 07:24:25,580 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-04 07:24:25,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-04 07:24:25,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:25,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-04 07:24:25,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,584 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,584 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 77 flow. Second operand 4 states and 512 transitions. [2023-08-04 07:24:25,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 11 transitions, 49 flow [2023-08-04 07:24:25,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:24:25,585 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 07:24:25,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 07:24:25,585 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -16 predicate places. [2023-08-04 07:24:25,586 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 07:24:25,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:25,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:24:25,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 07:24:25,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:24:25,795 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 07:24:25,796 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 07:24:25,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 145 transitions, 305 flow [2023-08-04 07:24:25,840 INFO L124 PetriNetUnfolderBase]: 30/463 cut-off events. [2023-08-04 07:24:25,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:25,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 463 events. 30/463 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1921 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 284. Up to 16 conditions per place. [2023-08-04 07:24:25,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 145 transitions, 305 flow [2023-08-04 07:24:25,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 116 transitions, 247 flow [2023-08-04 07:24:25,842 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:25,842 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 116 transitions, 247 flow [2023-08-04 07:24:25,846 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 116 transitions, 247 flow [2023-08-04 07:24:25,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 116 transitions, 247 flow [2023-08-04 07:24:25,864 INFO L124 PetriNetUnfolderBase]: 6/231 cut-off events. [2023-08-04 07:24:25,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:25,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 231 events. 6/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 601 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2023-08-04 07:24:25,865 INFO L119 LiptonReduction]: Number of co-enabled transitions 1160 [2023-08-04 07:24:30,061 INFO L134 LiptonReduction]: Checked pairs total: 3135 [2023-08-04 07:24:30,061 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-04 07:24:30,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:24:30,064 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e13901, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:30,064 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:24:30,067 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:30,067 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-08-04 07:24:30,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:24:30,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:30,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 07:24:30,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:24:30,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 949070166, now seen corresponding path program 1 times [2023-08-04 07:24:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19861665] [2023-08-04 07:24:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:24:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19861665] [2023-08-04 07:24:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19861665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552923339] [2023-08-04 07:24:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:30,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:30,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 242 [2023-08-04 07:24:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 242 [2023-08-04 07:24:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:24:30,265 INFO L124 PetriNetUnfolderBase]: 375/673 cut-off events. [2023-08-04 07:24:30,265 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:24:30,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 673 events. 375/673 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2847 event pairs, 192 based on Foata normal form. 0/641 useless extension candidates. Maximal degree in co-relation 1356. Up to 620 conditions per place. [2023-08-04 07:24:30,268 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 22 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-04 07:24:30,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 119 flow [2023-08-04 07:24:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:24:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:24:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-04 07:24:30,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5550964187327824 [2023-08-04 07:24:30,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-04 07:24:30,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-04 07:24:30,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:24:30,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-04 07:24:30,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:30,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:30,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:30,274 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 63 flow. Second operand 3 states and 403 transitions. [2023-08-04 07:24:30,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 119 flow [2023-08-04 07:24:30,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:24:30,275 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 71 flow [2023-08-04 07:24:30,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-04 07:24:30,279 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-04 07:24:30,279 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 71 flow [2023-08-04 07:24:30,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:30,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:30,279 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:24:30,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:24:30,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:24:30,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 939748685, now seen corresponding path program 1 times [2023-08-04 07:24:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:30,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637972346] [2023-08-04 07:24:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:30,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:24:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:24:30,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:24:30,331 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:24:30,331 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 07:24:30,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 07:24:30,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 07:24:30,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:24:30,332 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 07:24:30,332 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 07:24:30,333 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:24:30,333 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:24:30,371 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:24:30,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 167 transitions, 370 flow [2023-08-04 07:24:30,508 INFO L124 PetriNetUnfolderBase]: 93/1386 cut-off events. [2023-08-04 07:24:30,508 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:24:30,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1386 events. 93/1386 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9305 event pairs, 0 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1009. Up to 54 conditions per place. [2023-08-04 07:24:30,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 167 transitions, 370 flow [2023-08-04 07:24:30,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 152 transitions, 328 flow [2023-08-04 07:24:30,516 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:24:30,516 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 152 transitions, 328 flow [2023-08-04 07:24:30,516 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 152 transitions, 328 flow [2023-08-04 07:24:30,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 152 transitions, 328 flow [2023-08-04 07:24:30,629 INFO L124 PetriNetUnfolderBase]: 66/1049 cut-off events. [2023-08-04 07:24:30,629 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 07:24:30,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1049 events. 66/1049 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6420 event pairs, 0 based on Foata normal form. 0/944 useless extension candidates. Maximal degree in co-relation 781. Up to 54 conditions per place. [2023-08-04 07:24:30,649 INFO L119 LiptonReduction]: Number of co-enabled transitions 4296 [2023-08-04 07:24:35,797 INFO L134 LiptonReduction]: Checked pairs total: 13210 [2023-08-04 07:24:35,797 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-04 07:24:35,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:24:35,799 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e13901, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:24:35,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:24:35,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:24:35,804 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2023-08-04 07:24:35,804 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 07:24:35,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:24:35,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:24:35,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:24:35,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:24:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -24318076, now seen corresponding path program 1 times [2023-08-04 07:24:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:24:35,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935909159] [2023-08-04 07:24:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:24:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:24:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:24:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:24:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:24:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935909159] [2023-08-04 07:24:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935909159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:24:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:24:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:24:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340468892] [2023-08-04 07:24:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:24:35,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:24:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:24:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:24:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:24:35,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 283 [2023-08-04 07:24:35,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:24:35,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:24:35,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 283 [2023-08-04 07:24:35,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:17,447 INFO L124 PetriNetUnfolderBase]: 272349/353744 cut-off events. [2023-08-04 07:25:17,448 INFO L125 PetriNetUnfolderBase]: For 5396/5396 co-relation queries the response was YES. [2023-08-04 07:25:18,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703717 conditions, 353744 events. 272349/353744 cut-off events. For 5396/5396 co-relation queries the response was YES. Maximal size of possible extension queue 7759. Compared 2242425 event pairs, 218772 based on Foata normal form. 8820/341568 useless extension candidates. Maximal degree in co-relation 152161. Up to 343786 conditions per place. [2023-08-04 07:25:19,395 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 40 selfloop transitions, 2 changer transitions 1/48 dead transitions. [2023-08-04 07:25:19,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 206 flow [2023-08-04 07:25:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2023-08-04 07:25:19,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5512367491166078 [2023-08-04 07:25:19,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2023-08-04 07:25:19,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2023-08-04 07:25:19,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:19,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2023-08-04 07:25:19,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:19,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:19,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:19,401 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 112 flow. Second operand 3 states and 468 transitions. [2023-08-04 07:25:19,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 206 flow [2023-08-04 07:25:19,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 07:25:19,405 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 120 flow [2023-08-04 07:25:19,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-08-04 07:25:19,408 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-08-04 07:25:19,408 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 120 flow [2023-08-04 07:25:19,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:19,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:19,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:19,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 07:25:19,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:19,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1772652695, now seen corresponding path program 1 times [2023-08-04 07:25:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481712443] [2023-08-04 07:25:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 07:25:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481712443] [2023-08-04 07:25:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481712443] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:25:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958188712] [2023-08-04 07:25:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:19,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:25:19,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 07:25:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:19,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:25:19,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:25:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:19,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:25:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958188712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:19,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:25:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:25:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205784035] [2023-08-04 07:25:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:19,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:19,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:25:19,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 283 [2023-08-04 07:25:19,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:19,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:19,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 283 [2023-08-04 07:25:19,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:25:53,327 INFO L124 PetriNetUnfolderBase]: 230340/304147 cut-off events. [2023-08-04 07:25:53,328 INFO L125 PetriNetUnfolderBase]: For 4845/4845 co-relation queries the response was YES. [2023-08-04 07:25:54,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600138 conditions, 304147 events. 230340/304147 cut-off events. For 4845/4845 co-relation queries the response was YES. Maximal size of possible extension queue 6886. Compared 1979770 event pairs, 185538 based on Foata normal form. 0/294527 useless extension candidates. Maximal degree in co-relation 600096. Up to 289761 conditions per place. [2023-08-04 07:25:55,191 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 47 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-04 07:25:55,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 240 flow [2023-08-04 07:25:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:25:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:25:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-04 07:25:55,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5559481743227326 [2023-08-04 07:25:55,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-04 07:25:55,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-04 07:25:55,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:25:55,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-04 07:25:55,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:55,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:55,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:55,199 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 120 flow. Second operand 3 states and 472 transitions. [2023-08-04 07:25:55,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 240 flow [2023-08-04 07:25:55,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:25:55,203 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 130 flow [2023-08-04 07:25:55,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-08-04 07:25:55,204 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2023-08-04 07:25:55,204 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 130 flow [2023-08-04 07:25:55,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:55,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:25:55,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:25:55,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 07:25:55,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:55,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:25:55,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:25:55,410 INFO L85 PathProgramCache]: Analyzing trace with hash -687143405, now seen corresponding path program 1 times [2023-08-04 07:25:55,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:25:55,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348661507] [2023-08-04 07:25:55,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:55,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:25:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 07:25:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:25:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348661507] [2023-08-04 07:25:55,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348661507] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:25:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499509795] [2023-08-04 07:25:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:25:55,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:25:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:25:55,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:25:55,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 07:25:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:25:55,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:25:55,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:25:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:25:55,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:25:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499509795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:25:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:25:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:25:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562637921] [2023-08-04 07:25:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:25:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:25:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:25:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:25:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:25:55,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 283 [2023-08-04 07:25:55,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:25:55,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:25:55,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 283 [2023-08-04 07:25:55,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:26:29,640 INFO L124 PetriNetUnfolderBase]: 226020/296219 cut-off events. [2023-08-04 07:26:29,640 INFO L125 PetriNetUnfolderBase]: For 2661/2661 co-relation queries the response was YES. [2023-08-04 07:26:30,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587187 conditions, 296219 events. 226020/296219 cut-off events. For 2661/2661 co-relation queries the response was YES. Maximal size of possible extension queue 6884. Compared 1898600 event pairs, 178740 based on Foata normal form. 0/286603 useless extension candidates. Maximal degree in co-relation 126725. Up to 275243 conditions per place. [2023-08-04 07:26:31,436 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 54 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 07:26:31,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 276 flow [2023-08-04 07:26:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:26:31,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:26:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2023-08-04 07:26:31,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5630153121319199 [2023-08-04 07:26:31,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2023-08-04 07:26:31,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2023-08-04 07:26:31,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:26:31,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2023-08-04 07:26:31,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:31,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:31,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:31,441 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 130 flow. Second operand 3 states and 478 transitions. [2023-08-04 07:26:31,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 276 flow [2023-08-04 07:26:31,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:26:31,443 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 140 flow [2023-08-04 07:26:31,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-04 07:26:31,444 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2023-08-04 07:26:31,444 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 140 flow [2023-08-04 07:26:31,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:31,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:26:31,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:26:31,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 07:26:31,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:31,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:26:31,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:26:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2017196735, now seen corresponding path program 1 times [2023-08-04 07:26:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:26:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959955459] [2023-08-04 07:26:31,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:26:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:26:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:26:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959955459] [2023-08-04 07:26:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959955459] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:26:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854279369] [2023-08-04 07:26:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:26:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:26:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:26:31,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:26:31,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 07:26:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:26:31,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:26:31,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:26:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:26:31,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:26:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 07:26:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854279369] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:26:31,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:26:31,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:26:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547351526] [2023-08-04 07:26:31,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:26:31,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:26:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:26:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:26:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:26:31,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 283 [2023-08-04 07:26:31,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:26:31,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:26:31,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 283 [2023-08-04 07:26:31,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:00,466 INFO L124 PetriNetUnfolderBase]: 187794/242693 cut-off events. [2023-08-04 07:27:00,466 INFO L125 PetriNetUnfolderBase]: For 17320/17320 co-relation queries the response was YES. [2023-08-04 07:27:01,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496804 conditions, 242693 events. 187794/242693 cut-off events. For 17320/17320 co-relation queries the response was YES. Maximal size of possible extension queue 5914. Compared 1468734 event pairs, 118092 based on Foata normal form. 4/241145 useless extension candidates. Maximal degree in co-relation 129991. Up to 234201 conditions per place. [2023-08-04 07:27:01,988 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 47 selfloop transitions, 3 changer transitions 1/56 dead transitions. [2023-08-04 07:27:01,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 264 flow [2023-08-04 07:27:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:27:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:27:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2023-08-04 07:27:01,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388692579505301 [2023-08-04 07:27:01,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 610 transitions. [2023-08-04 07:27:01,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 610 transitions. [2023-08-04 07:27:01,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:01,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 610 transitions. [2023-08-04 07:27:01,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:01,997 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 140 flow. Second operand 4 states and 610 transitions. [2023-08-04 07:27:01,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 264 flow [2023-08-04 07:27:02,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 56 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:27:02,020 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 152 flow [2023-08-04 07:27:02,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-04 07:27:02,022 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2023-08-04 07:27:02,022 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 152 flow [2023-08-04 07:27:02,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:02,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:02,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:02,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 07:27:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:02,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:27:02,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2066039897, now seen corresponding path program 1 times [2023-08-04 07:27:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:02,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207636232] [2023-08-04 07:27:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 07:27:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207636232] [2023-08-04 07:27:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207636232] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:27:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895779154] [2023-08-04 07:27:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:02,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:02,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:27:02,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:27:02,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 07:27:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:02,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:27:02,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:27:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 07:27:02,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:27:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 07:27:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895779154] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:27:02,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:27:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:27:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92052478] [2023-08-04 07:27:02,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:27:02,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:27:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:27:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:27:02,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 283 [2023-08-04 07:27:02,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:02,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:02,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 283 [2023-08-04 07:27:02,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:25,247 INFO L124 PetriNetUnfolderBase]: 156186/200573 cut-off events. [2023-08-04 07:27:25,248 INFO L125 PetriNetUnfolderBase]: For 12557/12557 co-relation queries the response was YES. [2023-08-04 07:27:25,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409168 conditions, 200573 events. 156186/200573 cut-off events. For 12557/12557 co-relation queries the response was YES. Maximal size of possible extension queue 5410. Compared 1171120 event pairs, 99690 based on Foata normal form. 64/199597 useless extension candidates. Maximal degree in co-relation 106941. Up to 191065 conditions per place. [2023-08-04 07:27:26,509 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 59 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2023-08-04 07:27:26,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 324 flow [2023-08-04 07:27:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:27:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:27:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2023-08-04 07:27:26,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.549469964664311 [2023-08-04 07:27:26,511 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2023-08-04 07:27:26,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2023-08-04 07:27:26,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:26,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2023-08-04 07:27:26,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,514 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,514 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 152 flow. Second operand 4 states and 622 transitions. [2023-08-04 07:27:26,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 324 flow [2023-08-04 07:27:26,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 317 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:27:26,526 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 159 flow [2023-08-04 07:27:26,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-08-04 07:27:26,527 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2023-08-04 07:27:26,527 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 159 flow [2023-08-04 07:27:26,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:26,528 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:26,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 07:27:26,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:26,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:27:26,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1687552688, now seen corresponding path program 1 times [2023-08-04 07:27:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749221521] [2023-08-04 07:27:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:26,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749221521] [2023-08-04 07:27:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749221521] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:27:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506093392] [2023-08-04 07:27:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:26,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:27:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:27:26,804 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:27:26,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 07:27:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:26,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:27:26,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:27:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:26,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:27:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 07:27:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506093392] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:27:26,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:27:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:27:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880284075] [2023-08-04 07:27:26,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:27:26,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:27:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:27:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:27:26,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 283 [2023-08-04 07:27:26,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:26,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:26,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 283 [2023-08-04 07:27:26,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:27:47,118 INFO L124 PetriNetUnfolderBase]: 140058/176765 cut-off events. [2023-08-04 07:27:47,118 INFO L125 PetriNetUnfolderBase]: For 10650/10650 co-relation queries the response was YES. [2023-08-04 07:27:47,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364767 conditions, 176765 events. 140058/176765 cut-off events. For 10650/10650 co-relation queries the response was YES. Maximal size of possible extension queue 4958. Compared 975456 event pairs, 66330 based on Foata normal form. 1024/177773 useless extension candidates. Maximal degree in co-relation 95297. Up to 115241 conditions per place. [2023-08-04 07:27:48,236 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 71 selfloop transitions, 3 changer transitions 1/80 dead transitions. [2023-08-04 07:27:48,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 80 transitions, 379 flow [2023-08-04 07:27:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:27:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:27:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2023-08-04 07:27:48,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5600706713780919 [2023-08-04 07:27:48,237 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 634 transitions. [2023-08-04 07:27:48,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions. [2023-08-04 07:27:48,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:27:48,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions. [2023-08-04 07:27:48,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:48,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:48,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:48,241 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 159 flow. Second operand 4 states and 634 transitions. [2023-08-04 07:27:48,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 80 transitions, 379 flow [2023-08-04 07:27:48,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 372 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 07:27:48,252 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 166 flow [2023-08-04 07:27:48,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-08-04 07:27:48,253 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2023-08-04 07:27:48,253 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 166 flow [2023-08-04 07:27:48,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:48,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:27:48,253 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:27:48,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 07:27:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-04 07:27:48,459 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:27:48,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:27:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1559996063, now seen corresponding path program 1 times [2023-08-04 07:27:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:27:48,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999237924] [2023-08-04 07:27:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:27:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:27:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:27:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 07:27:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:27:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999237924] [2023-08-04 07:27:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999237924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:27:48,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:27:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:27:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66953413] [2023-08-04 07:27:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:27:48,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:27:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:27:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:27:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:27:48,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 283 [2023-08-04 07:27:48,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:27:48,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:27:48,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 283 [2023-08-04 07:27:48,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:28:08,493 INFO L124 PetriNetUnfolderBase]: 133658/173693 cut-off events. [2023-08-04 07:28:08,494 INFO L125 PetriNetUnfolderBase]: For 48946/48946 co-relation queries the response was YES. [2023-08-04 07:28:09,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369359 conditions, 173693 events. 133658/173693 cut-off events. For 48946/48946 co-relation queries the response was YES. Maximal size of possible extension queue 5020. Compared 1043031 event pairs, 26138 based on Foata normal form. 4096/177773 useless extension candidates. Maximal degree in co-relation 96381. Up to 135681 conditions per place. [2023-08-04 07:28:09,603 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 57 selfloop transitions, 3 changer transitions 33/98 dead transitions. [2023-08-04 07:28:09,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 98 transitions, 480 flow [2023-08-04 07:28:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 07:28:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 07:28:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 811 transitions. [2023-08-04 07:28:09,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5731448763250884 [2023-08-04 07:28:09,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 811 transitions. [2023-08-04 07:28:09,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 811 transitions. [2023-08-04 07:28:09,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:28:09,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 811 transitions. [2023-08-04 07:28:09,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:09,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:09,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:09,609 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 166 flow. Second operand 5 states and 811 transitions. [2023-08-04 07:28:09,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 98 transitions, 480 flow [2023-08-04 07:28:09,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 468 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 07:28:09,747 INFO L231 Difference]: Finished difference. Result has 74 places, 47 transitions, 186 flow [2023-08-04 07:28:09,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=74, PETRI_TRANSITIONS=47} [2023-08-04 07:28:09,748 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2023-08-04 07:28:09,748 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 47 transitions, 186 flow [2023-08-04 07:28:09,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:09,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:28:09,748 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:28:09,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 07:28:09,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:28:09,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:28:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1115214268, now seen corresponding path program 1 times [2023-08-04 07:28:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:28:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891945271] [2023-08-04 07:28:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:28:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:28:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:28:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 07:28:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:28:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891945271] [2023-08-04 07:28:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891945271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:28:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386782873] [2023-08-04 07:28:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:28:11,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:28:11,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:28:11,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:28:11,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 07:28:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:28:11,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-04 07:28:11,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:28:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 07:28:12,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:28:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386782873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:28:12,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:28:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2023-08-04 07:28:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803600147] [2023-08-04 07:28:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:28:12,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:28:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:28:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:28:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-04 07:28:12,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 283 [2023-08-04 07:28:12,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 47 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:12,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:28:12,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 283 [2023-08-04 07:28:12,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:28:27,501 INFO L124 PetriNetUnfolderBase]: 102542/129311 cut-off events. [2023-08-04 07:28:27,501 INFO L125 PetriNetUnfolderBase]: For 56354/56354 co-relation queries the response was YES. [2023-08-04 07:28:28,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307508 conditions, 129311 events. 102542/129311 cut-off events. For 56354/56354 co-relation queries the response was YES. Maximal size of possible extension queue 3524. Compared 700704 event pairs, 21400 based on Foata normal form. 729/129338 useless extension candidates. Maximal degree in co-relation 265773. Up to 116966 conditions per place. [2023-08-04 07:28:28,583 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 71 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-08-04 07:28:28,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 487 flow [2023-08-04 07:28:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:28:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:28:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-04 07:28:28,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5724381625441696 [2023-08-04 07:28:28,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-04 07:28:28,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-04 07:28:28,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:28:28,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-04 07:28:28,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:28,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:28,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:28,589 INFO L175 Difference]: Start difference. First operand has 74 places, 47 transitions, 186 flow. Second operand 3 states and 486 transitions. [2023-08-04 07:28:28,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 487 flow [2023-08-04 07:28:30,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 07:28:30,289 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 228 flow [2023-08-04 07:28:30,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-08-04 07:28:30,290 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2023-08-04 07:28:30,290 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 228 flow [2023-08-04 07:28:30,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:30,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:28:30,290 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:28:30,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-04 07:28:30,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 07:28:30,497 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:28:30,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:28:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1929132489, now seen corresponding path program 1 times [2023-08-04 07:28:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:28:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064526261] [2023-08-04 07:28:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:28:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:28:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:28:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 07:28:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:28:32,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064526261] [2023-08-04 07:28:32,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064526261] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:28:32,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57270074] [2023-08-04 07:28:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:28:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:28:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:28:32,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 07:28:32,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 07:28:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:28:32,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-04 07:28:32,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:28:33,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-04 07:28:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 07:28:33,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:28:33,468 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 07:28:33,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 126 [2023-08-04 07:28:33,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2023-08-04 07:28:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 07:28:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57270074] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:28:34,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:28:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 6] total 18 [2023-08-04 07:28:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456368253] [2023-08-04 07:28:34,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:28:34,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 07:28:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:28:34,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 07:28:34,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-08-04 07:28:34,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 283 [2023-08-04 07:28:34,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 228 flow. Second operand has 19 states, 19 states have (on average 117.0) internal successors, (2223), 19 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:28:34,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:28:34,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 283 [2023-08-04 07:28:34,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:29:01,640 INFO L124 PetriNetUnfolderBase]: 144955/192205 cut-off events. [2023-08-04 07:29:01,640 INFO L125 PetriNetUnfolderBase]: For 137482/137482 co-relation queries the response was YES. [2023-08-04 07:29:02,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506870 conditions, 192205 events. 144955/192205 cut-off events. For 137482/137482 co-relation queries the response was YES. Maximal size of possible extension queue 5915. Compared 1242944 event pairs, 5514 based on Foata normal form. 8623/199838 useless extension candidates. Maximal degree in co-relation 264046. Up to 56123 conditions per place. [2023-08-04 07:29:03,467 INFO L140 encePairwiseOnDemand]: 259/283 looper letters, 432 selfloop transitions, 332 changer transitions 68/837 dead transitions. [2023-08-04 07:29:03,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 837 transitions, 4810 flow [2023-08-04 07:29:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-04 07:29:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-04 07:29:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 5543 transitions. [2023-08-04 07:29:03,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663469628133939 [2023-08-04 07:29:03,481 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 5543 transitions. [2023-08-04 07:29:03,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 5543 transitions. [2023-08-04 07:29:03,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:29:03,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 5543 transitions. [2023-08-04 07:29:03,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 131.97619047619048) internal successors, (5543), 42 states have internal predecessors, (5543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:29:03,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 283.0) internal successors, (12169), 43 states have internal predecessors, (12169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:29:03,513 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 283.0) internal successors, (12169), 43 states have internal predecessors, (12169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:29:03,513 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 228 flow. Second operand 42 states and 5543 transitions. [2023-08-04 07:29:03,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 837 transitions, 4810 flow [2023-08-04 07:29:03,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 837 transitions, 4769 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:29:03,864 INFO L231 Difference]: Finished difference. Result has 145 places, 432 transitions, 2991 flow [2023-08-04 07:29:03,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2991, PETRI_PLACES=145, PETRI_TRANSITIONS=432} [2023-08-04 07:29:03,865 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 89 predicate places. [2023-08-04 07:29:03,865 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 432 transitions, 2991 flow [2023-08-04 07:29:03,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 117.0) internal successors, (2223), 19 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:29:03,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:29:03,866 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:03,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 07:29:04,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 07:29:04,073 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:29:04,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:29:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1239333822, now seen corresponding path program 1 times [2023-08-04 07:29:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:29:04,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661512064] [2023-08-04 07:29:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:29:04,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:29:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:29:04,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:29:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:29:04,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:29:04,378 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:29:04,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:29:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 07:29:04,378 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:29:04,379 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 07:29:04,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:29:04,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:29:04,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:29:04 BasicIcfg [2023-08-04 07:29:04,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:29:04,683 INFO L158 Benchmark]: Toolchain (without parser) took 288542.34ms. Allocated memory was 585.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 533.9MB in the beginning and 8.4GB in the end (delta: -7.9GB). Peak memory consumption was 7.6GB. Max. memory is 16.0GB. [2023-08-04 07:29:04,684 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory was 322.7MB in the beginning and 322.6MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:29:04,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.06ms. Allocated memory is still 585.1MB. Free memory was 533.5MB in the beginning and 509.1MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 07:29:04,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.71ms. Allocated memory is still 585.1MB. Free memory was 509.1MB in the beginning and 506.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 07:29:04,684 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 585.1MB. Free memory was 506.3MB in the beginning and 504.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 07:29:04,684 INFO L158 Benchmark]: RCFGBuilder took 837.71ms. Allocated memory is still 585.1MB. Free memory was 504.2MB in the beginning and 508.3MB in the end (delta: -4.1MB). Peak memory consumption was 34.4MB. Max. memory is 16.0GB. [2023-08-04 07:29:04,687 INFO L158 Benchmark]: TraceAbstraction took 287125.94ms. Allocated memory was 585.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 507.2MB in the beginning and 8.4GB in the end (delta: -7.9GB). Peak memory consumption was 7.5GB. Max. memory is 16.0GB. [2023-08-04 07:29:04,689 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory was 322.7MB in the beginning and 322.6MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 463.06ms. Allocated memory is still 585.1MB. Free memory was 533.5MB in the beginning and 509.1MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.71ms. Allocated memory is still 585.1MB. Free memory was 509.1MB in the beginning and 506.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 585.1MB. Free memory was 506.3MB in the beginning and 504.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 837.71ms. Allocated memory is still 585.1MB. Free memory was 504.2MB in the beginning and 508.3MB in the end (delta: -4.1MB). Peak memory consumption was 34.4MB. Max. memory is 16.0GB. * TraceAbstraction took 287125.94ms. Allocated memory was 585.1MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 507.2MB in the beginning and 8.4GB in the end (delta: -7.9GB). Peak memory consumption was 7.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 133 PlacesBefore, 34 PlacesAfterwards, 130 TransitionsBefore, 28 TransitionsAfterwards, 1732 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 110 TotalNumberOfCompositions, 4393 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1714, independent: 1530, independent conditional: 0, independent unconditional: 1530, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 870, independent: 838, independent conditional: 0, independent unconditional: 838, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1714, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 870, unknown conditional: 0, unknown unconditional: 870] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 121 PlacesBefore, 31 PlacesAfterwards, 116 TransitionsBefore, 24 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 8 FixpointIterations, 55 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, 3135 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1159, independent: 996, independent conditional: 0, independent unconditional: 996, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 586, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1159, independent: 429, independent conditional: 0, independent unconditional: 429, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 586, unknown conditional: 0, unknown unconditional: 586] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 161 PlacesBefore, 56 PlacesAfterwards, 152 TransitionsBefore, 44 TransitionsAfterwards, 4296 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 116 TotalNumberOfCompositions, 13210 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3683, independent: 3363, independent conditional: 0, independent unconditional: 3363, dependent: 320, dependent conditional: 0, dependent unconditional: 320, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1916, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3683, independent: 1495, independent conditional: 0, independent unconditional: 1495, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 1916, unknown conditional: 0, unknown unconditional: 1916] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461[2]; [L852] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] COND TRUE 0 asdf<2 [L852] FCALL, FORK 0 pthread_create(&t2461[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461[asdf], ((void *)0), P0, ((void *)0))=0, t2461={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] COND TRUE 0 asdf<2 [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] FCALL, FORK 0 pthread_create(&t2461[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461[asdf], ((void *)0), P0, ((void *)0))=1, t2461={6:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] EXPR 2 \read(x) [L769] 2 x$mem_tmp = x [L770] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 2 \read(x) [L770] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 \read(x) [L777] 2 __unbuffered_p0_EAX = x [L778] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 2 \read(x) [L778] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L852] COND FALSE 0 !(asdf<2) [L853] 0 pthread_t t2462[2]; [L854] 0 int asdf=0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t2462[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462[asdf], ((void *)0), P1, ((void *)0))=2, t2461={6:0}, t2462={10:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t2462[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462[asdf], ((void *)0), P1, ((void *)0))=3, t2461={6:0}, t2462={10:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L791] 3 x = 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 3 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 3 \read(x) [L794] EXPR 3 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 3 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 3 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 3 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] COND FALSE 0 !(asdf<2) [L855] 0 pthread_t t2463[2]; [L856] 0 int asdf=0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, t2463={9:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t2463[asdf], ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463[asdf], ((void *)0), P2, ((void *)0))=4, t2461={6:0}, t2462={10:0}, t2463={9:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, t2463={9:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] COND TRUE 0 asdf<2 [L808] 5 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 5 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 5 x$flush_delayed = weak$$choice2 [L811] EXPR 5 \read(x) [L811] 5 x$mem_tmp = x [L812] EXPR 5 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 5 \read(x) [L812] EXPR 5 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 5 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 5 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 5 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 5 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 5 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 5 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 5 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 5 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 5 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 5 \read(x) [L821] 5 __unbuffered_p2_EAX = x [L822] EXPR 5 x$flush_delayed ? x$mem_tmp : x [L822] 5 x = x$flush_delayed ? x$mem_tmp : x [L823] 5 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] FCALL, FORK 0 pthread_create(&t2463[asdf], ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463[asdf], ((void *)0), P2, ((void *)0))=5, t2461={6:0}, t2462={10:0}, t2463={9:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L856] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, t2463={9:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L856] COND FALSE 0 !(asdf<2) [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, main$tmp_guard0=1, main$tmp_guard1=0, t2461={6:0}, t2462={10:0}, t2463={9:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 163 locations, 4 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: 8.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 10 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=3, InterpolantAutomatonStates: 13, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 10/15 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 185 locations, 4 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: 274.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 259.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1026 mSDsluCounter, 1827 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1806 mSDsCounter, 401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3894 IncrementalHoareTripleChecker+Invalid, 4295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 401 mSolverCounterUnsat, 21 mSDtfsCounter, 3894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 250 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2991occurred in iteration=9, InterpolantAutomatonStates: 71, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 5135 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1928 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 135/186 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 163 locations, 4 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: 4.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 07:29:04,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...