/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:34:45,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:34:45,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:34:45,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:34:45,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:34:45,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:34:45,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:34:45,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:34:45,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:34:45,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:34:45,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:34:45,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:34:45,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:34:45,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:34:45,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:34:45,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:34:45,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:34:45,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:34:45,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:34:45,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:34:45,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:34:45,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:34:45,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:34:45,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:34:45,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:34:45,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:34:45,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:34:45,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:34:45,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:34:45,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:34:45,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:34:45,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:34:45,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:34:45,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:34:45,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:34:45,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:34:45,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:34:45,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:34:45,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:34:45,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:34:45,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:34:45,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:34:45,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:34:45,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:34:45,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:34:45,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:34:45,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:34:45,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:34:45,620 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:34:45,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:34:45,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:34:45,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:34:45,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:34:45,622 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:34:45,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-18 22:34:45,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:34:45,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:34:45,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:34:45,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:34:45,760 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:34:45,761 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2022-01-18 22:34:45,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065589350/c8bf182bf8e24ddc9193e6db2032ca54/FLAGbf4527c07 [2022-01-18 22:34:46,202 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:34:46,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2022-01-18 22:34:46,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065589350/c8bf182bf8e24ddc9193e6db2032ca54/FLAGbf4527c07 [2022-01-18 22:34:46,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065589350/c8bf182bf8e24ddc9193e6db2032ca54 [2022-01-18 22:34:46,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:34:46,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:34:46,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:34:46,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:34:46,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:34:46,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f87128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46, skipping insertion in model container [2022-01-18 22:34:46,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:34:46,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:34:46,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i[944,957] [2022-01-18 22:34:46,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:34:46,545 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:34:46,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i[944,957] [2022-01-18 22:34:46,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:34:46,627 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:34:46,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46 WrapperNode [2022-01-18 22:34:46,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:34:46,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:34:46,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:34:46,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:34:46,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,669 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 280 [2022-01-18 22:34:46,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:34:46,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:34:46,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:34:46,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:34:46,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:34:46,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:34:46,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:34:46,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:34:46,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (1/1) ... [2022-01-18 22:34:46,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:34:46,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:34:46,753 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) [2022-01-18 22:34:46,791 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 [2022-01-18 22:34:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:34:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:34:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:34:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:34:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:34:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:34:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:34:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:34:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:34:46,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:34:46,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:34:46,816 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:34:46,963 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:34:46,964 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:34:47,332 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:34:47,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:34:47,571 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:34:47,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:34:47 BoogieIcfgContainer [2022-01-18 22:34:47,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:34:47,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:34:47,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:34:47,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:34:47,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:34:46" (1/3) ... [2022-01-18 22:34:47,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39880e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:34:47, skipping insertion in model container [2022-01-18 22:34:47,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:34:46" (2/3) ... [2022-01-18 22:34:47,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39880e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:34:47, skipping insertion in model container [2022-01-18 22:34:47,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:34:47" (3/3) ... [2022-01-18 22:34:47,578 INFO L111 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2022-01-18 22:34:47,581 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:34:47,581 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:34:47,581 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:34:47,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,621 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,621 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,621 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,622 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,623 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,624 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,625 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,626 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,629 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,632 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,633 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,635 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,638 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,638 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,638 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,641 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,641 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,641 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,641 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,642 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,643 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,644 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,645 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,647 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,648 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,649 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,651 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,652 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,653 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,657 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,659 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,660 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,661 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,671 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,672 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,673 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,674 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,675 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,675 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,675 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,675 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:34:47,675 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:34:47,712 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:34:47,722 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:34:47,722 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:34:47,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-01-18 22:34:47,769 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2022-01-18 22:34:47,770 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:34:47,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-18 22:34:47,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-01-18 22:34:47,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-01-18 22:34:47,796 INFO L129 PetriNetUnfolder]: 0/75 cut-off events. [2022-01-18 22:34:47,797 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:34:47,797 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:47,798 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:47,798 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:47,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2065927084, now seen corresponding path program 1 times [2022-01-18 22:34:47,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:47,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860267394] [2022-01-18 22:34:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:47,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:48,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860267394] [2022-01-18 22:34:48,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860267394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:48,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:48,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:34:48,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750082979] [2022-01-18 22:34:48,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:48,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:34:48,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:48,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:34:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:34:48,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-01-18 22:34:48,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:48,103 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:48,103 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-01-18 22:34:48,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:48,179 INFO L129 PetriNetUnfolder]: 14/153 cut-off events. [2022-01-18 22:34:48,179 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-18 22:34:48,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 153 events. 14/153 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 2 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 146. Up to 25 conditions per place. [2022-01-18 22:34:48,183 INFO L132 encePairwiseOnDemand]: 112/117 looper letters, 9 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-01-18 22:34:48,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 112 transitions, 255 flow [2022-01-18 22:34:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:34:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:34:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2022-01-18 22:34:48,197 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9344729344729344 [2022-01-18 22:34:48,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2022-01-18 22:34:48,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2022-01-18 22:34:48,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:48,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2022-01-18 22:34:48,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:48,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:48,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:48,213 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 328 transitions. [2022-01-18 22:34:48,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 112 transitions, 255 flow [2022-01-18 22:34:48,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:34:48,219 INFO L242 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-01-18 22:34:48,220 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-01-18 22:34:48,224 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-01-18 22:34:48,224 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-01-18 22:34:48,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:48,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:48,224 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:48,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:34:48,225 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1913706235, now seen corresponding path program 1 times [2022-01-18 22:34:48,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:48,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119133630] [2022-01-18 22:34:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:48,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:48,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:48,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119133630] [2022-01-18 22:34:48,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119133630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:48,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:48,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:34:48,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865520914] [2022-01-18 22:34:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:48,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:34:48,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:34:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:34:48,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-01-18 22:34:48,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:48,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:48,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-01-18 22:34:48,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:49,072 INFO L129 PetriNetUnfolder]: 892/2632 cut-off events. [2022-01-18 22:34:49,072 INFO L130 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-01-18 22:34:49,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 2632 events. 892/2632 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 21333 event pairs, 250 based on Foata normal form. 0/2546 useless extension candidates. Maximal degree in co-relation 4150. Up to 450 conditions per place. [2022-01-18 22:34:49,082 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 35 selfloop transitions, 6 changer transitions 81/197 dead transitions. [2022-01-18 22:34:49,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 197 transitions, 652 flow [2022-01-18 22:34:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:34:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:34:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1271 transitions. [2022-01-18 22:34:49,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8356344510190664 [2022-01-18 22:34:49,085 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1271 transitions. [2022-01-18 22:34:49,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1271 transitions. [2022-01-18 22:34:49,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:49,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1271 transitions. [2022-01-18 22:34:49,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.76923076923077) internal successors, (1271), 13 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,091 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,091 INFO L186 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1271 transitions. [2022-01-18 22:34:49,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 197 transitions, 652 flow [2022-01-18 22:34:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 197 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:34:49,094 INFO L242 Difference]: Finished difference. Result has 141 places, 102 transitions, 288 flow [2022-01-18 22:34:49,095 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=288, PETRI_PLACES=141, PETRI_TRANSITIONS=102} [2022-01-18 22:34:49,095 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-01-18 22:34:49,095 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 102 transitions, 288 flow [2022-01-18 22:34:49,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,096 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:49,096 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:49,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:34:49,096 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1475464287, now seen corresponding path program 1 times [2022-01-18 22:34:49,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:49,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034312333] [2022-01-18 22:34:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:49,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:49,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:49,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034312333] [2022-01-18 22:34:49,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034312333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:49,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:49,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:34:49,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080203920] [2022-01-18 22:34:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:49,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:34:49,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:34:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:34:49,221 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-01-18 22:34:49,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 102 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 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) [2022-01-18 22:34:49,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:49,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-01-18 22:34:49,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:49,647 INFO L129 PetriNetUnfolder]: 470/1278 cut-off events. [2022-01-18 22:34:49,647 INFO L130 PetriNetUnfolder]: For 2123/2123 co-relation queries the response was YES. [2022-01-18 22:34:49,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 1278 events. 470/1278 cut-off events. For 2123/2123 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8297 event pairs, 92 based on Foata normal form. 30/1258 useless extension candidates. Maximal degree in co-relation 3654. Up to 295 conditions per place. [2022-01-18 22:34:49,654 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 31 selfloop transitions, 12 changer transitions 49/167 dead transitions. [2022-01-18 22:34:49,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 167 transitions, 868 flow [2022-01-18 22:34:49,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:34:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:34:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1241 transitions. [2022-01-18 22:34:49,657 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8159105851413544 [2022-01-18 22:34:49,657 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1241 transitions. [2022-01-18 22:34:49,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1241 transitions. [2022-01-18 22:34:49,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:49,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1241 transitions. [2022-01-18 22:34:49,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.46153846153847) internal successors, (1241), 13 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,662 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,662 INFO L186 Difference]: Start difference. First operand has 141 places, 102 transitions, 288 flow. Second operand 13 states and 1241 transitions. [2022-01-18 22:34:49,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 167 transitions, 868 flow [2022-01-18 22:34:49,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 167 transitions, 816 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-01-18 22:34:49,674 INFO L242 Difference]: Finished difference. Result has 140 places, 108 transitions, 405 flow [2022-01-18 22:34:49,674 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=405, PETRI_PLACES=140, PETRI_TRANSITIONS=108} [2022-01-18 22:34:49,676 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2022-01-18 22:34:49,676 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 108 transitions, 405 flow [2022-01-18 22:34:49,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 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) [2022-01-18 22:34:49,676 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:49,676 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:49,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:34:49,677 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash -368131938, now seen corresponding path program 1 times [2022-01-18 22:34:49,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:49,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754260831] [2022-01-18 22:34:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:49,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:49,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:49,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754260831] [2022-01-18 22:34:49,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754260831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:49,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:49,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:34:49,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255425286] [2022-01-18 22:34:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:49,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:34:49,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:49,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:34:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:34:49,800 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-01-18 22:34:49,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 108 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:49,800 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:49,800 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-01-18 22:34:49,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:50,297 INFO L129 PetriNetUnfolder]: 1482/3081 cut-off events. [2022-01-18 22:34:50,297 INFO L130 PetriNetUnfolder]: For 7475/7861 co-relation queries the response was YES. [2022-01-18 22:34:50,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8479 conditions, 3081 events. 1482/3081 cut-off events. For 7475/7861 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 23529 event pairs, 66 based on Foata normal form. 27/2917 useless extension candidates. Maximal degree in co-relation 8399. Up to 906 conditions per place. [2022-01-18 22:34:50,315 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 48 selfloop transitions, 7 changer transitions 48/189 dead transitions. [2022-01-18 22:34:50,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 189 transitions, 1113 flow [2022-01-18 22:34:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:34:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:34:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1021 transitions. [2022-01-18 22:34:50,317 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8726495726495727 [2022-01-18 22:34:50,317 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1021 transitions. [2022-01-18 22:34:50,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1021 transitions. [2022-01-18 22:34:50,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:50,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1021 transitions. [2022-01-18 22:34:50,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.1) internal successors, (1021), 10 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,321 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,321 INFO L186 Difference]: Start difference. First operand has 140 places, 108 transitions, 405 flow. Second operand 10 states and 1021 transitions. [2022-01-18 22:34:50,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 189 transitions, 1113 flow [2022-01-18 22:34:50,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 189 transitions, 1066 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-01-18 22:34:50,329 INFO L242 Difference]: Finished difference. Result has 139 places, 112 transitions, 434 flow [2022-01-18 22:34:50,329 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=434, PETRI_PLACES=139, PETRI_TRANSITIONS=112} [2022-01-18 22:34:50,330 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2022-01-18 22:34:50,330 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 112 transitions, 434 flow [2022-01-18 22:34:50,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,330 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:50,330 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:50,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:34:50,331 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1853155545, now seen corresponding path program 1 times [2022-01-18 22:34:50,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:50,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209894165] [2022-01-18 22:34:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:50,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:50,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:50,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209894165] [2022-01-18 22:34:50,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209894165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:50,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:50,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:34:50,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631498376] [2022-01-18 22:34:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:50,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:34:50,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:34:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:34:50,458 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-01-18 22:34:50,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 112 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:50,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-01-18 22:34:50,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:50,820 INFO L129 PetriNetUnfolder]: 731/1942 cut-off events. [2022-01-18 22:34:50,820 INFO L130 PetriNetUnfolder]: For 5090/5307 co-relation queries the response was YES. [2022-01-18 22:34:50,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6598 conditions, 1942 events. 731/1942 cut-off events. For 5090/5307 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15258 event pairs, 46 based on Foata normal form. 93/1972 useless extension candidates. Maximal degree in co-relation 6516. Up to 509 conditions per place. [2022-01-18 22:34:50,834 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 72 selfloop transitions, 20 changer transitions 18/196 dead transitions. [2022-01-18 22:34:50,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 196 transitions, 1285 flow [2022-01-18 22:34:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:34:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:34:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1124 transitions. [2022-01-18 22:34:50,836 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8733488733488733 [2022-01-18 22:34:50,836 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1124 transitions. [2022-01-18 22:34:50,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1124 transitions. [2022-01-18 22:34:50,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:50,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1124 transitions. [2022-01-18 22:34:50,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.18181818181819) internal successors, (1124), 11 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) [2022-01-18 22:34:50,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,840 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,841 INFO L186 Difference]: Start difference. First operand has 139 places, 112 transitions, 434 flow. Second operand 11 states and 1124 transitions. [2022-01-18 22:34:50,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 196 transitions, 1285 flow [2022-01-18 22:34:50,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 196 transitions, 1239 flow, removed 19 selfloop flow, removed 10 redundant places. [2022-01-18 22:34:50,849 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 616 flow [2022-01-18 22:34:50,850 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=616, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-01-18 22:34:50,851 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2022-01-18 22:34:50,851 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 616 flow [2022-01-18 22:34:50,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:50,852 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:50,852 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:50,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:34:50,852 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash -799119606, now seen corresponding path program 1 times [2022-01-18 22:34:50,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708731582] [2022-01-18 22:34:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:50,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:51,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:51,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708731582] [2022-01-18 22:34:51,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708731582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:51,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:51,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:34:51,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336650593] [2022-01-18 22:34:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:51,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:34:51,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:34:51,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:34:51,009 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 117 [2022-01-18 22:34:51,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 616 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:51,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 117 [2022-01-18 22:34:51,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:51,420 INFO L129 PetriNetUnfolder]: 663/1793 cut-off events. [2022-01-18 22:34:51,420 INFO L130 PetriNetUnfolder]: For 6092/6353 co-relation queries the response was YES. [2022-01-18 22:34:51,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6692 conditions, 1793 events. 663/1793 cut-off events. For 6092/6353 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14415 event pairs, 42 based on Foata normal form. 73/1803 useless extension candidates. Maximal degree in co-relation 6613. Up to 468 conditions per place. [2022-01-18 22:34:51,434 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 59 selfloop transitions, 24 changer transitions 23/192 dead transitions. [2022-01-18 22:34:51,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 192 transitions, 1280 flow [2022-01-18 22:34:51,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 22:34:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 22:34:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1397 transitions. [2022-01-18 22:34:51,437 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8528693528693528 [2022-01-18 22:34:51,437 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1397 transitions. [2022-01-18 22:34:51,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1397 transitions. [2022-01-18 22:34:51,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:51,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1397 transitions. [2022-01-18 22:34:51,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 99.78571428571429) internal successors, (1397), 14 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,443 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,444 INFO L186 Difference]: Start difference. First operand has 139 places, 130 transitions, 616 flow. Second operand 14 states and 1397 transitions. [2022-01-18 22:34:51,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 192 transitions, 1280 flow [2022-01-18 22:34:51,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 192 transitions, 1098 flow, removed 77 selfloop flow, removed 6 redundant places. [2022-01-18 22:34:51,470 INFO L242 Difference]: Finished difference. Result has 153 places, 130 transitions, 574 flow [2022-01-18 22:34:51,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=574, PETRI_PLACES=153, PETRI_TRANSITIONS=130} [2022-01-18 22:34:51,472 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 31 predicate places. [2022-01-18 22:34:51,472 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 130 transitions, 574 flow [2022-01-18 22:34:51,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,472 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:51,472 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:51,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:34:51,473 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash 847171476, now seen corresponding path program 1 times [2022-01-18 22:34:51,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:51,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313046705] [2022-01-18 22:34:51,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:51,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:51,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:51,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313046705] [2022-01-18 22:34:51,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313046705] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:51,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:51,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:34:51,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991202159] [2022-01-18 22:34:51,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:51,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:34:51,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:51,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:34:51,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:34:51,646 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 117 [2022-01-18 22:34:51,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 130 transitions, 574 flow. Second operand has 10 states, 10 states have (on average 92.2) internal successors, (922), 10 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:51,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 117 [2022-01-18 22:34:51,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:51,901 INFO L129 PetriNetUnfolder]: 241/1314 cut-off events. [2022-01-18 22:34:51,901 INFO L130 PetriNetUnfolder]: For 2247/2384 co-relation queries the response was YES. [2022-01-18 22:34:51,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 1314 events. 241/1314 cut-off events. For 2247/2384 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12367 event pairs, 6 based on Foata normal form. 2/1218 useless extension candidates. Maximal degree in co-relation 3468. Up to 172 conditions per place. [2022-01-18 22:34:51,911 INFO L132 encePairwiseOnDemand]: 107/117 looper letters, 21 selfloop transitions, 3 changer transitions 34/159 dead transitions. [2022-01-18 22:34:51,911 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 159 transitions, 870 flow [2022-01-18 22:34:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:34:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:34:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 948 transitions. [2022-01-18 22:34:51,914 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8102564102564103 [2022-01-18 22:34:51,914 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 948 transitions. [2022-01-18 22:34:51,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 948 transitions. [2022-01-18 22:34:51,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:51,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 948 transitions. [2022-01-18 22:34:51,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.8) internal successors, (948), 10 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,918 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,918 INFO L186 Difference]: Start difference. First operand has 153 places, 130 transitions, 574 flow. Second operand 10 states and 948 transitions. [2022-01-18 22:34:51,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 159 transitions, 870 flow [2022-01-18 22:34:51,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 159 transitions, 754 flow, removed 44 selfloop flow, removed 13 redundant places. [2022-01-18 22:34:51,932 INFO L242 Difference]: Finished difference. Result has 154 places, 124 transitions, 497 flow [2022-01-18 22:34:51,933 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=497, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2022-01-18 22:34:51,933 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 32 predicate places. [2022-01-18 22:34:51,933 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 497 flow [2022-01-18 22:34:51,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.2) internal successors, (922), 10 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:51,934 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:51,934 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:51,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:34:51,934 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1137011548, now seen corresponding path program 2 times [2022-01-18 22:34:51,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:51,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54654350] [2022-01-18 22:34:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:51,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:52,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54654350] [2022-01-18 22:34:52,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54654350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:52,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:52,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:34:52,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997334473] [2022-01-18 22:34:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:52,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:34:52,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:52,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:34:52,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:34:52,032 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-01-18 22:34:52,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:52,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-01-18 22:34:52,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:52,189 INFO L129 PetriNetUnfolder]: 168/1003 cut-off events. [2022-01-18 22:34:52,189 INFO L130 PetriNetUnfolder]: For 1108/1116 co-relation queries the response was YES. [2022-01-18 22:34:52,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2534 conditions, 1003 events. 168/1003 cut-off events. For 1108/1116 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9058 event pairs, 8 based on Foata normal form. 1/953 useless extension candidates. Maximal degree in co-relation 2507. Up to 135 conditions per place. [2022-01-18 22:34:52,193 INFO L132 encePairwiseOnDemand]: 105/117 looper letters, 16 selfloop transitions, 8 changer transitions 14/135 dead transitions. [2022-01-18 22:34:52,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 135 transitions, 624 flow [2022-01-18 22:34:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:34:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:34:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2022-01-18 22:34:52,195 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8058608058608059 [2022-01-18 22:34:52,195 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2022-01-18 22:34:52,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2022-01-18 22:34:52,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:52,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2022-01-18 22:34:52,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,197 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,197 INFO L186 Difference]: Start difference. First operand has 154 places, 124 transitions, 497 flow. Second operand 7 states and 660 transitions. [2022-01-18 22:34:52,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 135 transitions, 624 flow [2022-01-18 22:34:52,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 135 transitions, 571 flow, removed 15 selfloop flow, removed 9 redundant places. [2022-01-18 22:34:52,206 INFO L242 Difference]: Finished difference. Result has 149 places, 120 transitions, 461 flow [2022-01-18 22:34:52,206 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=461, PETRI_PLACES=149, PETRI_TRANSITIONS=120} [2022-01-18 22:34:52,207 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 27 predicate places. [2022-01-18 22:34:52,207 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 120 transitions, 461 flow [2022-01-18 22:34:52,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,207 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:52,207 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:52,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:34:52,208 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1354269402, now seen corresponding path program 3 times [2022-01-18 22:34:52,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676547149] [2022-01-18 22:34:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:52,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:34:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:34:52,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:34:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676547149] [2022-01-18 22:34:52,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676547149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:34:52,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:34:52,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-18 22:34:52,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130076884] [2022-01-18 22:34:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:34:52,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-18 22:34:52,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:34:52,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-18 22:34:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-18 22:34:52,494 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-01-18 22:34:52,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 120 transitions, 461 flow. Second operand has 13 states, 13 states have (on average 89.84615384615384) internal successors, (1168), 13 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:34:52,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-01-18 22:34:52,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:34:52,699 INFO L129 PetriNetUnfolder]: 61/406 cut-off events. [2022-01-18 22:34:52,700 INFO L130 PetriNetUnfolder]: For 386/397 co-relation queries the response was YES. [2022-01-18 22:34:52,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 406 events. 61/406 cut-off events. For 386/397 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2430 event pairs, 0 based on Foata normal form. 1/389 useless extension candidates. Maximal degree in co-relation 964. Up to 60 conditions per place. [2022-01-18 22:34:52,701 INFO L132 encePairwiseOnDemand]: 103/117 looper letters, 15 selfloop transitions, 9 changer transitions 23/126 dead transitions. [2022-01-18 22:34:52,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 126 transitions, 545 flow [2022-01-18 22:34:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-18 22:34:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-18 22:34:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1263 transitions. [2022-01-18 22:34:52,703 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7710622710622711 [2022-01-18 22:34:52,703 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1263 transitions. [2022-01-18 22:34:52,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1263 transitions. [2022-01-18 22:34:52,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:34:52,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1263 transitions. [2022-01-18 22:34:52,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.21428571428571) internal successors, (1263), 14 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,709 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,709 INFO L186 Difference]: Start difference. First operand has 149 places, 120 transitions, 461 flow. Second operand 14 states and 1263 transitions. [2022-01-18 22:34:52,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 126 transitions, 545 flow [2022-01-18 22:34:52,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 126 transitions, 487 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-01-18 22:34:52,713 INFO L242 Difference]: Finished difference. Result has 152 places, 103 transitions, 329 flow [2022-01-18 22:34:52,713 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=329, PETRI_PLACES=152, PETRI_TRANSITIONS=103} [2022-01-18 22:34:52,714 INFO L334 CegarLoopForPetriNet]: 122 programPoint places, 30 predicate places. [2022-01-18 22:34:52,714 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 103 transitions, 329 flow [2022-01-18 22:34:52,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.84615384615384) internal successors, (1168), 13 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:34:52,714 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:34:52,714 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:52,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:34:52,715 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:34:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:34:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1710526232, now seen corresponding path program 4 times [2022-01-18 22:34:52,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:34:52,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890250450] [2022-01-18 22:34:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:34:52,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:34:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:34:52,759 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:34:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:34:52,824 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:34:52,824 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:34:52,825 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:34:52,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:34:52,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:34:52,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:34:52,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:34:52,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:34:52,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:34:52,830 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-01-18 22:34:52,833 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:34:52,833 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:34:52,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:34:52 BasicIcfg [2022-01-18 22:34:52,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:34:52,957 INFO L158 Benchmark]: Toolchain (without parser) took 6719.70ms. Allocated memory was 379.6MB in the beginning and 715.1MB in the end (delta: 335.5MB). Free memory was 323.1MB in the beginning and 461.6MB in the end (delta: -138.6MB). Peak memory consumption was 196.7MB. Max. memory is 16.0GB. [2022-01-18 22:34:52,957 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory was 340.9MB in the beginning and 340.8MB in the end (delta: 69.4kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:34:52,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.40ms. Allocated memory was 379.6MB in the beginning and 492.8MB in the end (delta: 113.2MB). Free memory was 322.9MB in the beginning and 451.9MB in the end (delta: -129.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.0GB. [2022-01-18 22:34:52,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.51ms. Allocated memory is still 492.8MB. Free memory was 451.9MB in the beginning and 448.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:34:52,958 INFO L158 Benchmark]: Boogie Preprocessor took 28.85ms. Allocated memory is still 492.8MB. Free memory was 448.8MB in the beginning and 446.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:34:52,958 INFO L158 Benchmark]: RCFGBuilder took 873.29ms. Allocated memory is still 492.8MB. Free memory was 446.7MB in the beginning and 346.0MB in the end (delta: 100.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.0GB. [2022-01-18 22:34:52,958 INFO L158 Benchmark]: TraceAbstraction took 5382.56ms. Allocated memory was 492.8MB in the beginning and 715.1MB in the end (delta: 222.3MB). Free memory was 344.9MB in the beginning and 461.6MB in the end (delta: -116.7MB). Peak memory consumption was 108.7MB. Max. memory is 16.0GB. [2022-01-18 22:34:52,963 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 379.6MB. Free memory was 340.9MB in the beginning and 340.8MB in the end (delta: 69.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 387.40ms. Allocated memory was 379.6MB in the beginning and 492.8MB in the end (delta: 113.2MB). Free memory was 322.9MB in the beginning and 451.9MB in the end (delta: -129.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.51ms. Allocated memory is still 492.8MB. Free memory was 451.9MB in the beginning and 448.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.85ms. Allocated memory is still 492.8MB. Free memory was 448.8MB in the beginning and 446.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 873.29ms. Allocated memory is still 492.8MB. Free memory was 446.7MB in the beginning and 346.0MB in the end (delta: 100.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.0GB. * TraceAbstraction took 5382.56ms. Allocated memory was 492.8MB in the beginning and 715.1MB in the end (delta: 222.3MB). Free memory was 344.9MB in the beginning and 461.6MB in the end (delta: -116.7MB). Peak memory consumption was 108.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t156; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=-2, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t157; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=-1, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t158; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = y [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 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: 5.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 513 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1082 IncrementalHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 102 mSDtfsCounter, 1082 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=616occurred in iteration=5, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 833 NumberOfCodeBlocks, 833 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-01-18 22:34:52,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...