/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:51:06,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:51:06,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:51:06,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:51:06,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:51:06,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:51:06,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:51:06,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:51:06,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:51:06,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:51:06,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:51:06,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:51:06,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:51:06,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:51:06,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:51:06,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:51:06,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:51:06,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:51:06,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:51:06,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:51:06,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:51:06,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:51:06,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:51:06,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:51:06,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:51:06,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:51:06,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:51:06,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:51:06,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:51:06,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:51:06,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:51:06,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:51:06,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:51:06,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:51:06,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:51:06,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:51:06,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:51:06,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:51:06,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:51:06,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:51:06,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:51:06,826 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 [2019-12-19 03:51:06,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:51:06,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:51:06,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:51:06,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:51:06,844 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:51:06,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:51:06,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:51:06,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:51:06,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:51:06,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:51:06,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:51:06,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:51:06,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:51:06,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:51:06,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:51:06,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:51:06,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:51:06,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:51:06,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:51:06,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:51:06,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:51:06,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:51:06,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:51:06,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:51:06,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:51:06,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:51:06,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:51:06,849 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:51:06,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:51:06,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:51:07,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:51:07,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:51:07,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:51:07,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:51:07,177 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:51:07,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-19 03:51:07,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e806f946/1927c7b4edb048bca77e4b55a5d8ea0f/FLAG0c3227a9c [2019-12-19 03:51:07,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:51:07,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-19 03:51:07,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e806f946/1927c7b4edb048bca77e4b55a5d8ea0f/FLAG0c3227a9c [2019-12-19 03:51:08,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e806f946/1927c7b4edb048bca77e4b55a5d8ea0f [2019-12-19 03:51:08,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:51:08,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:51:08,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:51:08,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:51:08,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:51:08,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8bbf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08, skipping insertion in model container [2019-12-19 03:51:08,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:51:08,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:51:08,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:51:08,742 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:51:08,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:51:08,917 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:51:08,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08 WrapperNode [2019-12-19 03:51:08,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:51:08,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:51:08,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:51:08,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:51:08,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:51:08,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:51:08,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:51:08,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:51:08,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:08,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:09,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:09,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:09,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... [2019-12-19 03:51:09,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:51:09,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:51:09,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:51:09,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:51:09,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:51:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:51:09,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:51:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:51:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:51:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:51:09,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:51:09,087 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:51:09,087 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:51:09,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:51:09,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:51:09,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:51:09,090 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:51:09,743 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:51:09,744 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:51:09,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:51:09 BoogieIcfgContainer [2019-12-19 03:51:09,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:51:09,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:51:09,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:51:09,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:51:09,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:51:08" (1/3) ... [2019-12-19 03:51:09,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45fd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:51:09, skipping insertion in model container [2019-12-19 03:51:09,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:51:08" (2/3) ... [2019-12-19 03:51:09,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45fd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:51:09, skipping insertion in model container [2019-12-19 03:51:09,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:51:09" (3/3) ... [2019-12-19 03:51:09,755 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc.i [2019-12-19 03:51:09,766 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:51:09,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:51:09,775 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:51:09,776 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:51:09,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,843 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,855 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,856 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,856 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,862 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,863 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:51:09,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:51:09,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:51:09,907 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:51:09,907 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:51:09,907 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:51:09,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:51:09,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:51:09,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:51:09,908 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:51:09,922 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-19 03:51:11,426 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-19 03:51:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-19 03:51:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-19 03:51:11,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:11,438 INFO L411 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] [2019-12-19 03:51:11,439 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:11,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:11,444 INFO L82 PathProgramCache]: Analyzing trace with hash -503711198, now seen corresponding path program 1 times [2019-12-19 03:51:11,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:11,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410853320] [2019-12-19 03:51:11,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:11,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410853320] [2019-12-19 03:51:11,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:11,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:51:11,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014251116] [2019-12-19 03:51:11,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:51:11,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:11,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:51:11,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:11,827 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-19 03:51:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:12,402 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-19 03:51:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:51:12,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-19 03:51:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:12,643 INFO L225 Difference]: With dead ends: 26617 [2019-12-19 03:51:12,643 INFO L226 Difference]: Without dead ends: 20361 [2019-12-19 03:51:12,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-19 03:51:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-19 03:51:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-19 03:51:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-19 03:51:14,696 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-19 03:51:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:14,698 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-19 03:51:14,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:51:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-19 03:51:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:51:14,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:14,711 INFO L411 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] [2019-12-19 03:51:14,711 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -243116780, now seen corresponding path program 1 times [2019-12-19 03:51:14,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:14,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363524457] [2019-12-19 03:51:14,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363524457] [2019-12-19 03:51:14,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:14,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:51:14,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931347238] [2019-12-19 03:51:14,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:51:14,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:51:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:14,902 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-19 03:51:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:16,667 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-19 03:51:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:16,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 03:51:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:16,813 INFO L225 Difference]: With dead ends: 31839 [2019-12-19 03:51:16,813 INFO L226 Difference]: Without dead ends: 31287 [2019-12-19 03:51:16,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:51:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-19 03:51:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-19 03:51:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-19 03:51:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-19 03:51:17,887 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-19 03:51:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:17,890 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-19 03:51:17,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-19 03:51:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 03:51:17,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:17,897 INFO L411 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] [2019-12-19 03:51:17,898 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -679798597, now seen corresponding path program 1 times [2019-12-19 03:51:17,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:17,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193226968] [2019-12-19 03:51:17,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:18,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193226968] [2019-12-19 03:51:18,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:18,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:51:18,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39571416] [2019-12-19 03:51:18,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:51:18,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:51:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:18,034 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-12-19 03:51:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:18,857 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-19 03:51:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:18,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 03:51:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:19,066 INFO L225 Difference]: With dead ends: 38697 [2019-12-19 03:51:19,066 INFO L226 Difference]: Without dead ends: 38249 [2019-12-19 03:51:19,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:51:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-19 03:51:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-19 03:51:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-19 03:51:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-19 03:51:21,383 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-19 03:51:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:21,383 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-19 03:51:21,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-19 03:51:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 03:51:21,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:21,391 INFO L411 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] [2019-12-19 03:51:21,392 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:21,392 INFO L82 PathProgramCache]: Analyzing trace with hash 360461205, now seen corresponding path program 1 times [2019-12-19 03:51:21,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:21,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86618707] [2019-12-19 03:51:21,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:21,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86618707] [2019-12-19 03:51:21,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:21,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:51:21,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414984341] [2019-12-19 03:51:21,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:51:21,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:51:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:51:21,435 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-12-19 03:51:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:21,649 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-19 03:51:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:51:21,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 03:51:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:21,774 INFO L225 Difference]: With dead ends: 42413 [2019-12-19 03:51:21,774 INFO L226 Difference]: Without dead ends: 42413 [2019-12-19 03:51:21,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:51:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-19 03:51:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-19 03:51:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-19 03:51:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-19 03:51:23,026 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-19 03:51:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:23,026 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-19 03:51:23,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:51:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-19 03:51:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:51:23,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:23,042 INFO L411 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] [2019-12-19 03:51:23,043 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1864507342, now seen corresponding path program 1 times [2019-12-19 03:51:23,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:23,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441415849] [2019-12-19 03:51:23,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:23,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441415849] [2019-12-19 03:51:23,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:23,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:23,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333987411] [2019-12-19 03:51:23,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:23,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:23,127 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 6 states. [2019-12-19 03:51:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:24,831 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-19 03:51:24,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:51:24,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:51:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:24,974 INFO L225 Difference]: With dead ends: 48757 [2019-12-19 03:51:24,975 INFO L226 Difference]: Without dead ends: 48237 [2019-12-19 03:51:24,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 03:51:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-19 03:51:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-19 03:51:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-19 03:51:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-19 03:51:25,996 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-19 03:51:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:25,997 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-19 03:51:25,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-19 03:51:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:51:26,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:26,012 INFO L411 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] [2019-12-19 03:51:26,012 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2007106397, now seen corresponding path program 1 times [2019-12-19 03:51:26,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:26,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114070313] [2019-12-19 03:51:26,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:26,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114070313] [2019-12-19 03:51:26,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:26,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:26,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813490974] [2019-12-19 03:51:26,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:26,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:26,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:26,143 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-12-19 03:51:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:26,906 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-19 03:51:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:26,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 03:51:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:27,011 INFO L225 Difference]: With dead ends: 53006 [2019-12-19 03:51:27,011 INFO L226 Difference]: Without dead ends: 52030 [2019-12-19 03:51:27,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:51:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-19 03:51:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-19 03:51:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-19 03:51:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-19 03:51:28,385 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-19 03:51:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:28,385 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-19 03:51:28,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-19 03:51:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:51:28,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:28,405 INFO L411 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] [2019-12-19 03:51:28,405 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 490909540, now seen corresponding path program 1 times [2019-12-19 03:51:28,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:28,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656177291] [2019-12-19 03:51:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:28,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656177291] [2019-12-19 03:51:28,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:28,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:28,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056626946] [2019-12-19 03:51:28,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:28,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:28,528 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-12-19 03:51:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:31,021 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-19 03:51:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:51:31,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 03:51:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:31,174 INFO L225 Difference]: With dead ends: 70898 [2019-12-19 03:51:31,174 INFO L226 Difference]: Without dead ends: 70898 [2019-12-19 03:51:31,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:51:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-19 03:51:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-19 03:51:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-19 03:51:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-19 03:51:32,546 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-19 03:51:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:32,547 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-19 03:51:32,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-19 03:51:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 03:51:32,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:32,560 INFO L411 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] [2019-12-19 03:51:32,560 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:32,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1378413221, now seen corresponding path program 1 times [2019-12-19 03:51:32,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:32,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761551118] [2019-12-19 03:51:32,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:32,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761551118] [2019-12-19 03:51:32,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:32,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:51:32,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329940892] [2019-12-19 03:51:32,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:51:32,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:51:32,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:51:32,626 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-12-19 03:51:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:32,803 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-12-19 03:51:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:51:32,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-19 03:51:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:32,882 INFO L225 Difference]: With dead ends: 43857 [2019-12-19 03:51:32,882 INFO L226 Difference]: Without dead ends: 43353 [2019-12-19 03:51:32,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:51:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-12-19 03:51:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-12-19 03:51:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-12-19 03:51:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-12-19 03:51:34,182 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-12-19 03:51:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:34,182 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-12-19 03:51:34,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:51:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-12-19 03:51:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 03:51:34,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:34,194 INFO L411 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] [2019-12-19 03:51:34,194 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:34,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1658901394, now seen corresponding path program 1 times [2019-12-19 03:51:34,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:34,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136048759] [2019-12-19 03:51:34,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:34,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136048759] [2019-12-19 03:51:34,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:34,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:34,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863843994] [2019-12-19 03:51:34,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:34,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:34,308 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-12-19 03:51:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:35,104 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-12-19 03:51:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:35,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 03:51:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:35,209 INFO L225 Difference]: With dead ends: 54550 [2019-12-19 03:51:35,209 INFO L226 Difference]: Without dead ends: 54550 [2019-12-19 03:51:35,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:51:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-12-19 03:51:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-12-19 03:51:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-19 03:51:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-12-19 03:51:38,018 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-12-19 03:51:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:38,018 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-12-19 03:51:38,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-12-19 03:51:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 03:51:38,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:38,028 INFO L411 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] [2019-12-19 03:51:38,028 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash -771397713, now seen corresponding path program 1 times [2019-12-19 03:51:38,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:38,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726619949] [2019-12-19 03:51:38,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:38,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726619949] [2019-12-19 03:51:38,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:38,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:51:38,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446976220] [2019-12-19 03:51:38,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:51:38,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:51:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:38,108 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-12-19 03:51:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:38,172 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-12-19 03:51:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:51:38,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-19 03:51:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:38,183 INFO L225 Difference]: With dead ends: 8164 [2019-12-19 03:51:38,183 INFO L226 Difference]: Without dead ends: 6755 [2019-12-19 03:51:38,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-12-19 03:51:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-12-19 03:51:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-12-19 03:51:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-12-19 03:51:38,262 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-12-19 03:51:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:38,262 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-12-19 03:51:38,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:51:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-12-19 03:51:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 03:51:38,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:38,265 INFO L411 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] [2019-12-19 03:51:38,266 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 210347587, now seen corresponding path program 1 times [2019-12-19 03:51:38,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:38,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564741476] [2019-12-19 03:51:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:38,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564741476] [2019-12-19 03:51:38,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:38,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:51:38,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672945762] [2019-12-19 03:51:38,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:51:38,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:51:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:38,362 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 4 states. [2019-12-19 03:51:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:38,499 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-12-19 03:51:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:51:38,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 03:51:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:38,510 INFO L225 Difference]: With dead ends: 7892 [2019-12-19 03:51:38,510 INFO L226 Difference]: Without dead ends: 7892 [2019-12-19 03:51:38,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-12-19 03:51:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-12-19 03:51:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-12-19 03:51:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-12-19 03:51:38,618 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-12-19 03:51:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:38,618 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-12-19 03:51:38,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:51:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-12-19 03:51:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 03:51:38,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:38,622 INFO L411 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] [2019-12-19 03:51:38,623 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1953157922, now seen corresponding path program 1 times [2019-12-19 03:51:38,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:38,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030864185] [2019-12-19 03:51:38,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:38,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030864185] [2019-12-19 03:51:38,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:38,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:38,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246826134] [2019-12-19 03:51:38,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:38,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:38,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:38,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:38,717 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 6 states. [2019-12-19 03:51:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:39,046 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-12-19 03:51:39,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:51:39,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 03:51:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:39,060 INFO L225 Difference]: With dead ends: 9269 [2019-12-19 03:51:39,060 INFO L226 Difference]: Without dead ends: 9221 [2019-12-19 03:51:39,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:51:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-12-19 03:51:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-12-19 03:51:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-12-19 03:51:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-12-19 03:51:39,178 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-12-19 03:51:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:39,178 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-12-19 03:51:39,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-12-19 03:51:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:39,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:39,185 INFO L411 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] [2019-12-19 03:51:39,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2066677115, now seen corresponding path program 1 times [2019-12-19 03:51:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:39,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065316638] [2019-12-19 03:51:39,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:39,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065316638] [2019-12-19 03:51:39,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:39,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:51:39,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078624042] [2019-12-19 03:51:39,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:51:39,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:51:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:39,250 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-12-19 03:51:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:39,480 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-12-19 03:51:39,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:51:39,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 03:51:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:39,495 INFO L225 Difference]: With dead ends: 10666 [2019-12-19 03:51:39,495 INFO L226 Difference]: Without dead ends: 10666 [2019-12-19 03:51:39,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-12-19 03:51:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-12-19 03:51:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-12-19 03:51:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-12-19 03:51:39,617 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-12-19 03:51:39,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:39,617 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-12-19 03:51:39,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:51:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-12-19 03:51:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:39,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:39,624 INFO L411 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] [2019-12-19 03:51:39,625 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash -983525700, now seen corresponding path program 1 times [2019-12-19 03:51:39,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:39,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316502229] [2019-12-19 03:51:39,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:39,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316502229] [2019-12-19 03:51:39,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:39,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:39,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58144944] [2019-12-19 03:51:39,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:39,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:39,715 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-12-19 03:51:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:40,467 INFO L93 Difference]: Finished difference Result 17149 states and 50035 transitions. [2019-12-19 03:51:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:51:40,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 03:51:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:40,497 INFO L225 Difference]: With dead ends: 17149 [2019-12-19 03:51:40,497 INFO L226 Difference]: Without dead ends: 17149 [2019-12-19 03:51:40,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:51:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2019-12-19 03:51:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 12308. [2019-12-19 03:51:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12308 states. [2019-12-19 03:51:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12308 states to 12308 states and 35903 transitions. [2019-12-19 03:51:40,951 INFO L78 Accepts]: Start accepts. Automaton has 12308 states and 35903 transitions. Word has length 69 [2019-12-19 03:51:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:40,951 INFO L462 AbstractCegarLoop]: Abstraction has 12308 states and 35903 transitions. [2019-12-19 03:51:40,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 12308 states and 35903 transitions. [2019-12-19 03:51:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:40,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:40,963 INFO L411 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] [2019-12-19 03:51:40,963 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:40,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1494059877, now seen corresponding path program 1 times [2019-12-19 03:51:40,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:40,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119322270] [2019-12-19 03:51:40,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:41,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119322270] [2019-12-19 03:51:41,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:41,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:41,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638752132] [2019-12-19 03:51:41,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:41,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:41,054 INFO L87 Difference]: Start difference. First operand 12308 states and 35903 transitions. Second operand 7 states. [2019-12-19 03:51:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:42,425 INFO L93 Difference]: Finished difference Result 17995 states and 52090 transitions. [2019-12-19 03:51:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-19 03:51:42,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-19 03:51:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:42,450 INFO L225 Difference]: With dead ends: 17995 [2019-12-19 03:51:42,450 INFO L226 Difference]: Without dead ends: 17638 [2019-12-19 03:51:42,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-19 03:51:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17638 states. [2019-12-19 03:51:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17638 to 15469. [2019-12-19 03:51:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15469 states. [2019-12-19 03:51:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15469 states to 15469 states and 45203 transitions. [2019-12-19 03:51:42,655 INFO L78 Accepts]: Start accepts. Automaton has 15469 states and 45203 transitions. Word has length 69 [2019-12-19 03:51:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:42,655 INFO L462 AbstractCegarLoop]: Abstraction has 15469 states and 45203 transitions. [2019-12-19 03:51:42,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 15469 states and 45203 transitions. [2019-12-19 03:51:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:42,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:42,667 INFO L411 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] [2019-12-19 03:51:42,667 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1003956060, now seen corresponding path program 1 times [2019-12-19 03:51:42,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:42,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487048087] [2019-12-19 03:51:42,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:42,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487048087] [2019-12-19 03:51:42,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:42,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:42,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970022136] [2019-12-19 03:51:42,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:42,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:42,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:42,759 INFO L87 Difference]: Start difference. First operand 15469 states and 45203 transitions. Second operand 6 states. [2019-12-19 03:51:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:43,275 INFO L93 Difference]: Finished difference Result 15470 states and 44822 transitions. [2019-12-19 03:51:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:51:43,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 03:51:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:43,297 INFO L225 Difference]: With dead ends: 15470 [2019-12-19 03:51:43,297 INFO L226 Difference]: Without dead ends: 15470 [2019-12-19 03:51:43,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:51:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2019-12-19 03:51:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 15030. [2019-12-19 03:51:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15030 states. [2019-12-19 03:51:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15030 states to 15030 states and 43684 transitions. [2019-12-19 03:51:43,482 INFO L78 Accepts]: Start accepts. Automaton has 15030 states and 43684 transitions. Word has length 69 [2019-12-19 03:51:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:43,482 INFO L462 AbstractCegarLoop]: Abstraction has 15030 states and 43684 transitions. [2019-12-19 03:51:43,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:43,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15030 states and 43684 transitions. [2019-12-19 03:51:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:43,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:43,492 INFO L411 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] [2019-12-19 03:51:43,492 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1234232253, now seen corresponding path program 1 times [2019-12-19 03:51:43,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:43,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676456475] [2019-12-19 03:51:43,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:43,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676456475] [2019-12-19 03:51:43,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:43,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:51:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898217844] [2019-12-19 03:51:43,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:51:43,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:43,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:51:43,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:43,572 INFO L87 Difference]: Start difference. First operand 15030 states and 43684 transitions. Second operand 5 states. [2019-12-19 03:51:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:43,869 INFO L93 Difference]: Finished difference Result 19011 states and 54959 transitions. [2019-12-19 03:51:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:51:43,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 03:51:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:43,895 INFO L225 Difference]: With dead ends: 19011 [2019-12-19 03:51:43,895 INFO L226 Difference]: Without dead ends: 19011 [2019-12-19 03:51:43,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19011 states. [2019-12-19 03:51:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19011 to 16078. [2019-12-19 03:51:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16078 states. [2019-12-19 03:51:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16078 states to 16078 states and 46402 transitions. [2019-12-19 03:51:44,388 INFO L78 Accepts]: Start accepts. Automaton has 16078 states and 46402 transitions. Word has length 69 [2019-12-19 03:51:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:44,388 INFO L462 AbstractCegarLoop]: Abstraction has 16078 states and 46402 transitions. [2019-12-19 03:51:44,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 16078 states and 46402 transitions. [2019-12-19 03:51:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:44,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:44,398 INFO L411 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] [2019-12-19 03:51:44,398 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash 723698076, now seen corresponding path program 1 times [2019-12-19 03:51:44,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:44,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975988345] [2019-12-19 03:51:44,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:44,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975988345] [2019-12-19 03:51:44,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:44,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:51:44,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413127192] [2019-12-19 03:51:44,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:51:44,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:51:44,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:51:44,483 INFO L87 Difference]: Start difference. First operand 16078 states and 46402 transitions. Second operand 4 states. [2019-12-19 03:51:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:44,928 INFO L93 Difference]: Finished difference Result 19504 states and 56336 transitions. [2019-12-19 03:51:44,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:51:44,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 03:51:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:44,956 INFO L225 Difference]: With dead ends: 19504 [2019-12-19 03:51:44,956 INFO L226 Difference]: Without dead ends: 19129 [2019-12-19 03:51:44,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19129 states. [2019-12-19 03:51:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19129 to 15673. [2019-12-19 03:51:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15673 states. [2019-12-19 03:51:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15673 states to 15673 states and 45021 transitions. [2019-12-19 03:51:45,169 INFO L78 Accepts]: Start accepts. Automaton has 15673 states and 45021 transitions. Word has length 69 [2019-12-19 03:51:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:45,170 INFO L462 AbstractCegarLoop]: Abstraction has 15673 states and 45021 transitions. [2019-12-19 03:51:45,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:51:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 15673 states and 45021 transitions. [2019-12-19 03:51:45,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:51:45,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:45,180 INFO L411 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] [2019-12-19 03:51:45,180 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1073253283, now seen corresponding path program 1 times [2019-12-19 03:51:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:45,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089279791] [2019-12-19 03:51:45,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:45,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089279791] [2019-12-19 03:51:45,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:45,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:51:45,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627266273] [2019-12-19 03:51:45,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:51:45,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:51:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:45,246 INFO L87 Difference]: Start difference. First operand 15673 states and 45021 transitions. Second operand 5 states. [2019-12-19 03:51:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:45,303 INFO L93 Difference]: Finished difference Result 5689 states and 14113 transitions. [2019-12-19 03:51:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:51:45,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 03:51:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:45,312 INFO L225 Difference]: With dead ends: 5689 [2019-12-19 03:51:45,312 INFO L226 Difference]: Without dead ends: 4781 [2019-12-19 03:51:45,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:45,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2019-12-19 03:51:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 3861. [2019-12-19 03:51:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3861 states. [2019-12-19 03:51:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3861 states to 3861 states and 9489 transitions. [2019-12-19 03:51:45,393 INFO L78 Accepts]: Start accepts. Automaton has 3861 states and 9489 transitions. Word has length 69 [2019-12-19 03:51:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:45,393 INFO L462 AbstractCegarLoop]: Abstraction has 3861 states and 9489 transitions. [2019-12-19 03:51:45,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3861 states and 9489 transitions. [2019-12-19 03:51:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:45,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:45,399 INFO L411 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] [2019-12-19 03:51:45,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1417025587, now seen corresponding path program 1 times [2019-12-19 03:51:45,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:45,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473478779] [2019-12-19 03:51:45,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473478779] [2019-12-19 03:51:45,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:45,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:45,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653351257] [2019-12-19 03:51:45,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:45,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:45,568 INFO L87 Difference]: Start difference. First operand 3861 states and 9489 transitions. Second operand 7 states. [2019-12-19 03:51:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:46,303 INFO L93 Difference]: Finished difference Result 4758 states and 11447 transitions. [2019-12-19 03:51:46,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 03:51:46,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-19 03:51:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:46,311 INFO L225 Difference]: With dead ends: 4758 [2019-12-19 03:51:46,311 INFO L226 Difference]: Without dead ends: 4716 [2019-12-19 03:51:46,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-19 03:51:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-12-19 03:51:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4041. [2019-12-19 03:51:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4041 states. [2019-12-19 03:51:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 9875 transitions. [2019-12-19 03:51:46,359 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 9875 transitions. Word has length 86 [2019-12-19 03:51:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:46,360 INFO L462 AbstractCegarLoop]: Abstraction has 4041 states and 9875 transitions. [2019-12-19 03:51:46,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 9875 transitions. [2019-12-19 03:51:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:46,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:46,366 INFO L411 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] [2019-12-19 03:51:46,366 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:46,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1186749394, now seen corresponding path program 1 times [2019-12-19 03:51:46,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:46,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961017336] [2019-12-19 03:51:46,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:46,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961017336] [2019-12-19 03:51:46,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:46,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:46,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490256881] [2019-12-19 03:51:46,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:46,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:46,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:46,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:46,451 INFO L87 Difference]: Start difference. First operand 4041 states and 9875 transitions. Second operand 6 states. [2019-12-19 03:51:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:46,846 INFO L93 Difference]: Finished difference Result 5042 states and 12122 transitions. [2019-12-19 03:51:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:51:46,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-19 03:51:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:46,854 INFO L225 Difference]: With dead ends: 5042 [2019-12-19 03:51:46,854 INFO L226 Difference]: Without dead ends: 5042 [2019-12-19 03:51:46,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:51:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2019-12-19 03:51:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 4070. [2019-12-19 03:51:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4070 states. [2019-12-19 03:51:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 9937 transitions. [2019-12-19 03:51:46,900 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 9937 transitions. Word has length 86 [2019-12-19 03:51:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:46,900 INFO L462 AbstractCegarLoop]: Abstraction has 4070 states and 9937 transitions. [2019-12-19 03:51:46,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 9937 transitions. [2019-12-19 03:51:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:46,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:46,904 INFO L411 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] [2019-12-19 03:51:46,905 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 800732366, now seen corresponding path program 1 times [2019-12-19 03:51:46,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:46,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310033106] [2019-12-19 03:51:46,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:47,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310033106] [2019-12-19 03:51:47,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:47,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:51:47,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030667884] [2019-12-19 03:51:47,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:51:47,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:51:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:47,016 INFO L87 Difference]: Start difference. First operand 4070 states and 9937 transitions. Second operand 5 states. [2019-12-19 03:51:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:47,063 INFO L93 Difference]: Finished difference Result 4025 states and 9805 transitions. [2019-12-19 03:51:47,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:51:47,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-19 03:51:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:47,070 INFO L225 Difference]: With dead ends: 4025 [2019-12-19 03:51:47,070 INFO L226 Difference]: Without dead ends: 4025 [2019-12-19 03:51:47,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2019-12-19 03:51:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 2887. [2019-12-19 03:51:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2887 states. [2019-12-19 03:51:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 6858 transitions. [2019-12-19 03:51:47,124 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 6858 transitions. Word has length 86 [2019-12-19 03:51:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:47,125 INFO L462 AbstractCegarLoop]: Abstraction has 2887 states and 6858 transitions. [2019-12-19 03:51:47,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 6858 transitions. [2019-12-19 03:51:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:47,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:47,131 INFO L411 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] [2019-12-19 03:51:47,131 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1688236047, now seen corresponding path program 1 times [2019-12-19 03:51:47,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:47,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164631572] [2019-12-19 03:51:47,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:47,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164631572] [2019-12-19 03:51:47,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:47,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:51:47,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400397088] [2019-12-19 03:51:47,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:51:47,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:47,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:51:47,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:51:47,239 INFO L87 Difference]: Start difference. First operand 2887 states and 6858 transitions. Second operand 7 states. [2019-12-19 03:51:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:47,338 INFO L93 Difference]: Finished difference Result 4709 states and 11315 transitions. [2019-12-19 03:51:47,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:51:47,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-19 03:51:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:47,342 INFO L225 Difference]: With dead ends: 4709 [2019-12-19 03:51:47,342 INFO L226 Difference]: Without dead ends: 1911 [2019-12-19 03:51:47,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 03:51:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2019-12-19 03:51:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2019-12-19 03:51:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-12-19 03:51:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 4605 transitions. [2019-12-19 03:51:47,373 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 4605 transitions. Word has length 86 [2019-12-19 03:51:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:47,374 INFO L462 AbstractCegarLoop]: Abstraction has 1911 states and 4605 transitions. [2019-12-19 03:51:47,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:51:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 4605 transitions. [2019-12-19 03:51:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:47,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:47,377 INFO L411 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] [2019-12-19 03:51:47,377 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -419141643, now seen corresponding path program 1 times [2019-12-19 03:51:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:47,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654471312] [2019-12-19 03:51:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:47,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654471312] [2019-12-19 03:51:47,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:47,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:51:47,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879468196] [2019-12-19 03:51:47,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:51:47,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:51:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:51:47,449 INFO L87 Difference]: Start difference. First operand 1911 states and 4605 transitions. Second operand 5 states. [2019-12-19 03:51:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:47,664 INFO L93 Difference]: Finished difference Result 2166 states and 5145 transitions. [2019-12-19 03:51:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:51:47,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-19 03:51:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:47,668 INFO L225 Difference]: With dead ends: 2166 [2019-12-19 03:51:47,668 INFO L226 Difference]: Without dead ends: 2144 [2019-12-19 03:51:47,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2019-12-19 03:51:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1916. [2019-12-19 03:51:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-12-19 03:51:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 4615 transitions. [2019-12-19 03:51:47,689 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 4615 transitions. Word has length 86 [2019-12-19 03:51:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:47,690 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 4615 transitions. [2019-12-19 03:51:47,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:51:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 4615 transitions. [2019-12-19 03:51:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:47,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:47,692 INFO L411 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] [2019-12-19 03:51:47,692 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash 273960054, now seen corresponding path program 1 times [2019-12-19 03:51:47,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:47,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513956515] [2019-12-19 03:51:47,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:47,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513956515] [2019-12-19 03:51:47,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:47,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:51:47,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547507014] [2019-12-19 03:51:47,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:51:47,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:51:47,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:47,804 INFO L87 Difference]: Start difference. First operand 1916 states and 4615 transitions. Second operand 6 states. [2019-12-19 03:51:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:48,126 INFO L93 Difference]: Finished difference Result 2131 states and 5103 transitions. [2019-12-19 03:51:48,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:51:48,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-19 03:51:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:48,130 INFO L225 Difference]: With dead ends: 2131 [2019-12-19 03:51:48,130 INFO L226 Difference]: Without dead ends: 2131 [2019-12-19 03:51:48,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:51:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2019-12-19 03:51:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1858. [2019-12-19 03:51:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2019-12-19 03:51:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 4493 transitions. [2019-12-19 03:51:48,151 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 4493 transitions. Word has length 86 [2019-12-19 03:51:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:48,151 INFO L462 AbstractCegarLoop]: Abstraction has 1858 states and 4493 transitions. [2019-12-19 03:51:48,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:51:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 4493 transitions. [2019-12-19 03:51:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:48,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:48,153 INFO L411 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] [2019-12-19 03:51:48,154 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1531956149, now seen corresponding path program 2 times [2019-12-19 03:51:48,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:48,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108662865] [2019-12-19 03:51:48,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:51:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:51:48,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108662865] [2019-12-19 03:51:48,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:51:48,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 03:51:48,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739018817] [2019-12-19 03:51:48,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 03:51:48,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:51:48,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 03:51:48,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:51:48,337 INFO L87 Difference]: Start difference. First operand 1858 states and 4493 transitions. Second operand 10 states. [2019-12-19 03:51:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:51:48,725 INFO L93 Difference]: Finished difference Result 3141 states and 7495 transitions. [2019-12-19 03:51:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 03:51:48,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-19 03:51:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:51:48,729 INFO L225 Difference]: With dead ends: 3141 [2019-12-19 03:51:48,730 INFO L226 Difference]: Without dead ends: 2093 [2019-12-19 03:51:48,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-19 03:51:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-12-19 03:51:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1925. [2019-12-19 03:51:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-12-19 03:51:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 4587 transitions. [2019-12-19 03:51:48,749 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 4587 transitions. Word has length 86 [2019-12-19 03:51:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:51:48,749 INFO L462 AbstractCegarLoop]: Abstraction has 1925 states and 4587 transitions. [2019-12-19 03:51:48,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 03:51:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 4587 transitions. [2019-12-19 03:51:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 03:51:48,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:51:48,753 INFO L411 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] [2019-12-19 03:51:48,753 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:51:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:51:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 167637331, now seen corresponding path program 3 times [2019-12-19 03:51:48,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:51:48,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730071264] [2019-12-19 03:51:48,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:51:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:51:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:51:48,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:51:48,871 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:51:49,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:51:49 BasicIcfg [2019-12-19 03:51:49,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:51:49,038 INFO L168 Benchmark]: Toolchain (without parser) took 40957.16 ms. Allocated memory was 136.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 100.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,039 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.08 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 155.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.32 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,041 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory is still 200.8 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,041 INFO L168 Benchmark]: RCFGBuilder took 729.60 ms. Allocated memory is still 200.8 MB. Free memory was 150.4 MB in the beginning and 109.3 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,042 INFO L168 Benchmark]: TraceAbstraction took 39289.30 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 108.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 03:51:49,045 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.08 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 155.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.32 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory is still 200.8 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 729.60 ms. Allocated memory is still 200.8 MB. Free memory was 150.4 MB in the beginning and 109.3 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 39289.30 ms. Allocated memory was 200.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 108.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1661; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1662; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.9s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6938 SDtfs, 7890 SDslu, 15987 SDs, 0 SdLazy, 6522 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 69737 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 294585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...