/usr/bin/java -Xmx8000000000 -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-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:29:44,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:29:44,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:29:44,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:29:44,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:29:44,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:29:44,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:29:44,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:29:44,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:29:44,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:29:44,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:29:44,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:29:44,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:29:44,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:29:44,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:29:44,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:29:44,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:29:44,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:29:44,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:29:44,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:29:44,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:29:44,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:29:44,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:29:44,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:29:44,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:29:44,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:29:44,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:29:44,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:29:44,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:29:44,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:29:44,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:29:44,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:29:44,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:29:44,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:29:44,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:29:44,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:29:44,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:29:44,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:29:44,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:29:44,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:29:44,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:29:44,723 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-FA-NoLbe.epf [2021-08-21 11:29:44,758 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:29:44,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:29:44,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:29:44,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:29:44,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:29:44,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:29:44,762 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:29:44,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:29:44,763 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:29:44,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:29:44,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:29:44,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:29:44,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:29:44,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:29:44,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:29:44,765 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:29:44,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:29:44,765 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:29:44,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:29:44,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:29:44,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:29:44,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:29:44,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:29:44,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:29:44,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:29:44,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:29:44,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:29:44,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:29:44,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:29:44,767 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:29:44,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:29:44,767 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 [2021-08-21 11:29:45,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:29:45,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:29:45,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:29:45,129 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:29:45,130 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:29:45,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-08-21 11:29:45,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6eda6235/55e4adbc23d2456dbb5ad0f8acd429a9/FLAG98b3ff18d [2021-08-21 11:29:45,770 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:29:45,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-08-21 11:29:45,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6eda6235/55e4adbc23d2456dbb5ad0f8acd429a9/FLAG98b3ff18d [2021-08-21 11:29:46,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6eda6235/55e4adbc23d2456dbb5ad0f8acd429a9 [2021-08-21 11:29:46,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:29:46,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:29:46,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:29:46,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:29:46,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:29:46,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f090e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46, skipping insertion in model container [2021-08-21 11:29:46,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:29:46,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:29:46,289 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i[949,962] [2021-08-21 11:29:46,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:29:46,491 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:29:46,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i[949,962] [2021-08-21 11:29:46,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:29:46,611 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:29:46,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46 WrapperNode [2021-08-21 11:29:46,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:29:46,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:29:46,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:29:46,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:29:46,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:29:46,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:29:46,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:29:46,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:29:46,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:29:46,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:29:46,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:29:46,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:29:46,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (1/1) ... [2021-08-21 11:29:46,775 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:29:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:29:46,797 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) [2021-08-21 11:29:46,820 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 [2021-08-21 11:29:46,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:29:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 11:29:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:29:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:29:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 11:29:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 11:29:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 11:29:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 11:29:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 11:29:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 11:29:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:29:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 11:29:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:29:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:29:46,850 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 11:29:48,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:29:48,626 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 11:29:48,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:29:48 BoogieIcfgContainer [2021-08-21 11:29:48,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:29:48,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:29:48,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:29:48,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:29:48,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:29:46" (1/3) ... [2021-08-21 11:29:48,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f5867a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:29:48, skipping insertion in model container [2021-08-21 11:29:48,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:29:46" (2/3) ... [2021-08-21 11:29:48,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f5867a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:29:48, skipping insertion in model container [2021-08-21 11:29:48,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:29:48" (3/3) ... [2021-08-21 11:29:48,637 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2021-08-21 11:29:48,642 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:29:48,643 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:29:48,643 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 11:29:48,643 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:29:48,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,684 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,690 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,690 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,690 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,703 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,703 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,719 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,722 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:29:48,723 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 11:29:48,772 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:29:48,780 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=true, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-21 11:29:48,780 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 11:29:48,801 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 115 transitions, 245 flow [2021-08-21 11:29:49,460 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17436 states, 17433 states have (on average 3.6173923019560603) internal successors, (63062), 17435 states have internal predecessors, (63062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 17436 states, 17433 states have (on average 3.6173923019560603) internal successors, (63062), 17435 states have internal predecessors, (63062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-21 11:29:49,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:49,519 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:49,520 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1248369667, now seen corresponding path program 1 times [2021-08-21 11:29:49,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:49,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797407558] [2021-08-21 11:29:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:49,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:49,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:49,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797407558] [2021-08-21 11:29:49,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797407558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:49,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:49,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 11:29:49,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14498162] [2021-08-21 11:29:49,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 11:29:49,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:49,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 11:29:49,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:29:49,895 INFO L87 Difference]: Start difference. First operand has 17436 states, 17433 states have (on average 3.6173923019560603) internal successors, (63062), 17435 states have internal predecessors, (63062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:50,232 INFO L93 Difference]: Finished difference Result 15060 states and 53183 transitions. [2021-08-21 11:29:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:29:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-08-21 11:29:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:50,427 INFO L225 Difference]: With dead ends: 15060 [2021-08-21 11:29:50,427 INFO L226 Difference]: Without dead ends: 12660 [2021-08-21 11:29:50,428 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:29:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12660 states. [2021-08-21 11:29:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12660 to 12660. [2021-08-21 11:29:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12660 states, 12659 states have (on average 3.55502014377123) internal successors, (45003), 12659 states have internal predecessors, (45003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 45003 transitions. [2021-08-21 11:29:51,190 INFO L78 Accepts]: Start accepts. Automaton has 12660 states and 45003 transitions. Word has length 53 [2021-08-21 11:29:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:51,193 INFO L470 AbstractCegarLoop]: Abstraction has 12660 states and 45003 transitions. [2021-08-21 11:29:51,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12660 states and 45003 transitions. [2021-08-21 11:29:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:29:51,218 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:51,218 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:51,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:29:51,219 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1271704476, now seen corresponding path program 1 times [2021-08-21 11:29:51,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:51,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477810121] [2021-08-21 11:29:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:51,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:51,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:51,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477810121] [2021-08-21 11:29:51,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477810121] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:51,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:51,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:29:51,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426971396] [2021-08-21 11:29:51,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:29:51,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:51,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:29:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:29:51,563 INFO L87 Difference]: Start difference. First operand 12660 states and 45003 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:52,012 INFO L93 Difference]: Finished difference Result 13940 states and 49035 transitions. [2021-08-21 11:29:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:29:52,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 11:29:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:52,088 INFO L225 Difference]: With dead ends: 13940 [2021-08-21 11:29:52,088 INFO L226 Difference]: Without dead ends: 10740 [2021-08-21 11:29:52,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 99.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:29:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2021-08-21 11:29:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10740. [2021-08-21 11:29:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10740 states, 10739 states have (on average 3.5156904739733683) internal successors, (37755), 10739 states have internal predecessors, (37755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10740 states to 10740 states and 37755 transitions. [2021-08-21 11:29:52,549 INFO L78 Accepts]: Start accepts. Automaton has 10740 states and 37755 transitions. Word has length 72 [2021-08-21 11:29:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:52,550 INFO L470 AbstractCegarLoop]: Abstraction has 10740 states and 37755 transitions. [2021-08-21 11:29:52,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 10740 states and 37755 transitions. [2021-08-21 11:29:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 11:29:52,571 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:52,571 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:52,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:29:52,572 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:52,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1498320260, now seen corresponding path program 1 times [2021-08-21 11:29:52,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:52,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779501225] [2021-08-21 11:29:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:52,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:52,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:52,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779501225] [2021-08-21 11:29:52,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779501225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:52,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:52,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:29:52,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884527368] [2021-08-21 11:29:52,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:29:52,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:29:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:29:52,984 INFO L87 Difference]: Start difference. First operand 10740 states and 37755 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:53,465 INFO L93 Difference]: Finished difference Result 12660 states and 44167 transitions. [2021-08-21 11:29:53,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 11:29:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 11:29:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:53,524 INFO L225 Difference]: With dead ends: 12660 [2021-08-21 11:29:53,524 INFO L226 Difference]: Without dead ends: 10740 [2021-08-21 11:29:53,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 158.3ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:29:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2021-08-21 11:29:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10668. [2021-08-21 11:29:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 3.5124214868285364) internal successors, (37467), 10667 states have internal predecessors, (37467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 37467 transitions. [2021-08-21 11:29:53,997 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 37467 transitions. Word has length 76 [2021-08-21 11:29:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:53,997 INFO L470 AbstractCegarLoop]: Abstraction has 10668 states and 37467 transitions. [2021-08-21 11:29:53,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 37467 transitions. [2021-08-21 11:29:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 11:29:54,021 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:54,022 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:54,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:29:54,022 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -982069315, now seen corresponding path program 1 times [2021-08-21 11:29:54,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:54,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757292196] [2021-08-21 11:29:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:54,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:54,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:54,206 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757292196] [2021-08-21 11:29:54,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757292196] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:54,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:54,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:29:54,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512104549] [2021-08-21 11:29:54,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:29:54,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:29:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:29:54,211 INFO L87 Difference]: Start difference. First operand 10668 states and 37467 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:54,385 INFO L93 Difference]: Finished difference Result 11460 states and 39931 transitions. [2021-08-21 11:29:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:29:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-21 11:29:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:54,533 INFO L225 Difference]: With dead ends: 11460 [2021-08-21 11:29:54,533 INFO L226 Difference]: Without dead ends: 9588 [2021-08-21 11:29:54,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 87.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:29:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9588 states. [2021-08-21 11:29:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9588 to 9588. [2021-08-21 11:29:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9588 states, 9587 states have (on average 3.4925419839365808) internal successors, (33483), 9587 states have internal predecessors, (33483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9588 states to 9588 states and 33483 transitions. [2021-08-21 11:29:54,847 INFO L78 Accepts]: Start accepts. Automaton has 9588 states and 33483 transitions. Word has length 78 [2021-08-21 11:29:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:54,848 INFO L470 AbstractCegarLoop]: Abstraction has 9588 states and 33483 transitions. [2021-08-21 11:29:54,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9588 states and 33483 transitions. [2021-08-21 11:29:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-21 11:29:54,873 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:54,874 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:54,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:29:54,874 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash 387693599, now seen corresponding path program 1 times [2021-08-21 11:29:54,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:54,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912301738] [2021-08-21 11:29:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:54,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:55,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:55,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912301738] [2021-08-21 11:29:55,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912301738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:55,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:55,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:29:55,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137419330] [2021-08-21 11:29:55,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:29:55,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:55,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:29:55,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:29:55,202 INFO L87 Difference]: Start difference. First operand 9588 states and 33483 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:55,463 INFO L93 Difference]: Finished difference Result 10668 states and 36999 transitions. [2021-08-21 11:29:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:29:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-21 11:29:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:55,500 INFO L225 Difference]: With dead ends: 10668 [2021-08-21 11:29:55,500 INFO L226 Difference]: Without dead ends: 9516 [2021-08-21 11:29:55,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 243.0ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:29:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9516 states. [2021-08-21 11:29:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9516 to 9516. [2021-08-21 11:29:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9516 states, 9515 states have (on average 3.488702049395691) internal successors, (33195), 9515 states have internal predecessors, (33195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9516 states to 9516 states and 33195 transitions. [2021-08-21 11:29:55,881 INFO L78 Accepts]: Start accepts. Automaton has 9516 states and 33195 transitions. Word has length 80 [2021-08-21 11:29:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:55,881 INFO L470 AbstractCegarLoop]: Abstraction has 9516 states and 33195 transitions. [2021-08-21 11:29:55,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 9516 states and 33195 transitions. [2021-08-21 11:29:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 11:29:55,919 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:55,919 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:55,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:29:55,919 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1837011168, now seen corresponding path program 1 times [2021-08-21 11:29:55,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:55,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085616398] [2021-08-21 11:29:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:55,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:56,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:56,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085616398] [2021-08-21 11:29:56,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085616398] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:56,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:56,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 11:29:56,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681608823] [2021-08-21 11:29:56,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 11:29:56,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:56,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 11:29:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:29:56,308 INFO L87 Difference]: Start difference. First operand 9516 states and 33195 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:56,887 INFO L93 Difference]: Finished difference Result 10800 states and 37527 transitions. [2021-08-21 11:29:56,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-21 11:29:56,888 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-21 11:29:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:57,024 INFO L225 Difference]: With dead ends: 10800 [2021-08-21 11:29:57,024 INFO L226 Difference]: Without dead ends: 9760 [2021-08-21 11:29:57,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 331.2ms TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2021-08-21 11:29:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2021-08-21 11:29:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 9760. [2021-08-21 11:29:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9760 states, 9759 states have (on average 3.4945178809304234) internal successors, (34103), 9759 states have internal predecessors, (34103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 34103 transitions. [2021-08-21 11:29:57,299 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 34103 transitions. Word has length 82 [2021-08-21 11:29:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:57,300 INFO L470 AbstractCegarLoop]: Abstraction has 9760 states and 34103 transitions. [2021-08-21 11:29:57,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 34103 transitions. [2021-08-21 11:29:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 11:29:57,324 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:57,325 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:57,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:29:57,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1126966144, now seen corresponding path program 1 times [2021-08-21 11:29:57,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:57,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904024953] [2021-08-21 11:29:57,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:57,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:57,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:57,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904024953] [2021-08-21 11:29:57,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904024953] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:57,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:57,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:29:57,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028198635] [2021-08-21 11:29:57,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:29:57,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:57,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:29:57,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:29:57,458 INFO L87 Difference]: Start difference. First operand 9760 states and 34103 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:57,753 INFO L93 Difference]: Finished difference Result 14500 states and 50310 transitions. [2021-08-21 11:29:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-21 11:29:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-21 11:29:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:57,789 INFO L225 Difference]: With dead ends: 14500 [2021-08-21 11:29:57,789 INFO L226 Difference]: Without dead ends: 10660 [2021-08-21 11:29:57,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:29:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10660 states. [2021-08-21 11:29:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10660 to 9760. [2021-08-21 11:29:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9760 states, 9759 states have (on average 3.4281176350035865) internal successors, (33455), 9759 states have internal predecessors, (33455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 33455 transitions. [2021-08-21 11:29:58,126 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 33455 transitions. Word has length 82 [2021-08-21 11:29:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:58,127 INFO L470 AbstractCegarLoop]: Abstraction has 9760 states and 33455 transitions. [2021-08-21 11:29:58,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 33455 transitions. [2021-08-21 11:29:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 11:29:58,146 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:58,146 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:58,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:29:58,147 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash 494474122, now seen corresponding path program 2 times [2021-08-21 11:29:58,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:58,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687385901] [2021-08-21 11:29:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:58,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:58,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:58,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687385901] [2021-08-21 11:29:58,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687385901] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:58,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:58,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:29:58,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419684407] [2021-08-21 11:29:58,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:29:58,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:58,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:29:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:29:58,259 INFO L87 Difference]: Start difference. First operand 9760 states and 33455 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:58,495 INFO L93 Difference]: Finished difference Result 11320 states and 37964 transitions. [2021-08-21 11:29:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:29:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-21 11:29:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:58,517 INFO L225 Difference]: With dead ends: 11320 [2021-08-21 11:29:58,517 INFO L226 Difference]: Without dead ends: 7960 [2021-08-21 11:29:58,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:29:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7960 states. [2021-08-21 11:29:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7960 to 7860. [2021-08-21 11:29:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7860 states, 7859 states have (on average 3.3209059676803663) internal successors, (26099), 7859 states have internal predecessors, (26099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7860 states to 7860 states and 26099 transitions. [2021-08-21 11:29:58,740 INFO L78 Accepts]: Start accepts. Automaton has 7860 states and 26099 transitions. Word has length 82 [2021-08-21 11:29:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:58,740 INFO L470 AbstractCegarLoop]: Abstraction has 7860 states and 26099 transitions. [2021-08-21 11:29:58,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7860 states and 26099 transitions. [2021-08-21 11:29:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-21 11:29:58,756 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:58,756 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:58,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:29:58,756 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash -623651305, now seen corresponding path program 1 times [2021-08-21 11:29:58,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:58,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642654994] [2021-08-21 11:29:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:58,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:58,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:58,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642654994] [2021-08-21 11:29:58,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642654994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:58,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:58,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:29:58,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650480885] [2021-08-21 11:29:58,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:29:58,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:29:58,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:29:58,894 INFO L87 Difference]: Start difference. First operand 7860 states and 26099 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:59,065 INFO L93 Difference]: Finished difference Result 7320 states and 23651 transitions. [2021-08-21 11:29:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:29:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-21 11:29:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:59,080 INFO L225 Difference]: With dead ends: 7320 [2021-08-21 11:29:59,081 INFO L226 Difference]: Without dead ends: 5052 [2021-08-21 11:29:59,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:29:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5052 states. [2021-08-21 11:29:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5052 to 5004. [2021-08-21 11:29:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 5003 states have (on average 3.167899260443734) internal successors, (15849), 5003 states have internal predecessors, (15849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 15849 transitions. [2021-08-21 11:29:59,301 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 15849 transitions. Word has length 83 [2021-08-21 11:29:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:59,302 INFO L470 AbstractCegarLoop]: Abstraction has 5004 states and 15849 transitions. [2021-08-21 11:29:59,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 15849 transitions. [2021-08-21 11:29:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-21 11:29:59,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:59,309 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:59,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:29:59,310 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -59821258, now seen corresponding path program 1 times [2021-08-21 11:29:59,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:59,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182548155] [2021-08-21 11:29:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:59,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:59,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:59,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182548155] [2021-08-21 11:29:59,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182548155] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:59,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:59,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:29:59,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52946900] [2021-08-21 11:29:59,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:29:59,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:29:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:29:59,465 INFO L87 Difference]: Start difference. First operand 5004 states and 15849 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:59,620 INFO L93 Difference]: Finished difference Result 4176 states and 13044 transitions. [2021-08-21 11:29:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:29:59,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-21 11:29:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:59,626 INFO L225 Difference]: With dead ends: 4176 [2021-08-21 11:29:59,627 INFO L226 Difference]: Without dead ends: 2424 [2021-08-21 11:29:59,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:29:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2021-08-21 11:29:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2424. [2021-08-21 11:29:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2423 states have (on average 3.0107304993809327) internal successors, (7295), 2423 states have internal predecessors, (7295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 7295 transitions. [2021-08-21 11:29:59,676 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 7295 transitions. Word has length 86 [2021-08-21 11:29:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:59,677 INFO L470 AbstractCegarLoop]: Abstraction has 2424 states and 7295 transitions. [2021-08-21 11:29:59,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 7295 transitions. [2021-08-21 11:29:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-21 11:29:59,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:59,685 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:59,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:29:59,685 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1976447763, now seen corresponding path program 1 times [2021-08-21 11:29:59,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:59,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836948784] [2021-08-21 11:29:59,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:59,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:29:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:29:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:29:59,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:29:59,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836948784] [2021-08-21 11:29:59,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836948784] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:29:59,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:29:59,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:29:59,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012142393] [2021-08-21 11:29:59,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:29:59,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:29:59,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:29:59,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:29:59,842 INFO L87 Difference]: Start difference. First operand 2424 states and 7295 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:29:59,934 INFO L93 Difference]: Finished difference Result 3144 states and 9500 transitions. [2021-08-21 11:29:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-21 11:29:59,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-08-21 11:29:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:29:59,938 INFO L225 Difference]: With dead ends: 3144 [2021-08-21 11:29:59,938 INFO L226 Difference]: Without dead ends: 1332 [2021-08-21 11:29:59,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:29:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2021-08-21 11:29:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2021-08-21 11:29:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1331 states have (on average 2.902329075882795) internal successors, (3863), 1331 states have internal predecessors, (3863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 3863 transitions. [2021-08-21 11:29:59,960 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 3863 transitions. Word has length 91 [2021-08-21 11:29:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:29:59,960 INFO L470 AbstractCegarLoop]: Abstraction has 1332 states and 3863 transitions. [2021-08-21 11:29:59,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:29:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 3863 transitions. [2021-08-21 11:29:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-21 11:29:59,963 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:29:59,963 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:29:59,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:29:59,963 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:29:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:29:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1809556845, now seen corresponding path program 2 times [2021-08-21 11:29:59,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:29:59,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972893534] [2021-08-21 11:29:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:29:59,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:30:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:30:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:30:00,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:30:00,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972893534] [2021-08-21 11:30:00,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972893534] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:30:00,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:30:00,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-21 11:30:00,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585918569] [2021-08-21 11:30:00,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-21 11:30:00,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:30:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-21 11:30:00,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:30:00,360 INFO L87 Difference]: Start difference. First operand 1332 states and 3863 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:30:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:30:00,646 INFO L93 Difference]: Finished difference Result 2514 states and 7414 transitions. [2021-08-21 11:30:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 11:30:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-08-21 11:30:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:30:00,649 INFO L225 Difference]: With dead ends: 2514 [2021-08-21 11:30:00,650 INFO L226 Difference]: Without dead ends: 1540 [2021-08-21 11:30:00,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 221.3ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:30:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2021-08-21 11:30:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 976. [2021-08-21 11:30:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 2.7887179487179488) internal successors, (2719), 975 states have internal predecessors, (2719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:30:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 2719 transitions. [2021-08-21 11:30:00,665 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 2719 transitions. Word has length 91 [2021-08-21 11:30:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:30:00,665 INFO L470 AbstractCegarLoop]: Abstraction has 976 states and 2719 transitions. [2021-08-21 11:30:00,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:30:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 2719 transitions. [2021-08-21 11:30:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-21 11:30:00,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:30:00,667 INFO L512 BasicCegarLoop]: 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] [2021-08-21 11:30:00,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:30:00,668 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:30:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:30:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2067637613, now seen corresponding path program 3 times [2021-08-21 11:30:00,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:30:00,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464686737] [2021-08-21 11:30:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:30:00,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:30:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:30:00,712 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 11:30:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:30:00,797 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 11:30:00,797 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 11:30:00,798 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:30:00,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:30:00,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:30:00,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 11:30:00,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 11:30:00,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:30:00,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:30:00,807 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:30:00,807 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:30:00,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:30:00 BasicIcfg [2021-08-21 11:30:00,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:30:00,953 INFO L168 Benchmark]: Toolchain (without parser) took 14887.24 ms. Allocated memory was 179.3 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 142.2 MB in the beginning and 3.6 GB in the end (delta: -3.4 GB). Peak memory consumption was 515.5 MB. Max. memory is 8.0 GB. [2021-08-21 11:30:00,953 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 179.3 MB. Free memory is still 160.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:30:00,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.28 ms. Allocated memory is still 179.3 MB. Free memory was 142.1 MB in the beginning and 148.9 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-21 11:30:00,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.84 ms. Allocated memory is still 179.3 MB. Free memory was 148.9 MB in the beginning and 145.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:30:00,954 INFO L168 Benchmark]: Boogie Preprocessor took 60.25 ms. Allocated memory is still 179.3 MB. Free memory was 145.8 MB in the beginning and 143.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:30:00,956 INFO L168 Benchmark]: RCFGBuilder took 1862.48 ms. Allocated memory was 179.3 MB in the beginning and 225.4 MB in the end (delta: 46.1 MB). Free memory was 143.4 MB in the beginning and 156.0 MB in the end (delta: -12.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 8.0 GB. [2021-08-21 11:30:00,956 INFO L168 Benchmark]: TraceAbstraction took 12320.25 ms. Allocated memory was 225.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 155.5 MB in the beginning and 3.6 GB in the end (delta: -3.4 GB). Peak memory consumption was 482.3 MB. Max. memory is 8.0 GB. [2021-08-21 11:30:00,958 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.18 ms. Allocated memory is still 179.3 MB. Free memory is still 160.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 542.28 ms. Allocated memory is still 179.3 MB. Free memory was 142.1 MB in the beginning and 148.9 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 84.84 ms. Allocated memory is still 179.3 MB. Free memory was 148.9 MB in the beginning and 145.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.25 ms. Allocated memory is still 179.3 MB. Free memory was 145.8 MB in the beginning and 143.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1862.48 ms. Allocated memory was 179.3 MB in the beginning and 225.4 MB in the end (delta: 46.1 MB). Free memory was 143.4 MB in the beginning and 156.0 MB in the end (delta: -12.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12320.25 ms. Allocated memory was 225.4 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 155.5 MB in the beginning and 3.6 GB in the end (delta: -3.4 GB). Peak memory consumption was 482.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L722] 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, a=0, b=0, main$tmp_guard0=0] [L723] 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, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L737] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L738] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L739] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L740] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L741] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L743] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t891; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t891, ((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, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t892, ((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, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t893, ((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, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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: 845]: 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: 841]: 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: 843]: 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, 146 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12034.0ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 268.3ms, AutomataDifference: 4321.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 679.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1765 SDtfs, 2550 SDslu, 6357 SDs, 0 SdLazy, 711 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 856.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1553.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=17436occurred in iteration=0, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3513.7ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1684 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.5ms SsaConstructionTime, 641.7ms SatisfiabilityAnalysisTime, 2169.9ms InterpolantComputationTime, 1047 NumberOfCodeBlocks, 1047 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 4403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-21 11:30:00,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...