/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_safe020_rmo_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 07:11:51,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 07:11:51,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 07:11:51,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 07:11:51,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 07:11:51,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 07:11:51,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 07:11:51,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 07:11:51,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 07:11:51,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 07:11:51,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 07:11:51,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 07:11:51,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 07:11:51,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 07:11:51,482 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 07:11:51,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 07:11:51,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 07:11:51,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 07:11:51,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 07:11:51,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 07:11:51,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 07:11:51,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 07:11:51,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 07:11:51,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 07:11:51,486 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 07:11:51,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 07:11:51,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 07:11:51,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 07:11:51,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 07:11:51,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 07:11:51,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:11:51,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 07:11:51,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 07:11:51,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 07:11:51,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 07:11:51,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 07:11:51,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 07:11:51,490 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 07:11:51,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 07:11:51,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 07:11:51,491 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 07:11:51,491 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:11:51,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 07:11:51,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 07:11:51,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 07:11:51,687 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 07:11:51,688 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 07:11:51,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe020_rmo_bound2.i [2023-08-04 07:11:52,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 07:11:53,093 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 07:11:53,094 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe020_rmo_bound2.i [2023-08-04 07:11:53,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138631564/e9ab070f9c084d5d8067a7798ccd9041/FLAGfb44826f8 [2023-08-04 07:11:53,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138631564/e9ab070f9c084d5d8067a7798ccd9041 [2023-08-04 07:11:53,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 07:11:53,129 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 07:11:53,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 07:11:53,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 07:11:53,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 07:11:53,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c32c4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53, skipping insertion in model container [2023-08-04 07:11:53,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,180 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 07:11:53,327 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_safe020_rmo_bound2.i[988,1001] [2023-08-04 07:11:53,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:11:53,578 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 07:11:53,589 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_safe020_rmo_bound2.i[988,1001] [2023-08-04 07:11:53,607 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 07:11:53,608 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 07:11:53,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 07:11:53,690 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:11:53,690 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 07:11:53,696 INFO L206 MainTranslator]: Completed translation [2023-08-04 07:11:53,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53 WrapperNode [2023-08-04 07:11:53,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 07:11:53,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 07:11:53,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 07:11:53,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 07:11:53,705 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:11:53" (1/1) ... [2023-08-04 07:11:53,739 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:11:53" (1/1) ... [2023-08-04 07:11:53,775 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 160 [2023-08-04 07:11:53,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 07:11:53,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 07:11:53,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 07:11:53,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 07:11:53,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 07:11:53,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 07:11:53,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 07:11:53,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 07:11:53,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (1/1) ... [2023-08-04 07:11:53,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 07:11:53,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:11:53,895 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:11:53,907 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:11:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 07:11:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 07:11:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 07:11:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 07:11:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 07:11:53,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 07:11:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 07:11:53,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 07:11:53,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 07:11:53,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 07:11:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 07:11:53,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 07:11:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 07:11:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 07:11:53,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 07:11:53,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 07:11:53,939 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:11:54,089 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 07:11:54,091 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 07:11:54,498 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 07:11:54,762 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 07:11:54,763 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 07:11:54,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:11:54 BoogieIcfgContainer [2023-08-04 07:11:54,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 07:11:54,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 07:11:54,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 07:11:54,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 07:11:54,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 07:11:53" (1/3) ... [2023-08-04 07:11:54,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d39865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:11:54, skipping insertion in model container [2023-08-04 07:11:54,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 07:11:53" (2/3) ... [2023-08-04 07:11:54,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d39865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 07:11:54, skipping insertion in model container [2023-08-04 07:11:54,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 07:11:54" (3/3) ... [2023-08-04 07:11:54,774 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe020_rmo_bound2.i [2023-08-04 07:11:54,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 07:11:54,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 07:11:54,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 07:11:54,788 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 07:11:54,846 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:11:54,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 144 transitions, 303 flow [2023-08-04 07:11:55,027 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-04 07:11:55,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:11:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 462 events. 30/462 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1913 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 283. Up to 16 conditions per place. [2023-08-04 07:11:55,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 144 transitions, 303 flow [2023-08-04 07:11:55,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 129 transitions, 267 flow [2023-08-04 07:11:55,046 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:11:55,057 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 129 transitions, 267 flow [2023-08-04 07:11:55,060 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 129 transitions, 267 flow [2023-08-04 07:11:55,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 129 transitions, 267 flow [2023-08-04 07:11:55,113 INFO L124 PetriNetUnfolderBase]: 22/359 cut-off events. [2023-08-04 07:11:55,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:11:55,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 359 events. 22/359 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1303 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 229. Up to 16 conditions per place. [2023-08-04 07:11:55,121 INFO L119 LiptonReduction]: Number of co-enabled transitions 1732 [2023-08-04 07:12:00,453 INFO L134 LiptonReduction]: Checked pairs total: 4653 [2023-08-04 07:12:00,453 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-04 07:12:00,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:12:00,470 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;@29b1b892, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:12:00,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:12:00,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:12:00,477 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-08-04 07:12:00,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:12:00,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:00,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:12:00,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:12:00,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2075624109, now seen corresponding path program 1 times [2023-08-04 07:12:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:00,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885584522] [2023-08-04 07:12:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:00,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:00,756 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:12:00,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:12:00,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885584522] [2023-08-04 07:12:00,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885584522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:12:00,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:12:00,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:12:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662795294] [2023-08-04 07:12:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:12:00,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:12:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:12:00,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:12:00,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:12:00,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 253 [2023-08-04 07:12:00,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:12:00,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:12:00,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 253 [2023-08-04 07:12:00,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:12:01,235 INFO L124 PetriNetUnfolderBase]: 1545/2411 cut-off events. [2023-08-04 07:12:01,236 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 07:12:01,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 2411 events. 1545/2411 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11700 event pairs, 912 based on Foata normal form. 100/2267 useless extension candidates. Maximal degree in co-relation 4848. Up to 2390 conditions per place. [2023-08-04 07:12:01,249 INFO L140 encePairwiseOnDemand]: 249/253 looper letters, 26 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-04 07:12:01,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 131 flow [2023-08-04 07:12:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:12:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:12:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-04 07:12:01,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2023-08-04 07:12:01,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-04 07:12:01,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-04 07:12:01,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:12:01,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-04 07:12:01,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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:12:01,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:12:01,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:12:01,277 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 65 flow. Second operand 3 states and 407 transitions. [2023-08-04 07:12:01,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 131 flow [2023-08-04 07:12:01,280 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:12:01,281 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 69 flow [2023-08-04 07:12:01,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, 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:12:01,286 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 07:12:01,286 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 69 flow [2023-08-04 07:12:01,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:12:01,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:01,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:12:01,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 07:12:01,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:12:01,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1450682097, now seen corresponding path program 1 times [2023-08-04 07:12:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628211646] [2023-08-04 07:12:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:01,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:01,378 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:12:01,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:12:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628211646] [2023-08-04 07:12:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628211646] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:12:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920178856] [2023-08-04 07:12:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:12:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:12:01,383 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:12:01,391 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:12:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:01,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:12:01,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:12:01,538 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:12:01,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:12:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920178856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:12:01,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:12:01,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:12:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648592731] [2023-08-04 07:12:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:12:01,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:12:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:12:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:12:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:12:01,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 253 [2023-08-04 07:12:01,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 69 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:12:01,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:12:01,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 253 [2023-08-04 07:12:01,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:12:01,862 INFO L124 PetriNetUnfolderBase]: 1176/1806 cut-off events. [2023-08-04 07:12:01,862 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 07:12:01,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3658 conditions, 1806 events. 1176/1806 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7980 event pairs, 726 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 3642. Up to 1749 conditions per place. [2023-08-04 07:12:01,877 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 29 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2023-08-04 07:12:01,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 147 flow [2023-08-04 07:12:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:12:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:12:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-04 07:12:01,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375494071146245 [2023-08-04 07:12:01,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-04 07:12:01,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-04 07:12:01,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:12:01,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-04 07:12:01,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 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:12:01,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:12:01,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:12:01,892 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 69 flow. Second operand 3 states and 408 transitions. [2023-08-04 07:12:01,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 147 flow [2023-08-04 07:12:01,893 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:12:01,894 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 73 flow [2023-08-04 07:12:01,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, 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:12:01,895 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 07:12:01,895 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 73 flow [2023-08-04 07:12:01,895 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:12:01,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:01,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:12:01,912 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:12:02,112 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:12:02,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:12:02,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1475610663, now seen corresponding path program 1 times [2023-08-04 07:12:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007966297] [2023-08-04 07:12:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:02,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:02,251 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:12:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:12:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007966297] [2023-08-04 07:12:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007966297] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:12:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453333265] [2023-08-04 07:12:02,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:02,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:12:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:12:02,256 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:12:02,263 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:12:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:02,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:12:02,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:12:02,397 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:12:02,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:12:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453333265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:12:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:12:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:12:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002516718] [2023-08-04 07:12:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:12:02,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:12:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:12:02,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:12:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:12:02,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 253 [2023-08-04 07:12:02,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 73 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:12:02,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:12:02,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 253 [2023-08-04 07:12:02,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:12:02,711 INFO L124 PetriNetUnfolderBase]: 1080/1646 cut-off events. [2023-08-04 07:12:02,711 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-04 07:12:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3386 conditions, 1646 events. 1080/1646 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7121 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:12:02,722 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 32 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 07:12:02,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 163 flow [2023-08-04 07:12:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:12:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:12:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-04 07:12:02,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.541501976284585 [2023-08-04 07:12:02,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-04 07:12:02,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-04 07:12:02,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:12:02,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-04 07:12:02,726 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:12:02,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:12:02,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:12:02,728 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 73 flow. Second operand 3 states and 411 transitions. [2023-08-04 07:12:02,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 163 flow [2023-08-04 07:12:02,730 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:12:02,731 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 77 flow [2023-08-04 07:12:02,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, 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:12:02,733 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-04 07:12:02,733 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 77 flow [2023-08-04 07:12:02,733 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:12:02,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:02,734 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:12:02,742 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:12:02,939 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:12:02,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:12:02,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2103948192, now seen corresponding path program 1 times [2023-08-04 07:12:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:02,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113939545] [2023-08-04 07:12:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:02,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:02,999 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:12:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:12:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113939545] [2023-08-04 07:12:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113939545] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:12:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803853986] [2023-08-04 07:12:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:03,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:12:03,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:12:03,001 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:12:03,020 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:12:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:03,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:12:03,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:12:03,140 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:12:03,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:12:03,156 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:12:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803853986] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:12:03,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:12:03,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:12:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083280411] [2023-08-04 07:12:03,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:12:03,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:12:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:12:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:12:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:12:03,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 253 [2023-08-04 07:12:03,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:12:03,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:12:03,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 253 [2023-08-04 07:12:03,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:12:03,195 INFO L124 PetriNetUnfolderBase]: 6/20 cut-off events. [2023-08-04 07:12:03,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:12:03,196 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:12:03,196 INFO L140 encePairwiseOnDemand]: 250/253 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 07:12:03,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 11 transitions, 49 flow [2023-08-04 07:12:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:12:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:12:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-04 07:12:03,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019762845849802 [2023-08-04 07:12:03,198 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-04 07:12:03,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-04 07:12:03,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:12:03,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-04 07:12:03,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 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:12:03,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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:12:03,202 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 0 states have call successors, (0), 0 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:12:03,202 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 77 flow. Second operand 4 states and 508 transitions. [2023-08-04 07:12:03,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 11 transitions, 49 flow [2023-08-04 07:12:03,202 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:12:03,203 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 07:12:03,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, 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:12:03,203 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -16 predicate places. [2023-08-04 07:12:03,204 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 07:12:03,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:12:03,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:12:03,219 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:12:03,419 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:12:03,419 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 07:12:03,421 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 07:12:03,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 144 transitions, 303 flow [2023-08-04 07:12:03,461 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-04 07:12:03,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:12:03,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 462 events. 30/462 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1913 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 283. Up to 16 conditions per place. [2023-08-04 07:12:03,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 144 transitions, 303 flow [2023-08-04 07:12:03,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 115 transitions, 245 flow [2023-08-04 07:12:03,464 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:12:03,464 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 115 transitions, 245 flow [2023-08-04 07:12:03,464 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 115 transitions, 245 flow [2023-08-04 07:12:03,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 115 transitions, 245 flow [2023-08-04 07:12:03,481 INFO L124 PetriNetUnfolderBase]: 6/230 cut-off events. [2023-08-04 07:12:03,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:12:03,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 230 events. 6/230 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 596 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. [2023-08-04 07:12:03,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 1160 [2023-08-04 07:12:08,175 INFO L134 LiptonReduction]: Checked pairs total: 3040 [2023-08-04 07:12:08,176 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 07:12:08,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 07:12:08,178 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;@29b1b892, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:12:08,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 07:12:08,184 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:12:08,184 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 07:12:08,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 07:12:08,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:08,184 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 07:12:08,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 07:12:08,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 821480211, now seen corresponding path program 1 times [2023-08-04 07:12:08,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:08,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498996438] [2023-08-04 07:12:08,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:12:08,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:12:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:12:08,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:12:08,237 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:12:08,237 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 07:12:08,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 07:12:08,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 07:12:08,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 07:12:08,238 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 07:12:08,238 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 07:12:08,239 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 07:12:08,239 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 07:12:08,281 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 07:12:08,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 368 flow [2023-08-04 07:12:08,432 INFO L124 PetriNetUnfolderBase]: 93/1385 cut-off events. [2023-08-04 07:12:08,432 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 07:12:08,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1385 events. 93/1385 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9282 event pairs, 0 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 1008. Up to 54 conditions per place. [2023-08-04 07:12:08,438 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 166 transitions, 368 flow [2023-08-04 07:12:08,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 151 transitions, 326 flow [2023-08-04 07:12:08,442 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 07:12:08,442 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 151 transitions, 326 flow [2023-08-04 07:12:08,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 151 transitions, 326 flow [2023-08-04 07:12:08,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 151 transitions, 326 flow [2023-08-04 07:12:08,578 INFO L124 PetriNetUnfolderBase]: 66/1048 cut-off events. [2023-08-04 07:12:08,579 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 07:12:08,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 1048 events. 66/1048 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6383 event pairs, 0 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 780. Up to 54 conditions per place. [2023-08-04 07:12:08,595 INFO L119 LiptonReduction]: Number of co-enabled transitions 4296 [2023-08-04 07:12:13,701 INFO L134 LiptonReduction]: Checked pairs total: 14105 [2023-08-04 07:12:13,702 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-04 07:12:13,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 07:12:13,704 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;@29b1b892, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 07:12:13,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 07:12:13,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 07:12:13,708 INFO L124 PetriNetUnfolderBase]: 1/29 cut-off events. [2023-08-04 07:12:13,708 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 07:12:13,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:13,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:12:13,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:12:13,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1200493141, now seen corresponding path program 1 times [2023-08-04 07:12:13,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:13,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184971276] [2023-08-04 07:12:13,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:13,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:13,757 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:12:13,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:12:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184971276] [2023-08-04 07:12:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184971276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:12:13,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:12:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:12:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62567533] [2023-08-04 07:12:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:12:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:12:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:12:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:12:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 07:12:13,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 281 [2023-08-04 07:12:13,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:12:13,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:12:13,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 281 [2023-08-04 07:12:13,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:12:56,330 INFO L124 PetriNetUnfolderBase]: 272349/356668 cut-off events. [2023-08-04 07:12:56,330 INFO L125 PetriNetUnfolderBase]: For 5372/5372 co-relation queries the response was YES. [2023-08-04 07:12:57,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706641 conditions, 356668 events. 272349/356668 cut-off events. For 5372/5372 co-relation queries the response was YES. Maximal size of possible extension queue 7827. Compared 2309403 event pairs, 218772 based on Foata normal form. 8820/344443 useless extension candidates. Maximal degree in co-relation 152744. Up to 343786 conditions per place. [2023-08-04 07:12:58,360 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 40 selfloop transitions, 2 changer transitions 1/48 dead transitions. [2023-08-04 07:12:58,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 206 flow [2023-08-04 07:12:58,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:12:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:12:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-04 07:12:58,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5516014234875445 [2023-08-04 07:12:58,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-04 07:12:58,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-04 07:12:58,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:12:58,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-04 07:12:58,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:12:58,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:12:58,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:12:58,366 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 112 flow. Second operand 3 states and 465 transitions. [2023-08-04 07:12:58,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 206 flow [2023-08-04 07:12:58,367 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:12:58,368 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 120 flow [2023-08-04 07:12:58,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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:12:58,369 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2023-08-04 07:12:58,369 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 120 flow [2023-08-04 07:12:58,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:12:58,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:12:58,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:12:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 07:12:58,370 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:12:58,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:12:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash -88790004, now seen corresponding path program 1 times [2023-08-04 07:12:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:12:58,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844102455] [2023-08-04 07:12:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:12:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:58,433 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:12:58,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:12:58,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844102455] [2023-08-04 07:12:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844102455] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:12:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827012191] [2023-08-04 07:12:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:12:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:12:58,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:12:58,435 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:12:58,437 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:12:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:12:58,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:12:58,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:12:58,746 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:12:58,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:12:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827012191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:12:58,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:12:58,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:12:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372818592] [2023-08-04 07:12:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:12:58,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:12:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:12:58,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:12:58,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:12:58,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 281 [2023-08-04 07:12:58,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 120 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:12:58,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:12:58,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 281 [2023-08-04 07:12:58,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:13:33,110 INFO L124 PetriNetUnfolderBase]: 230340/304707 cut-off events. [2023-08-04 07:13:33,110 INFO L125 PetriNetUnfolderBase]: For 4685/4685 co-relation queries the response was YES. [2023-08-04 07:13:34,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600698 conditions, 304707 events. 230340/304707 cut-off events. For 4685/4685 co-relation queries the response was YES. Maximal size of possible extension queue 6887. Compared 1991366 event pairs, 185538 based on Foata normal form. 0/295006 useless extension candidates. Maximal degree in co-relation 600656. Up to 289761 conditions per place. [2023-08-04 07:13:35,029 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 47 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-08-04 07:13:35,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 240 flow [2023-08-04 07:13:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:13:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:13:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2023-08-04 07:13:35,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5563463819691578 [2023-08-04 07:13:35,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2023-08-04 07:13:35,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2023-08-04 07:13:35,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:13:35,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2023-08-04 07:13:35,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 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:13:35,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:13:35,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:13:35,039 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 120 flow. Second operand 3 states and 469 transitions. [2023-08-04 07:13:35,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 240 flow [2023-08-04 07:13:35,043 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:13:35,045 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 130 flow [2023-08-04 07:13:35,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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:13:35,048 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2023-08-04 07:13:35,048 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 130 flow [2023-08-04 07:13:35,048 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:13:35,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:13:35,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:13:35,058 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:13:35,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:35,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:13:35,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:13:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash 331091507, now seen corresponding path program 1 times [2023-08-04 07:13:35,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:13:35,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833382625] [2023-08-04 07:13:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:13:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:35,314 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:13:35,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:13:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833382625] [2023-08-04 07:13:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833382625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:13:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209639975] [2023-08-04 07:13:35,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:13:35,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:13:35,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:13:35,316 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:13:35,318 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:13:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:13:35,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 07:13:35,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:13:35,448 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:13:35,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:13:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209639975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:13:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:13:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 07:13:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724433026] [2023-08-04 07:13:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:13:35,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:13:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:13:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:13:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:13:35,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 281 [2023-08-04 07:13:35,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 130 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:13:35,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:13:35,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 281 [2023-08-04 07:13:35,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:08,684 INFO L124 PetriNetUnfolderBase]: 226020/296219 cut-off events. [2023-08-04 07:14:08,684 INFO L125 PetriNetUnfolderBase]: For 2661/2661 co-relation queries the response was YES. [2023-08-04 07:14:09,661 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 1899328 event pairs, 178740 based on Foata normal form. 0/286614 useless extension candidates. Maximal degree in co-relation 126725. Up to 275243 conditions per place. [2023-08-04 07:14:10,564 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 54 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-04 07:14:10,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 276 flow [2023-08-04 07:14:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:14:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:14:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-04 07:14:10,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634638196915777 [2023-08-04 07:14:10,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-04 07:14:10,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-04 07:14:10,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:10,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-04 07:14:10,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:14:10,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:14:10,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:14:10,568 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 130 flow. Second operand 3 states and 475 transitions. [2023-08-04 07:14:10,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 276 flow [2023-08-04 07:14:10,571 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:14:10,572 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 140 flow [2023-08-04 07:14:10,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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:14:10,573 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2023-08-04 07:14:10,573 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 140 flow [2023-08-04 07:14:10,574 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:14:10,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:10,574 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:14:10,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 07:14:10,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:10,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:10,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1679875635, now seen corresponding path program 1 times [2023-08-04 07:14:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222923853] [2023-08-04 07:14:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:10,844 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:14:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222923853] [2023-08-04 07:14:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222923853] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704391390] [2023-08-04 07:14:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:10,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:10,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:10,849 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:14:10,852 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:14:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:10,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:14:10,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:11,003 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:14:11,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:14:11,017 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:14:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704391390] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:14:11,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:14:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 07:14:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418423366] [2023-08-04 07:14:11,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:14:11,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:14:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:14:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:11,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 281 [2023-08-04 07:14:11,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:14:11,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:11,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 281 [2023-08-04 07:14:11,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:14:40,350 INFO L124 PetriNetUnfolderBase]: 187794/242693 cut-off events. [2023-08-04 07:14:40,350 INFO L125 PetriNetUnfolderBase]: For 17320/17320 co-relation queries the response was YES. [2023-08-04 07:14:41,151 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 1469983 event pairs, 118092 based on Foata normal form. 4/241160 useless extension candidates. Maximal degree in co-relation 129991. Up to 234201 conditions per place. [2023-08-04 07:14:41,807 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 47 selfloop transitions, 3 changer transitions 1/56 dead transitions. [2023-08-04 07:14:41,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 264 flow [2023-08-04 07:14:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:14:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:14:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2023-08-04 07:14:41,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5391459074733096 [2023-08-04 07:14:41,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2023-08-04 07:14:41,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2023-08-04 07:14:41,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:14:41,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2023-08-04 07:14:41,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 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:14:41,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:14:41,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:14:41,813 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 140 flow. Second operand 4 states and 606 transitions. [2023-08-04 07:14:41,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 264 flow [2023-08-04 07:14:41,827 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:14:41,828 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 152 flow [2023-08-04 07:14:41,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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:14:41,829 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2023-08-04 07:14:41,829 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 152 flow [2023-08-04 07:14:41,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:14:41,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:14:41,830 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:14:41,840 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:14:42,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:42,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:14:42,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:14:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1038652273, now seen corresponding path program 1 times [2023-08-04 07:14:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:14:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354680079] [2023-08-04 07:14:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:14:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:42,099 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:14:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:14:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354680079] [2023-08-04 07:14:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354680079] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:14:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136418646] [2023-08-04 07:14:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:14:42,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:14:42,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:14:42,101 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:14:42,104 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:14:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:14:42,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:14:42,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:14:42,252 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:14:42,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:14:42,265 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:14:42,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136418646] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:14:42,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:14:42,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:14:42,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645393151] [2023-08-04 07:14:42,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:14:42,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:14:42,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:14:42,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:14:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:14:42,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 281 [2023-08-04 07:14:42,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 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:14:42,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:14:42,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 281 [2023-08-04 07:14:42,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:15:04,639 INFO L124 PetriNetUnfolderBase]: 156186/200573 cut-off events. [2023-08-04 07:15:04,640 INFO L125 PetriNetUnfolderBase]: For 12557/12557 co-relation queries the response was YES. [2023-08-04 07:15:05,343 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 1172331 event pairs, 99690 based on Foata normal form. 64/199612 useless extension candidates. Maximal degree in co-relation 106941. Up to 191065 conditions per place. [2023-08-04 07:15:06,015 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 59 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2023-08-04 07:15:06,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 324 flow [2023-08-04 07:15:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:15:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:15:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2023-08-04 07:15:06,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5498220640569395 [2023-08-04 07:15:06,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 618 transitions. [2023-08-04 07:15:06,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 618 transitions. [2023-08-04 07:15:06,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:15:06,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 618 transitions. [2023-08-04 07:15:06,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:15:06,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:15:06,020 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:15:06,021 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 152 flow. Second operand 4 states and 618 transitions. [2023-08-04 07:15:06,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 324 flow [2023-08-04 07:15:06,034 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:15:06,036 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 159 flow [2023-08-04 07:15:06,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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:15:06,038 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2023-08-04 07:15:06,038 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 159 flow [2023-08-04 07:15:06,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 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:15:06,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:15:06,038 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:15:06,047 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:15:06,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:15:06,245 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:15:06,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:15:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1095521259, now seen corresponding path program 1 times [2023-08-04 07:15:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:15:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257522869] [2023-08-04 07:15:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:15:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:06,311 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:15:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:15:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257522869] [2023-08-04 07:15:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257522869] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:15:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785674103] [2023-08-04 07:15:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:15:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:15:06,313 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:15:06,315 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:15:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:06,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 07:15:06,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:15:06,462 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:15:06,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:15:06,479 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:15:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785674103] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:15:06,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:15:06,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 07:15:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803454967] [2023-08-04 07:15:06,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:15:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 07:15:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:15:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 07:15:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 07:15:06,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 281 [2023-08-04 07:15:06,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 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:15:06,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:15:06,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 281 [2023-08-04 07:15:06,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:15:26,632 INFO L124 PetriNetUnfolderBase]: 140058/176765 cut-off events. [2023-08-04 07:15:26,632 INFO L125 PetriNetUnfolderBase]: For 10650/10650 co-relation queries the response was YES. [2023-08-04 07:15:27,260 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 976436 event pairs, 66330 based on Foata normal form. 1024/177788 useless extension candidates. Maximal degree in co-relation 95297. Up to 115241 conditions per place. [2023-08-04 07:15:27,919 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 71 selfloop transitions, 3 changer transitions 1/80 dead transitions. [2023-08-04 07:15:27,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 80 transitions, 379 flow [2023-08-04 07:15:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 07:15:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 07:15:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2023-08-04 07:15:27,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5604982206405694 [2023-08-04 07:15:27,921 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 630 transitions. [2023-08-04 07:15:27,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 630 transitions. [2023-08-04 07:15:27,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:15:27,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 630 transitions. [2023-08-04 07:15:27,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 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:15:27,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:15:27,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 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:15:27,925 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 159 flow. Second operand 4 states and 630 transitions. [2023-08-04 07:15:27,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 80 transitions, 379 flow [2023-08-04 07:15:27,933 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:15:27,934 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 166 flow [2023-08-04 07:15:27,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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:15:27,935 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2023-08-04 07:15:27,935 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 166 flow [2023-08-04 07:15:27,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 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:15:27,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:15:27,935 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:15:27,940 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:15:28,135 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,SelfDestructingSolverStorable10 [2023-08-04 07:15:28,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:15:28,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:15:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash -652789264, now seen corresponding path program 1 times [2023-08-04 07:15:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:15:28,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902295825] [2023-08-04 07:15:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:15:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:28,316 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:15:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:15:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902295825] [2023-08-04 07:15:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902295825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:15:28,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:15:28,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:15:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263114503] [2023-08-04 07:15:28,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:15:28,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:15:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:15:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:15:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:15:28,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 281 [2023-08-04 07:15:28,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 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:15:28,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:15:28,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 281 [2023-08-04 07:15:28,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:15:57,385 INFO L124 PetriNetUnfolderBase]: 210842/260703 cut-off events. [2023-08-04 07:15:57,386 INFO L125 PetriNetUnfolderBase]: For 74545/74545 co-relation queries the response was YES. [2023-08-04 07:15:58,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563889 conditions, 260703 events. 210842/260703 cut-off events. For 74545/74545 co-relation queries the response was YES. Maximal size of possible extension queue 5632. Compared 1371050 event pairs, 80122 based on Foata normal form. 6400/267050 useless extension candidates. Maximal degree in co-relation 563798. Up to 229834 conditions per place. [2023-08-04 07:15:59,351 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 67 selfloop transitions, 5 changer transitions 33/108 dead transitions. [2023-08-04 07:15:59,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 108 transitions, 572 flow [2023-08-04 07:15:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 07:15:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 07:15:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 791 transitions. [2023-08-04 07:15:59,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5629893238434164 [2023-08-04 07:15:59,354 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 791 transitions. [2023-08-04 07:15:59,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 791 transitions. [2023-08-04 07:15:59,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:15:59,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 791 transitions. [2023-08-04 07:15:59,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 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:15:59,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 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:15:59,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 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:15:59,358 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 166 flow. Second operand 5 states and 791 transitions. [2023-08-04 07:15:59,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 108 transitions, 572 flow [2023-08-04 07:15:59,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 558 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 07:15:59,386 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 204 flow [2023-08-04 07:15:59,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, 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=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=74, PETRI_TRANSITIONS=49} [2023-08-04 07:15:59,387 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2023-08-04 07:15:59,387 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 49 transitions, 204 flow [2023-08-04 07:15:59,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 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:15:59,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:15:59,387 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:15:59,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 07:15:59,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:15:59,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:15:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1238355500, now seen corresponding path program 1 times [2023-08-04 07:15:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:15:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743481134] [2023-08-04 07:15:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:15:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:15:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:15:59,627 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:15:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:15:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743481134] [2023-08-04 07:15:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743481134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:15:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 07:15:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 07:15:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378470101] [2023-08-04 07:15:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:15:59,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 07:15:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:15:59,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 07:15:59,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 07:15:59,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 281 [2023-08-04 07:15:59,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 49 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:15:59,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:15:59,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 281 [2023-08-04 07:15:59,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:16:27,583 INFO L124 PetriNetUnfolderBase]: 176346/225421 cut-off events. [2023-08-04 07:16:27,583 INFO L125 PetriNetUnfolderBase]: For 139017/144489 co-relation queries the response was YES. [2023-08-04 07:16:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557256 conditions, 225421 events. 176346/225421 cut-off events. For 139017/144489 co-relation queries the response was YES. Maximal size of possible extension queue 6194. Compared 1313782 event pairs, 36138 based on Foata normal form. 5616/227580 useless extension candidates. Maximal degree in co-relation 468617. Up to 177425 conditions per place. [2023-08-04 07:16:29,709 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 61 selfloop transitions, 3 changer transitions 33/104 dead transitions. [2023-08-04 07:16:29,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 557 flow [2023-08-04 07:16:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 07:16:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 07:16:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2023-08-04 07:16:29,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736654804270462 [2023-08-04 07:16:29,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2023-08-04 07:16:29,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2023-08-04 07:16:29,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:16:29,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2023-08-04 07:16:29,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 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:16:29,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 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:16:29,717 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 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:16:29,717 INFO L175 Difference]: Start difference. First operand has 74 places, 49 transitions, 204 flow. Second operand 5 states and 806 transitions. [2023-08-04 07:16:29,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 557 flow [2023-08-04 07:16:38,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 548 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 07:16:38,979 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 224 flow [2023-08-04 07:16:38,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2023-08-04 07:16:38,980 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2023-08-04 07:16:38,980 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 224 flow [2023-08-04 07:16:38,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:16:38,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:16:38,981 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] [2023-08-04 07:16:38,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 07:16:38,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:16:38,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:16:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash -920039827, now seen corresponding path program 1 times [2023-08-04 07:16:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:16:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665198058] [2023-08-04 07:16:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:16:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:16:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:16:40,336 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:16:40,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:16:40,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665198058] [2023-08-04 07:16:40,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665198058] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:16:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221876949] [2023-08-04 07:16:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:16:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:16:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:16:40,345 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:16:40,346 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:16:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:16:40,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-04 07:16:40,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:16:40,994 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:16:40,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 07:16:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221876949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 07:16:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 07:16:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2023-08-04 07:16:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522368911] [2023-08-04 07:16:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 07:16:40,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 07:16:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:16:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 07:16:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-04 07:16:41,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 281 [2023-08-04 07:16:41,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:16:41,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:16:41,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 281 [2023-08-04 07:16:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:17:03,626 INFO L124 PetriNetUnfolderBase]: 148802/186511 cut-off events. [2023-08-04 07:17:03,626 INFO L125 PetriNetUnfolderBase]: For 155530/161226 co-relation queries the response was YES. [2023-08-04 07:17:04,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495918 conditions, 186511 events. 148802/186511 cut-off events. For 155530/161226 co-relation queries the response was YES. Maximal size of possible extension queue 5472. Compared 1026830 event pairs, 31762 based on Foata normal form. 954/181430 useless extension candidates. Maximal degree in co-relation 420405. Up to 166825 conditions per place. [2023-08-04 07:17:05,088 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 75 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2023-08-04 07:17:05,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 549 flow [2023-08-04 07:17:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 07:17:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 07:17:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-04 07:17:05,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729537366548043 [2023-08-04 07:17:05,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-04 07:17:05,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-04 07:17:05,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:17:05,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-04 07:17:05,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:17:05,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:17:05,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:17:05,093 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 224 flow. Second operand 3 states and 483 transitions. [2023-08-04 07:17:05,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 549 flow [2023-08-04 07:17:05,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 542 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 07:17:05,557 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 266 flow [2023-08-04 07:17:05,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-08-04 07:17:05,558 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2023-08-04 07:17:05,558 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 266 flow [2023-08-04 07:17:05,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 07:17:05,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:17:05,558 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:17:05,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 07:17:05,759 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:17:05,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:17:05,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:17:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 448192915, now seen corresponding path program 1 times [2023-08-04 07:17:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:17:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786814040] [2023-08-04 07:17:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:17:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:17:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:17:07,671 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:17:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 07:17:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786814040] [2023-08-04 07:17:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786814040] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 07:17:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951620382] [2023-08-04 07:17:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:17:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 07:17:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 07:17:07,674 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:17:07,676 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:17:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 07:17:07,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 07:17:07,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 07:17:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 07:17:07,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 07:17:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 07:17:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951620382] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 07:17:08,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 07:17:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 4] total 14 [2023-08-04 07:17:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007833271] [2023-08-04 07:17:08,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 07:17:08,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-04 07:17:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 07:17:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-04 07:17:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-08-04 07:17:08,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-08-04 07:17:08,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 266 flow. Second operand has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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:17:08,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 07:17:08,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-08-04 07:17:08,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 07:17:22,289 INFO L124 PetriNetUnfolderBase]: 78835/101613 cut-off events. [2023-08-04 07:17:22,290 INFO L125 PetriNetUnfolderBase]: For 104488/107306 co-relation queries the response was YES. [2023-08-04 07:17:22,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293634 conditions, 101613 events. 78835/101613 cut-off events. For 104488/107306 co-relation queries the response was YES. Maximal size of possible extension queue 3030. Compared 573038 event pairs, 8815 based on Foata normal form. 4197/103499 useless extension candidates. Maximal degree in co-relation 200749. Up to 29873 conditions per place. [2023-08-04 07:17:23,072 INFO L140 encePairwiseOnDemand]: 262/281 looper letters, 267 selfloop transitions, 137 changer transitions 19/430 dead transitions. [2023-08-04 07:17:23,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 430 transitions, 2708 flow [2023-08-04 07:17:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-04 07:17:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-04 07:17:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3284 transitions. [2023-08-04 07:17:23,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747330960854094 [2023-08-04 07:17:23,079 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3284 transitions. [2023-08-04 07:17:23,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3284 transitions. [2023-08-04 07:17:23,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 07:17:23,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3284 transitions. [2023-08-04 07:17:23,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 131.36) internal successors, (3284), 25 states have internal predecessors, (3284), 0 states have call successors, (0), 0 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:17:23,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 281.0) internal successors, (7306), 26 states have internal predecessors, (7306), 0 states have call successors, (0), 0 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:17:23,096 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 281.0) internal successors, (7306), 26 states have internal predecessors, (7306), 0 states have call successors, (0), 0 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:17:23,096 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 266 flow. Second operand 25 states and 3284 transitions. [2023-08-04 07:17:23,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 430 transitions, 2708 flow [2023-08-04 07:17:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 430 transitions, 2687 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 07:17:23,156 INFO L231 Difference]: Finished difference. Result has 118 places, 199 transitions, 1295 flow [2023-08-04 07:17:23,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1295, PETRI_PLACES=118, PETRI_TRANSITIONS=199} [2023-08-04 07:17:23,157 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places. [2023-08-04 07:17:23,157 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 199 transitions, 1295 flow [2023-08-04 07:17:23,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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:17:23,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 07:17:23,158 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:17:23,167 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:17:23,364 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:17:23,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 07:17:23,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 07:17:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1477972148, now seen corresponding path program 1 times [2023-08-04 07:17:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 07:17:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504078712] [2023-08-04 07:17:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 07:17:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 07:17:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:17:23,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 07:17:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 07:17:23,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 07:17:23,628 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 07:17:23,629 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 07:17:23,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 07:17:23,629 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 07:17:23,630 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 07:17:23,632 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 07:17:23,632 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 07:17:23,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 07:17:23 BasicIcfg [2023-08-04 07:17:23,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 07:17:23,967 INFO L158 Benchmark]: Toolchain (without parser) took 330837.85ms. Allocated memory was 341.8MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 285.1MB in the beginning and 12.3GB in the end (delta: -12.0GB). Peak memory consumption was 4.3GB. Max. memory is 16.0GB. [2023-08-04 07:17:23,968 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 341.8MB. Free memory is still 292.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 07:17:23,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.11ms. Allocated memory is still 341.8MB. Free memory was 285.1MB in the beginning and 260.4MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 07:17:23,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.30ms. Allocated memory is still 341.8MB. Free memory was 260.4MB in the beginning and 257.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 07:17:23,968 INFO L158 Benchmark]: Boogie Preprocessor took 70.05ms. Allocated memory was 341.8MB in the beginning and 614.5MB in the end (delta: 272.6MB). Free memory was 257.9MB in the beginning and 581.6MB in the end (delta: -323.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.0GB. [2023-08-04 07:17:23,968 INFO L158 Benchmark]: RCFGBuilder took 918.54ms. Allocated memory is still 614.5MB. Free memory was 581.6MB in the beginning and 510.3MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. [2023-08-04 07:17:23,969 INFO L158 Benchmark]: TraceAbstraction took 329197.88ms. Allocated memory was 614.5MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 510.3MB in the beginning and 12.3GB in the end (delta: -11.8GB). Peak memory consumption was 4.3GB. Max. memory is 16.0GB. [2023-08-04 07:17:23,971 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.10ms. Allocated memory is still 341.8MB. Free memory is still 292.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 567.11ms. Allocated memory is still 341.8MB. Free memory was 285.1MB in the beginning and 260.4MB in the end (delta: 24.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.30ms. Allocated memory is still 341.8MB. Free memory was 260.4MB in the beginning and 257.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 70.05ms. Allocated memory was 341.8MB in the beginning and 614.5MB in the end (delta: 272.6MB). Free memory was 257.9MB in the beginning and 581.6MB in the end (delta: -323.7MB). Peak memory consumption was 10.0MB. Max. memory is 16.0GB. * RCFGBuilder took 918.54ms. Allocated memory is still 614.5MB. Free memory was 581.6MB in the beginning and 510.3MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. * TraceAbstraction took 329197.88ms. Allocated memory was 614.5MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 510.3MB in the beginning and 12.3GB in the end (delta: -11.8GB). Peak memory consumption was 4.3GB. 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.4s, 132 PlacesBefore, 34 PlacesAfterwards, 129 TransitionsBefore, 28 TransitionsAfterwards, 1732 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 109 TotalNumberOfCompositions, 4653 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1617, independent: 1410, independent conditional: 0, independent unconditional: 1410, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 852, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1617, independent: 590, independent conditional: 0, independent unconditional: 590, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 852, unknown conditional: 0, unknown unconditional: 852] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, 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.7s, 120 PlacesBefore, 31 PlacesAfterwards, 115 TransitionsBefore, 24 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 96 TotalNumberOfCompositions, 3040 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1121, independent: 962, independent conditional: 0, independent unconditional: 962, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 584, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1121, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 584, unknown conditional: 0, unknown unconditional: 584] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, 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, 160 PlacesBefore, 56 PlacesAfterwards, 151 TransitionsBefore, 44 TransitionsAfterwards, 4296 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 115 TotalNumberOfCompositions, 14105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3960, independent: 3607, independent conditional: 0, independent unconditional: 3607, dependent: 353, dependent conditional: 0, dependent unconditional: 353, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1931, independent conditional: 0, independent unconditional: 1931, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3960, independent: 1676, independent conditional: 0, independent unconditional: 1676, dependent: 297, dependent conditional: 0, dependent unconditional: 297, unknown: 1987, unknown conditional: 0, unknown unconditional: 1987] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, 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; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269[2]; [L850] 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, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269={7: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] [L850] COND TRUE 0 asdf<2 [L850] FCALL, FORK 0 pthread_create(&t2269[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, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269[asdf], ((void *)0), P0, ((void *)0))=-5, t2269={7: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] [L850] 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, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2269={7: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] [L850] COND TRUE 0 asdf<2 [L759] 1 y = 2 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, 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=2] [L850] FCALL, FORK 0 pthread_create(&t2269[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, arg={0:0}, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269[asdf], ((void *)0), P0, ((void *)0))=-4, t2269={7: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=2] [L850] 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, arg={0:0}, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2269={7: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=2] [L759] 2 y = 2 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, 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=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 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, 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=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=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L764] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 2 x$flush_delayed = weak$$choice2 [L767] EXPR 2 \read(x) [L767] 2 x$mem_tmp = x [L768] 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) [L768] EXPR 2 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 2 \read(x) [L775] 2 __unbuffered_p0_EAX = x [L776] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 2 \read(x) [L776] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L776] 2 x = x$flush_delayed ? x$mem_tmp : x [L777] 2 x$flush_delayed = (_Bool)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, 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=2] [L850] COND FALSE 0 !(asdf<2) [L851] 0 pthread_t t2270[2]; [L852] 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, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2269={7:0}, t2270={5: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=2] [L852] COND TRUE 0 asdf<2 [L852] FCALL, FORK 0 pthread_create(&t2270[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, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270[asdf], ((void *)0), P1, ((void *)0))=-3, t2269={7:0}, t2270={5: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=2] [L852] 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, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2269={7:0}, t2270={5: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=2] [L852] COND TRUE 0 asdf<2 [L789] 3 x = 1 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, 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=2] [L792] 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) [L792] EXPR 3 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 3 \read(x) [L792] EXPR 3 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] 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) [L792] 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) [L793] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 3 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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=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, 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=2] [L852] FCALL, FORK 0 pthread_create(&t2270[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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270[asdf], ((void *)0), P1, ((void *)0))=-2, t2269={7:0}, t2270={5: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=2] [L852] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2269={7:0}, t2270={5: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=2] [L852] COND FALSE 0 !(asdf<2) [L853] 0 pthread_t t2271[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, 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, t2269={7:0}, t2270={5:0}, t2271={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=2] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t2271[asdf], ((void *)0), P2, ((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, 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(&t2271[asdf], ((void *)0), P2, ((void *)0))=-1, t2269={7:0}, t2270={5:0}, t2271={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=2] [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, 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, t2269={7:0}, t2270={5:0}, t2271={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=2] [L854] COND TRUE 0 asdf<2 [L806] 5 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 5 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 5 x$flush_delayed = weak$$choice2 [L809] EXPR 5 \read(x) [L809] 5 x$mem_tmp = x [L810] 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) [L810] EXPR 5 \read(x) [L810] 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) [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 5 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 5 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 5 \read(x) [L819] 5 __unbuffered_p2_EAX = x [L820] EXPR 5 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 5 \read(x) [L820] EXPR 5 x$flush_delayed ? x$mem_tmp : x [L820] 5 x = x$flush_delayed ? x$mem_tmp : x [L821] 5 x$flush_delayed = (_Bool)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=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, 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=0, 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=2] [L854] FCALL, FORK 0 pthread_create(&t2271[asdf], ((void *)0), P2, ((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=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, 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(&t2271[asdf], ((void *)0), P2, ((void *)0))=0, t2269={7:0}, t2270={5:0}, t2271={6:0}, weak$$choice1=0, weak$$choice2=0, 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=2] [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=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, 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, t2269={7:0}, t2270={5:0}, t2271={6:0}, weak$$choice1=0, weak$$choice2=0, 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=2] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L854] COND FALSE 0 !(asdf<2) [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] 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, 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=0, 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=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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, 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, t2269={7:0}, t2270={5:0}, t2271={6:0}, weak$$choice1=0, weak$$choice2=0, 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=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] 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, 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=0, 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=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 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.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1 mSDtfsCounter, 223 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, 672 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, 184 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: 315.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 302.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 845 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 674 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 627 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2524 IncrementalHoareTripleChecker+Invalid, 2744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 47 mSDtfsCounter, 2524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 255 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1295occurred in iteration=10, InterpolantAutomatonStates: 59, 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.7s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 437 NumberOfCodeBlocks, 437 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 3730 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1920 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 159/204 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, 162 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.8s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 0, 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 07:17:24,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...