/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/rfi010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:05:55,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:05:55,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:05:55,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:05:55,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:05:55,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:05:55,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:05:55,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:05:55,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:05:55,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:05:55,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:05:55,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:05:55,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:05:55,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:05:55,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:05:55,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:05:55,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:05:55,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:05:55,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:05:55,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:05:55,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:05:55,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:05:55,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:05:55,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:05:55,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:05:55,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:05:55,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:05:55,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:05:55,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:05:55,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:05:55,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:05:55,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:05:55,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:05:55,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:05:55,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:05:55,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:05:55,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:05:55,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:05:55,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:05:55,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:05:55,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:05:55,764 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 04:05:55,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:05:55,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:05:55,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:05:55,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:05:55,806 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:05:55,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:05:55,807 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:05:55,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:05:55,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:05:55,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:05:55,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:05:55,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:05:55,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:05:55,808 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:05:55,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:05:55,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:05:55,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:05:55,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:05:55,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:05:55,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:05:55,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:05:55,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:05:55,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:05:55,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:05:55,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:05:55,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:05:55,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:05:55,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:05:55,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:05:55,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:05:56,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:05:56,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:05:56,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:05:56,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:05:56,106 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:05:56,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010_power.opt.i [2019-12-19 04:05:56,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740b4e3ad/7f13340d91ff440abaf987e0ee95378a/FLAG4937b7d2c [2019-12-19 04:05:56,734 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:05:56,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010_power.opt.i [2019-12-19 04:05:56,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740b4e3ad/7f13340d91ff440abaf987e0ee95378a/FLAG4937b7d2c [2019-12-19 04:05:56,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740b4e3ad/7f13340d91ff440abaf987e0ee95378a [2019-12-19 04:05:56,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:05:56,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:05:56,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:05:56,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:05:56,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:05:56,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:05:56" (1/1) ... [2019-12-19 04:05:57,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9639fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:56, skipping insertion in model container [2019-12-19 04:05:57,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:05:56" (1/1) ... [2019-12-19 04:05:57,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:05:57,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:05:57,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:05:57,668 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:05:57,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:05:57,814 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:05:57,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57 WrapperNode [2019-12-19 04:05:57,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:05:57,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:05:57,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:05:57,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:05:57,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:05:57,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:05:57,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:05:57,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:05:57,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (1/1) ... [2019-12-19 04:05:57,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:05:57,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:05:57,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:05:57,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:05:57,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (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 04:05:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:05:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:05:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:05:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:05:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:05:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:05:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:05:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:05:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:05:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:05:58,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:05:58,025 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 04:05:58,802 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:05:58,802 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:05:58,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:05:58 BoogieIcfgContainer [2019-12-19 04:05:58,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:05:58,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:05:58,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:05:58,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:05:58,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:05:56" (1/3) ... [2019-12-19 04:05:58,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e60da6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:05:58, skipping insertion in model container [2019-12-19 04:05:58,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:05:57" (2/3) ... [2019-12-19 04:05:58,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e60da6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:05:58, skipping insertion in model container [2019-12-19 04:05:58,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:05:58" (3/3) ... [2019-12-19 04:05:58,819 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_power.opt.i [2019-12-19 04:05:58,831 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:05:58,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:05:58,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:05:58,847 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:05:58,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,961 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,989 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:58,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,009 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:05:59,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:05:59,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:05:59,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:05:59,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:05:59,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:05:59,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:05:59,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:05:59,047 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:05:59,047 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:05:59,063 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 178 places, 227 transitions [2019-12-19 04:06:07,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80072 states. [2019-12-19 04:06:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 80072 states. [2019-12-19 04:06:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-19 04:06:07,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:07,975 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] [2019-12-19 04:06:07,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 71050137, now seen corresponding path program 1 times [2019-12-19 04:06:07,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:07,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982441426] [2019-12-19 04:06:07,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:08,292 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 04:06:08,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982441426] [2019-12-19 04:06:08,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:08,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:06:08,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278664935] [2019-12-19 04:06:08,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:06:08,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:08,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:06:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:06:08,319 INFO L87 Difference]: Start difference. First operand 80072 states. Second operand 4 states. [2019-12-19 04:06:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:10,323 INFO L93 Difference]: Finished difference Result 80712 states and 324637 transitions. [2019-12-19 04:06:10,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:06:10,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-19 04:06:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:10,790 INFO L225 Difference]: With dead ends: 80712 [2019-12-19 04:06:10,790 INFO L226 Difference]: Without dead ends: 59000 [2019-12-19 04:06:10,797 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 04:06:13,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59000 states. [2019-12-19 04:06:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59000 to 59000. [2019-12-19 04:06:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59000 states. [2019-12-19 04:06:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59000 states to 59000 states and 240125 transitions. [2019-12-19 04:06:17,405 INFO L78 Accepts]: Start accepts. Automaton has 59000 states and 240125 transitions. Word has length 39 [2019-12-19 04:06:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:17,405 INFO L462 AbstractCegarLoop]: Abstraction has 59000 states and 240125 transitions. [2019-12-19 04:06:17,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:06:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59000 states and 240125 transitions. [2019-12-19 04:06:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 04:06:17,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:17,416 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] [2019-12-19 04:06:17,416 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash -256602995, now seen corresponding path program 1 times [2019-12-19 04:06:17,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:17,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437270232] [2019-12-19 04:06:17,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:17,545 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 04:06:17,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437270232] [2019-12-19 04:06:17,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:17,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:06:17,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263259279] [2019-12-19 04:06:17,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:06:17,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:06:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:06:17,549 INFO L87 Difference]: Start difference. First operand 59000 states and 240125 transitions. Second operand 5 states. [2019-12-19 04:06:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:18,844 INFO L93 Difference]: Finished difference Result 95594 states and 363716 transitions. [2019-12-19 04:06:18,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:06:18,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 04:06:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:19,763 INFO L225 Difference]: With dead ends: 95594 [2019-12-19 04:06:19,763 INFO L226 Difference]: Without dead ends: 95042 [2019-12-19 04:06:19,764 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 04:06:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2019-12-19 04:06:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 93164. [2019-12-19 04:06:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93164 states. [2019-12-19 04:06:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93164 states to 93164 states and 356302 transitions. [2019-12-19 04:06:25,811 INFO L78 Accepts]: Start accepts. Automaton has 93164 states and 356302 transitions. Word has length 47 [2019-12-19 04:06:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:25,813 INFO L462 AbstractCegarLoop]: Abstraction has 93164 states and 356302 transitions. [2019-12-19 04:06:25,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:06:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 93164 states and 356302 transitions. [2019-12-19 04:06:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 04:06:25,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:25,819 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 04:06:25,819 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:25,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:25,820 INFO L82 PathProgramCache]: Analyzing trace with hash -85893698, now seen corresponding path program 1 times [2019-12-19 04:06:25,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:25,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15290074] [2019-12-19 04:06:25,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:25,966 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 04:06:25,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15290074] [2019-12-19 04:06:25,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:25,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:06:25,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103045257] [2019-12-19 04:06:25,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:06:25,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:06:25,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:06:25,969 INFO L87 Difference]: Start difference. First operand 93164 states and 356302 transitions. Second operand 5 states. [2019-12-19 04:06:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:29,817 INFO L93 Difference]: Finished difference Result 118508 states and 442883 transitions. [2019-12-19 04:06:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:06:29,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 04:06:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:30,124 INFO L225 Difference]: With dead ends: 118508 [2019-12-19 04:06:30,124 INFO L226 Difference]: Without dead ends: 118060 [2019-12-19 04:06:30,125 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 04:06:31,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118060 states. [2019-12-19 04:06:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118060 to 104153. [2019-12-19 04:06:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104153 states. [2019-12-19 04:06:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104153 states to 104153 states and 394236 transitions. [2019-12-19 04:06:34,353 INFO L78 Accepts]: Start accepts. Automaton has 104153 states and 394236 transitions. Word has length 48 [2019-12-19 04:06:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:34,353 INFO L462 AbstractCegarLoop]: Abstraction has 104153 states and 394236 transitions. [2019-12-19 04:06:34,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:06:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 104153 states and 394236 transitions. [2019-12-19 04:06:34,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 04:06:34,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:34,365 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] [2019-12-19 04:06:34,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:34,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:34,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1345260124, now seen corresponding path program 1 times [2019-12-19 04:06:34,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:34,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308070878] [2019-12-19 04:06:34,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:34,421 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 04:06:34,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308070878] [2019-12-19 04:06:34,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:34,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:06:34,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731920262] [2019-12-19 04:06:34,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:06:34,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:34,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:06:34,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:06:34,425 INFO L87 Difference]: Start difference. First operand 104153 states and 394236 transitions. Second operand 3 states. [2019-12-19 04:06:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:38,995 INFO L93 Difference]: Finished difference Result 170911 states and 627058 transitions. [2019-12-19 04:06:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:06:38,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 04:06:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:39,441 INFO L225 Difference]: With dead ends: 170911 [2019-12-19 04:06:39,441 INFO L226 Difference]: Without dead ends: 170911 [2019-12-19 04:06:39,441 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 04:06:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170911 states. [2019-12-19 04:06:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170911 to 157189. [2019-12-19 04:06:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157189 states. [2019-12-19 04:06:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157189 states to 157189 states and 581290 transitions. [2019-12-19 04:06:45,038 INFO L78 Accepts]: Start accepts. Automaton has 157189 states and 581290 transitions. Word has length 50 [2019-12-19 04:06:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:45,038 INFO L462 AbstractCegarLoop]: Abstraction has 157189 states and 581290 transitions. [2019-12-19 04:06:45,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:06:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 157189 states and 581290 transitions. [2019-12-19 04:06:45,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:06:45,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:45,062 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] [2019-12-19 04:06:45,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:45,063 INFO L82 PathProgramCache]: Analyzing trace with hash 246072175, now seen corresponding path program 1 times [2019-12-19 04:06:45,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:45,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147192520] [2019-12-19 04:06:45,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:45,153 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 04:06:45,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147192520] [2019-12-19 04:06:45,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:45,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:06:45,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244734053] [2019-12-19 04:06:45,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:06:45,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:06:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:06:45,155 INFO L87 Difference]: Start difference. First operand 157189 states and 581290 transitions. Second operand 6 states. [2019-12-19 04:06:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:06:47,884 INFO L93 Difference]: Finished difference Result 212573 states and 766172 transitions. [2019-12-19 04:06:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:06:47,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 04:06:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:06:48,435 INFO L225 Difference]: With dead ends: 212573 [2019-12-19 04:06:48,435 INFO L226 Difference]: Without dead ends: 212053 [2019-12-19 04:06:48,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 04:06:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212053 states. [2019-12-19 04:06:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212053 to 157971. [2019-12-19 04:06:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157971 states. [2019-12-19 04:06:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157971 states to 157971 states and 584227 transitions. [2019-12-19 04:06:59,441 INFO L78 Accepts]: Start accepts. Automaton has 157971 states and 584227 transitions. Word has length 54 [2019-12-19 04:06:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:06:59,441 INFO L462 AbstractCegarLoop]: Abstraction has 157971 states and 584227 transitions. [2019-12-19 04:06:59,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:06:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 157971 states and 584227 transitions. [2019-12-19 04:06:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:06:59,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:06:59,460 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] [2019-12-19 04:06:59,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:06:59,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:06:59,460 INFO L82 PathProgramCache]: Analyzing trace with hash 104351519, now seen corresponding path program 1 times [2019-12-19 04:06:59,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:06:59,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99188813] [2019-12-19 04:06:59,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:06:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:06:59,589 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 04:06:59,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99188813] [2019-12-19 04:06:59,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:06:59,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:06:59,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639586949] [2019-12-19 04:06:59,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:06:59,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:06:59,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:06:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:06:59,595 INFO L87 Difference]: Start difference. First operand 157971 states and 584227 transitions. Second operand 7 states. [2019-12-19 04:07:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:06,209 INFO L93 Difference]: Finished difference Result 264420 states and 941443 transitions. [2019-12-19 04:07:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:07:06,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 04:07:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:06,943 INFO L225 Difference]: With dead ends: 264420 [2019-12-19 04:07:06,944 INFO L226 Difference]: Without dead ends: 264420 [2019-12-19 04:07:06,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:07:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264420 states. [2019-12-19 04:07:13,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264420 to 196980. [2019-12-19 04:07:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196980 states. [2019-12-19 04:07:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196980 states to 196980 states and 717858 transitions. [2019-12-19 04:07:15,174 INFO L78 Accepts]: Start accepts. Automaton has 196980 states and 717858 transitions. Word has length 54 [2019-12-19 04:07:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:15,175 INFO L462 AbstractCegarLoop]: Abstraction has 196980 states and 717858 transitions. [2019-12-19 04:07:15,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 196980 states and 717858 transitions. [2019-12-19 04:07:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 04:07:15,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:15,202 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] [2019-12-19 04:07:15,202 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:15,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 991855200, now seen corresponding path program 1 times [2019-12-19 04:07:15,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:15,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710051776] [2019-12-19 04:07:15,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:15,277 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 04:07:15,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710051776] [2019-12-19 04:07:15,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:15,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:15,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146054460] [2019-12-19 04:07:15,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:15,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:15,279 INFO L87 Difference]: Start difference. First operand 196980 states and 717858 transitions. Second operand 3 states. [2019-12-19 04:07:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:16,198 INFO L93 Difference]: Finished difference Result 159700 states and 576108 transitions. [2019-12-19 04:07:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:16,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 04:07:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:16,563 INFO L225 Difference]: With dead ends: 159700 [2019-12-19 04:07:16,563 INFO L226 Difference]: Without dead ends: 159700 [2019-12-19 04:07:16,564 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 04:07:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159700 states. [2019-12-19 04:07:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159700 to 154918. [2019-12-19 04:07:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154918 states. [2019-12-19 04:07:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154918 states to 154918 states and 560287 transitions. [2019-12-19 04:07:27,373 INFO L78 Accepts]: Start accepts. Automaton has 154918 states and 560287 transitions. Word has length 54 [2019-12-19 04:07:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:27,374 INFO L462 AbstractCegarLoop]: Abstraction has 154918 states and 560287 transitions. [2019-12-19 04:07:27,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 154918 states and 560287 transitions. [2019-12-19 04:07:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 04:07:27,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:27,392 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 04:07:27,392 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash -82060277, now seen corresponding path program 1 times [2019-12-19 04:07:27,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:27,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686739949] [2019-12-19 04:07:27,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:27,466 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 04:07:27,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686739949] [2019-12-19 04:07:27,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:27,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:27,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244033993] [2019-12-19 04:07:27,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:27,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:27,468 INFO L87 Difference]: Start difference. First operand 154918 states and 560287 transitions. Second operand 4 states. [2019-12-19 04:07:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:27,573 INFO L93 Difference]: Finished difference Result 24457 states and 76333 transitions. [2019-12-19 04:07:27,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:07:27,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 04:07:27,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:27,602 INFO L225 Difference]: With dead ends: 24457 [2019-12-19 04:07:27,602 INFO L226 Difference]: Without dead ends: 18438 [2019-12-19 04:07:27,603 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 04:07:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-12-19 04:07:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 18191. [2019-12-19 04:07:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18191 states. [2019-12-19 04:07:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18191 states to 18191 states and 54574 transitions. [2019-12-19 04:07:27,853 INFO L78 Accepts]: Start accepts. Automaton has 18191 states and 54574 transitions. Word has length 55 [2019-12-19 04:07:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:27,853 INFO L462 AbstractCegarLoop]: Abstraction has 18191 states and 54574 transitions. [2019-12-19 04:07:27,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 18191 states and 54574 transitions. [2019-12-19 04:07:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 04:07:27,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:27,859 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] [2019-12-19 04:07:27,859 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -274013666, now seen corresponding path program 1 times [2019-12-19 04:07:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:27,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380864409] [2019-12-19 04:07:27,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:27,952 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 04:07:27,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380864409] [2019-12-19 04:07:27,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:27,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:27,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82114431] [2019-12-19 04:07:27,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:27,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:27,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:27,954 INFO L87 Difference]: Start difference. First operand 18191 states and 54574 transitions. Second operand 4 states. [2019-12-19 04:07:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:28,271 INFO L93 Difference]: Finished difference Result 23511 states and 70752 transitions. [2019-12-19 04:07:28,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:07:28,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 04:07:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:28,320 INFO L225 Difference]: With dead ends: 23511 [2019-12-19 04:07:28,321 INFO L226 Difference]: Without dead ends: 23511 [2019-12-19 04:07:28,321 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 04:07:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23511 states. [2019-12-19 04:07:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23511 to 21213. [2019-12-19 04:07:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21213 states. [2019-12-19 04:07:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21213 states to 21213 states and 63559 transitions. [2019-12-19 04:07:28,711 INFO L78 Accepts]: Start accepts. Automaton has 21213 states and 63559 transitions. Word has length 64 [2019-12-19 04:07:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:28,712 INFO L462 AbstractCegarLoop]: Abstraction has 21213 states and 63559 transitions. [2019-12-19 04:07:28,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21213 states and 63559 transitions. [2019-12-19 04:07:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 04:07:28,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:28,719 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] [2019-12-19 04:07:28,719 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1468796669, now seen corresponding path program 1 times [2019-12-19 04:07:28,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:28,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844419144] [2019-12-19 04:07:28,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:28,793 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 04:07:28,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844419144] [2019-12-19 04:07:28,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:28,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:07:28,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672405501] [2019-12-19 04:07:28,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:07:28,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:07:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:07:28,794 INFO L87 Difference]: Start difference. First operand 21213 states and 63559 transitions. Second operand 6 states. [2019-12-19 04:07:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:30,910 INFO L93 Difference]: Finished difference Result 30325 states and 89099 transitions. [2019-12-19 04:07:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:07:30,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 04:07:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:30,953 INFO L225 Difference]: With dead ends: 30325 [2019-12-19 04:07:30,953 INFO L226 Difference]: Without dead ends: 30277 [2019-12-19 04:07:30,953 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 04:07:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30277 states. [2019-12-19 04:07:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30277 to 27630. [2019-12-19 04:07:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27630 states. [2019-12-19 04:07:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27630 states to 27630 states and 81446 transitions. [2019-12-19 04:07:31,317 INFO L78 Accepts]: Start accepts. Automaton has 27630 states and 81446 transitions. Word has length 64 [2019-12-19 04:07:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:31,317 INFO L462 AbstractCegarLoop]: Abstraction has 27630 states and 81446 transitions. [2019-12-19 04:07:31,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:07:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 27630 states and 81446 transitions. [2019-12-19 04:07:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 04:07:31,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:31,330 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] [2019-12-19 04:07:31,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash -466486930, now seen corresponding path program 1 times [2019-12-19 04:07:31,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:31,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526968305] [2019-12-19 04:07:31,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:31,383 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 04:07:31,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526968305] [2019-12-19 04:07:31,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:31,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:31,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707886752] [2019-12-19 04:07:31,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:31,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:31,385 INFO L87 Difference]: Start difference. First operand 27630 states and 81446 transitions. Second operand 3 states. [2019-12-19 04:07:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:31,522 INFO L93 Difference]: Finished difference Result 30273 states and 87660 transitions. [2019-12-19 04:07:31,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:31,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 04:07:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:31,563 INFO L225 Difference]: With dead ends: 30273 [2019-12-19 04:07:31,563 INFO L226 Difference]: Without dead ends: 30273 [2019-12-19 04:07:31,563 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 04:07:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30273 states. [2019-12-19 04:07:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30273 to 26778. [2019-12-19 04:07:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26778 states. [2019-12-19 04:07:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26778 states to 26778 states and 76974 transitions. [2019-12-19 04:07:31,923 INFO L78 Accepts]: Start accepts. Automaton has 26778 states and 76974 transitions. Word has length 70 [2019-12-19 04:07:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:31,923 INFO L462 AbstractCegarLoop]: Abstraction has 26778 states and 76974 transitions. [2019-12-19 04:07:31,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26778 states and 76974 transitions. [2019-12-19 04:07:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 04:07:31,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:31,935 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] [2019-12-19 04:07:31,935 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1471156380, now seen corresponding path program 1 times [2019-12-19 04:07:31,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:31,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636618575] [2019-12-19 04:07:31,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:32,047 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 04:07:32,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636618575] [2019-12-19 04:07:32,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:32,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:32,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684204775] [2019-12-19 04:07:32,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:32,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:32,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:32,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:32,049 INFO L87 Difference]: Start difference. First operand 26778 states and 76974 transitions. Second operand 8 states. [2019-12-19 04:07:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:33,193 INFO L93 Difference]: Finished difference Result 31593 states and 89546 transitions. [2019-12-19 04:07:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:07:33,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-19 04:07:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:33,234 INFO L225 Difference]: With dead ends: 31593 [2019-12-19 04:07:33,235 INFO L226 Difference]: Without dead ends: 31593 [2019-12-19 04:07:33,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:07:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31593 states. [2019-12-19 04:07:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31593 to 29050. [2019-12-19 04:07:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29050 states. [2019-12-19 04:07:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29050 states to 29050 states and 82882 transitions. [2019-12-19 04:07:33,617 INFO L78 Accepts]: Start accepts. Automaton has 29050 states and 82882 transitions. Word has length 72 [2019-12-19 04:07:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:33,618 INFO L462 AbstractCegarLoop]: Abstraction has 29050 states and 82882 transitions. [2019-12-19 04:07:33,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29050 states and 82882 transitions. [2019-12-19 04:07:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 04:07:33,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:33,632 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] [2019-12-19 04:07:33,632 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1936307235, now seen corresponding path program 1 times [2019-12-19 04:07:33,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:33,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036985660] [2019-12-19 04:07:33,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:33,709 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 04:07:33,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036985660] [2019-12-19 04:07:33,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:33,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:33,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528062005] [2019-12-19 04:07:33,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:33,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:33,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:33,711 INFO L87 Difference]: Start difference. First operand 29050 states and 82882 transitions. Second operand 5 states. [2019-12-19 04:07:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:33,778 INFO L93 Difference]: Finished difference Result 10753 states and 26725 transitions. [2019-12-19 04:07:33,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:07:33,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-19 04:07:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:33,792 INFO L225 Difference]: With dead ends: 10753 [2019-12-19 04:07:33,792 INFO L226 Difference]: Without dead ends: 9370 [2019-12-19 04:07:33,792 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 04:07:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9370 states. [2019-12-19 04:07:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9370 to 7101. [2019-12-19 04:07:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7101 states. [2019-12-19 04:07:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7101 states to 7101 states and 17699 transitions. [2019-12-19 04:07:33,890 INFO L78 Accepts]: Start accepts. Automaton has 7101 states and 17699 transitions. Word has length 72 [2019-12-19 04:07:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:33,890 INFO L462 AbstractCegarLoop]: Abstraction has 7101 states and 17699 transitions. [2019-12-19 04:07:33,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:07:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7101 states and 17699 transitions. [2019-12-19 04:07:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:33,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:07:33,897 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:33,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1268369208, now seen corresponding path program 1 times [2019-12-19 04:07:33,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:33,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567344624] [2019-12-19 04:07:33,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:33,955 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 04:07:33,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567344624] [2019-12-19 04:07:33,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:33,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:33,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188339212] [2019-12-19 04:07:33,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:33,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:33,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:33,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:33,957 INFO L87 Difference]: Start difference. First operand 7101 states and 17699 transitions. Second operand 3 states. [2019-12-19 04:07:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:34,049 INFO L93 Difference]: Finished difference Result 7155 states and 17825 transitions. [2019-12-19 04:07:34,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:34,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-19 04:07:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:34,057 INFO L225 Difference]: With dead ends: 7155 [2019-12-19 04:07:34,057 INFO L226 Difference]: Without dead ends: 7155 [2019-12-19 04:07:34,058 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 04:07:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7155 states. [2019-12-19 04:07:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7155 to 7146. [2019-12-19 04:07:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7146 states. [2019-12-19 04:07:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7146 states to 7146 states and 17804 transitions. [2019-12-19 04:07:34,132 INFO L78 Accepts]: Start accepts. Automaton has 7146 states and 17804 transitions. Word has length 101 [2019-12-19 04:07:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:34,132 INFO L462 AbstractCegarLoop]: Abstraction has 7146 states and 17804 transitions. [2019-12-19 04:07:34,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 7146 states and 17804 transitions. [2019-12-19 04:07:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:34,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:34,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:34,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash 528582151, now seen corresponding path program 1 times [2019-12-19 04:07:34,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:34,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287132779] [2019-12-19 04:07:34,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:34,214 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 04:07:34,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287132779] [2019-12-19 04:07:34,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:34,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:34,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313049384] [2019-12-19 04:07:34,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:34,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:34,216 INFO L87 Difference]: Start difference. First operand 7146 states and 17804 transitions. Second operand 4 states. [2019-12-19 04:07:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:34,415 INFO L93 Difference]: Finished difference Result 8302 states and 20315 transitions. [2019-12-19 04:07:34,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:07:34,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-19 04:07:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:34,426 INFO L225 Difference]: With dead ends: 8302 [2019-12-19 04:07:34,426 INFO L226 Difference]: Without dead ends: 8302 [2019-12-19 04:07:34,427 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 04:07:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8302 states. [2019-12-19 04:07:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8302 to 7768. [2019-12-19 04:07:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7768 states. [2019-12-19 04:07:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7768 states to 7768 states and 19156 transitions. [2019-12-19 04:07:34,518 INFO L78 Accepts]: Start accepts. Automaton has 7768 states and 19156 transitions. Word has length 101 [2019-12-19 04:07:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:34,518 INFO L462 AbstractCegarLoop]: Abstraction has 7768 states and 19156 transitions. [2019-12-19 04:07:34,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7768 states and 19156 transitions. [2019-12-19 04:07:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:34,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:34,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:34,527 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1773346632, now seen corresponding path program 1 times [2019-12-19 04:07:34,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:34,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815050927] [2019-12-19 04:07:34,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:34,681 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-19 04:07:34,758 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 04:07:34,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815050927] [2019-12-19 04:07:34,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:34,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:34,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523240025] [2019-12-19 04:07:34,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:34,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:34,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:34,762 INFO L87 Difference]: Start difference. First operand 7768 states and 19156 transitions. Second operand 8 states. [2019-12-19 04:07:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:36,636 INFO L93 Difference]: Finished difference Result 16832 states and 39816 transitions. [2019-12-19 04:07:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-19 04:07:36,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-12-19 04:07:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:36,656 INFO L225 Difference]: With dead ends: 16832 [2019-12-19 04:07:36,656 INFO L226 Difference]: Without dead ends: 16741 [2019-12-19 04:07:36,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:07:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16741 states. [2019-12-19 04:07:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16741 to 13349. [2019-12-19 04:07:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13349 states. [2019-12-19 04:07:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13349 states to 13349 states and 32307 transitions. [2019-12-19 04:07:36,825 INFO L78 Accepts]: Start accepts. Automaton has 13349 states and 32307 transitions. Word has length 101 [2019-12-19 04:07:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:36,825 INFO L462 AbstractCegarLoop]: Abstraction has 13349 states and 32307 transitions. [2019-12-19 04:07:36,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 13349 states and 32307 transitions. [2019-12-19 04:07:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:36,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:36,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:36,842 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash -303862711, now seen corresponding path program 1 times [2019-12-19 04:07:36,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:36,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045983133] [2019-12-19 04:07:36,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:36,978 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 04:07:36,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045983133] [2019-12-19 04:07:36,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:36,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:36,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470912604] [2019-12-19 04:07:36,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:36,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:36,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:36,981 INFO L87 Difference]: Start difference. First operand 13349 states and 32307 transitions. Second operand 7 states. [2019-12-19 04:07:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:37,639 INFO L93 Difference]: Finished difference Result 18327 states and 42575 transitions. [2019-12-19 04:07:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:07:37,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:07:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:37,659 INFO L225 Difference]: With dead ends: 18327 [2019-12-19 04:07:37,659 INFO L226 Difference]: Without dead ends: 18327 [2019-12-19 04:07:37,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:07:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-12-19 04:07:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 15631. [2019-12-19 04:07:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15631 states. [2019-12-19 04:07:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15631 states to 15631 states and 36824 transitions. [2019-12-19 04:07:37,851 INFO L78 Accepts]: Start accepts. Automaton has 15631 states and 36824 transitions. Word has length 101 [2019-12-19 04:07:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:37,851 INFO L462 AbstractCegarLoop]: Abstraction has 15631 states and 36824 transitions. [2019-12-19 04:07:37,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 15631 states and 36824 transitions. [2019-12-19 04:07:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:37,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:37,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:37,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -92511798, now seen corresponding path program 1 times [2019-12-19 04:07:37,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:37,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722830053] [2019-12-19 04:07:37,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:37,955 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 04:07:37,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722830053] [2019-12-19 04:07:37,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:37,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:37,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585326685] [2019-12-19 04:07:37,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:37,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:37,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:37,964 INFO L87 Difference]: Start difference. First operand 15631 states and 36824 transitions. Second operand 7 states. [2019-12-19 04:07:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:38,992 INFO L93 Difference]: Finished difference Result 19332 states and 44797 transitions. [2019-12-19 04:07:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 04:07:38,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:07:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:39,014 INFO L225 Difference]: With dead ends: 19332 [2019-12-19 04:07:39,014 INFO L226 Difference]: Without dead ends: 19332 [2019-12-19 04:07:39,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-19 04:07:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19332 states. [2019-12-19 04:07:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19332 to 16146. [2019-12-19 04:07:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-19 04:07:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 37947 transitions. [2019-12-19 04:07:39,198 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 37947 transitions. Word has length 101 [2019-12-19 04:07:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:39,198 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 37947 transitions. [2019-12-19 04:07:39,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 37947 transitions. [2019-12-19 04:07:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:39,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:39,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:39,220 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1894969962, now seen corresponding path program 1 times [2019-12-19 04:07:39,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:39,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878902720] [2019-12-19 04:07:39,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:39,359 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 04:07:39,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878902720] [2019-12-19 04:07:39,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:39,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:39,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687398069] [2019-12-19 04:07:39,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:39,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:39,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:39,362 INFO L87 Difference]: Start difference. First operand 16146 states and 37947 transitions. Second operand 7 states. [2019-12-19 04:07:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:39,719 INFO L93 Difference]: Finished difference Result 16863 states and 39425 transitions. [2019-12-19 04:07:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:07:39,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-12-19 04:07:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:39,751 INFO L225 Difference]: With dead ends: 16863 [2019-12-19 04:07:39,751 INFO L226 Difference]: Without dead ends: 16863 [2019-12-19 04:07:39,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:07:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2019-12-19 04:07:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 15838. [2019-12-19 04:07:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15838 states. [2019-12-19 04:07:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15838 states to 15838 states and 37229 transitions. [2019-12-19 04:07:40,104 INFO L78 Accepts]: Start accepts. Automaton has 15838 states and 37229 transitions. Word has length 101 [2019-12-19 04:07:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:40,104 INFO L462 AbstractCegarLoop]: Abstraction has 15838 states and 37229 transitions. [2019-12-19 04:07:40,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 15838 states and 37229 transitions. [2019-12-19 04:07:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:40,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:40,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:40,131 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:40,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1512493653, now seen corresponding path program 1 times [2019-12-19 04:07:40,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:40,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312410354] [2019-12-19 04:07:40,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:40,252 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 04:07:40,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312410354] [2019-12-19 04:07:40,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:40,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:07:40,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603316629] [2019-12-19 04:07:40,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:07:40,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:07:40,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:40,254 INFO L87 Difference]: Start difference. First operand 15838 states and 37229 transitions. Second operand 4 states. [2019-12-19 04:07:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:40,595 INFO L93 Difference]: Finished difference Result 15935 states and 37478 transitions. [2019-12-19 04:07:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:07:40,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-19 04:07:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:40,619 INFO L225 Difference]: With dead ends: 15935 [2019-12-19 04:07:40,619 INFO L226 Difference]: Without dead ends: 15935 [2019-12-19 04:07:40,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:07:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15935 states. [2019-12-19 04:07:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15935 to 15139. [2019-12-19 04:07:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15139 states. [2019-12-19 04:07:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15139 states to 15139 states and 35672 transitions. [2019-12-19 04:07:40,833 INFO L78 Accepts]: Start accepts. Automaton has 15139 states and 35672 transitions. Word has length 101 [2019-12-19 04:07:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:40,834 INFO L462 AbstractCegarLoop]: Abstraction has 15139 states and 35672 transitions. [2019-12-19 04:07:40,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:07:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15139 states and 35672 transitions. [2019-12-19 04:07:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:40,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:40,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:40,848 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1361312710, now seen corresponding path program 1 times [2019-12-19 04:07:40,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:40,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53706400] [2019-12-19 04:07:40,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:40,907 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 04:07:40,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53706400] [2019-12-19 04:07:40,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:40,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:40,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329903021] [2019-12-19 04:07:40,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:40,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:40,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:40,909 INFO L87 Difference]: Start difference. First operand 15139 states and 35672 transitions. Second operand 5 states. [2019-12-19 04:07:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:41,267 INFO L93 Difference]: Finished difference Result 17011 states and 39557 transitions. [2019-12-19 04:07:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:07:41,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-19 04:07:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:41,295 INFO L225 Difference]: With dead ends: 17011 [2019-12-19 04:07:41,295 INFO L226 Difference]: Without dead ends: 17011 [2019-12-19 04:07:41,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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 04:07:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17011 states. [2019-12-19 04:07:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17011 to 15291. [2019-12-19 04:07:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15291 states. [2019-12-19 04:07:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15291 states to 15291 states and 35998 transitions. [2019-12-19 04:07:41,659 INFO L78 Accepts]: Start accepts. Automaton has 15291 states and 35998 transitions. Word has length 101 [2019-12-19 04:07:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:41,659 INFO L462 AbstractCegarLoop]: Abstraction has 15291 states and 35998 transitions. [2019-12-19 04:07:41,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:07:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15291 states and 35998 transitions. [2019-12-19 04:07:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:41,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:41,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:41,681 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1808902998, now seen corresponding path program 2 times [2019-12-19 04:07:41,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:41,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470504316] [2019-12-19 04:07:41,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:41,813 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 04:07:41,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470504316] [2019-12-19 04:07:41,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:41,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:07:41,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406050405] [2019-12-19 04:07:41,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:07:41,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:41,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:07:41,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:07:41,815 INFO L87 Difference]: Start difference. First operand 15291 states and 35998 transitions. Second operand 8 states. [2019-12-19 04:07:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:43,466 INFO L93 Difference]: Finished difference Result 20358 states and 47226 transitions. [2019-12-19 04:07:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 04:07:43,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-12-19 04:07:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:43,490 INFO L225 Difference]: With dead ends: 20358 [2019-12-19 04:07:43,490 INFO L226 Difference]: Without dead ends: 20288 [2019-12-19 04:07:43,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-12-19 04:07:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20288 states. [2019-12-19 04:07:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20288 to 15425. [2019-12-19 04:07:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15425 states. [2019-12-19 04:07:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15425 states to 15425 states and 36263 transitions. [2019-12-19 04:07:43,696 INFO L78 Accepts]: Start accepts. Automaton has 15425 states and 36263 transitions. Word has length 101 [2019-12-19 04:07:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:43,696 INFO L462 AbstractCegarLoop]: Abstraction has 15425 states and 36263 transitions. [2019-12-19 04:07:43,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:07:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15425 states and 36263 transitions. [2019-12-19 04:07:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:43,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:43,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:43,713 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 408854955, now seen corresponding path program 2 times [2019-12-19 04:07:43,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:43,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709994783] [2019-12-19 04:07:43,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:43,761 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 04:07:43,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709994783] [2019-12-19 04:07:43,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:43,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:07:43,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11628850] [2019-12-19 04:07:43,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:07:43,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:43,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:07:43,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:07:43,766 INFO L87 Difference]: Start difference. First operand 15425 states and 36263 transitions. Second operand 3 states. [2019-12-19 04:07:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:43,842 INFO L93 Difference]: Finished difference Result 18510 states and 43348 transitions. [2019-12-19 04:07:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:07:43,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-12-19 04:07:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:43,870 INFO L225 Difference]: With dead ends: 18510 [2019-12-19 04:07:43,871 INFO L226 Difference]: Without dead ends: 18510 [2019-12-19 04:07:43,871 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 04:07:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18510 states. [2019-12-19 04:07:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18510 to 18425. [2019-12-19 04:07:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18425 states. [2019-12-19 04:07:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18425 states to 18425 states and 43165 transitions. [2019-12-19 04:07:44,173 INFO L78 Accepts]: Start accepts. Automaton has 18425 states and 43165 transitions. Word has length 101 [2019-12-19 04:07:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:44,174 INFO L462 AbstractCegarLoop]: Abstraction has 18425 states and 43165 transitions. [2019-12-19 04:07:44,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:07:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 18425 states and 43165 transitions. [2019-12-19 04:07:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-19 04:07:44,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:44,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:44,200 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:44,201 INFO L82 PathProgramCache]: Analyzing trace with hash 759654892, now seen corresponding path program 1 times [2019-12-19 04:07:44,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:44,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664232122] [2019-12-19 04:07:44,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:44,276 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 04:07:44,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664232122] [2019-12-19 04:07:44,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:44,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:07:44,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132162535] [2019-12-19 04:07:44,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:07:44,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:07:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:07:44,279 INFO L87 Difference]: Start difference. First operand 18425 states and 43165 transitions. Second operand 5 states. [2019-12-19 04:07:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:44,690 INFO L93 Difference]: Finished difference Result 21718 states and 50598 transitions. [2019-12-19 04:07:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:07:44,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-12-19 04:07:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:44,713 INFO L225 Difference]: With dead ends: 21718 [2019-12-19 04:07:44,713 INFO L226 Difference]: Without dead ends: 21718 [2019-12-19 04:07:44,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2019-12-19 04:07:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 18345. [2019-12-19 04:07:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18345 states. [2019-12-19 04:07:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18345 states to 18345 states and 42896 transitions. [2019-12-19 04:07:45,005 INFO L78 Accepts]: Start accepts. Automaton has 18345 states and 42896 transitions. Word has length 101 [2019-12-19 04:07:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:45,005 INFO L462 AbstractCegarLoop]: Abstraction has 18345 states and 42896 transitions. [2019-12-19 04:07:45,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:07:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 18345 states and 42896 transitions. [2019-12-19 04:07:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:45,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:45,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:45,021 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash -218448047, now seen corresponding path program 1 times [2019-12-19 04:07:45,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:45,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685351222] [2019-12-19 04:07:45,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:45,183 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 04:07:45,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685351222] [2019-12-19 04:07:45,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:45,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:07:45,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542803572] [2019-12-19 04:07:45,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:07:45,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:07:45,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:07:45,185 INFO L87 Difference]: Start difference. First operand 18345 states and 42896 transitions. Second operand 11 states. [2019-12-19 04:07:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:45,784 INFO L93 Difference]: Finished difference Result 26443 states and 61208 transitions. [2019-12-19 04:07:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 04:07:45,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-19 04:07:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:45,815 INFO L225 Difference]: With dead ends: 26443 [2019-12-19 04:07:45,815 INFO L226 Difference]: Without dead ends: 24687 [2019-12-19 04:07:45,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-19 04:07:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24687 states. [2019-12-19 04:07:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24687 to 22620. [2019-12-19 04:07:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22620 states. [2019-12-19 04:07:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22620 states to 22620 states and 52924 transitions. [2019-12-19 04:07:46,086 INFO L78 Accepts]: Start accepts. Automaton has 22620 states and 52924 transitions. Word has length 103 [2019-12-19 04:07:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:46,086 INFO L462 AbstractCegarLoop]: Abstraction has 22620 states and 52924 transitions. [2019-12-19 04:07:46,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:07:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 22620 states and 52924 transitions. [2019-12-19 04:07:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:46,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:46,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:46,107 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1205242523, now seen corresponding path program 1 times [2019-12-19 04:07:46,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:46,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165821205] [2019-12-19 04:07:46,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:46,229 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 04:07:46,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165821205] [2019-12-19 04:07:46,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:46,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:07:46,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574487913] [2019-12-19 04:07:46,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:07:46,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:07:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:07:46,231 INFO L87 Difference]: Start difference. First operand 22620 states and 52924 transitions. Second operand 7 states. [2019-12-19 04:07:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:46,388 INFO L93 Difference]: Finished difference Result 23161 states and 54113 transitions. [2019-12-19 04:07:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:07:46,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-19 04:07:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:46,393 INFO L225 Difference]: With dead ends: 23161 [2019-12-19 04:07:46,393 INFO L226 Difference]: Without dead ends: 3280 [2019-12-19 04:07:46,394 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 04:07:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2019-12-19 04:07:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3278. [2019-12-19 04:07:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2019-12-19 04:07:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 7704 transitions. [2019-12-19 04:07:46,427 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 7704 transitions. Word has length 103 [2019-12-19 04:07:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:46,427 INFO L462 AbstractCegarLoop]: Abstraction has 3278 states and 7704 transitions. [2019-12-19 04:07:46,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:07:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 7704 transitions. [2019-12-19 04:07:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:46,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:46,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:46,431 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash 368428420, now seen corresponding path program 1 times [2019-12-19 04:07:46,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:46,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328334310] [2019-12-19 04:07:46,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:07:46,582 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 04:07:46,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328334310] [2019-12-19 04:07:46,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:07:46,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:07:46,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975004278] [2019-12-19 04:07:46,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:07:46,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:07:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:07:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:07:46,584 INFO L87 Difference]: Start difference. First operand 3278 states and 7704 transitions. Second operand 11 states. [2019-12-19 04:07:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:07:47,085 INFO L93 Difference]: Finished difference Result 6274 states and 14366 transitions. [2019-12-19 04:07:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-19 04:07:47,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-12-19 04:07:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:07:47,090 INFO L225 Difference]: With dead ends: 6274 [2019-12-19 04:07:47,091 INFO L226 Difference]: Without dead ends: 4479 [2019-12-19 04:07:47,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2019-12-19 04:07:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2019-12-19 04:07:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 3316. [2019-12-19 04:07:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2019-12-19 04:07:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 7727 transitions. [2019-12-19 04:07:47,125 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 7727 transitions. Word has length 103 [2019-12-19 04:07:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:07:47,125 INFO L462 AbstractCegarLoop]: Abstraction has 3316 states and 7727 transitions. [2019-12-19 04:07:47,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:07:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 7727 transitions. [2019-12-19 04:07:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-19 04:07:47,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:07:47,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:07:47,128 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:07:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:07:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1899206436, now seen corresponding path program 2 times [2019-12-19 04:07:47,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:07:47,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907259420] [2019-12-19 04:07:47,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:07:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:07:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:07:47,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:07:47,221 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:07:47,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:07:47 BasicIcfg [2019-12-19 04:07:47,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:07:47,429 INFO L168 Benchmark]: Toolchain (without parser) took 110439.67 ms. Allocated memory was 139.5 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,430 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.59 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 159.4 MB in the end (delta: -58.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.21 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,431 INFO L168 Benchmark]: Boogie Preprocessor took 44.36 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,431 INFO L168 Benchmark]: RCFGBuilder took 867.32 ms. Allocated memory is still 204.5 MB. Free memory was 153.5 MB in the beginning and 100.8 MB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,438 INFO L168 Benchmark]: TraceAbstraction took 108622.00 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 04:07:47,440 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.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.59 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.4 MB in the beginning and 159.4 MB in the end (delta: -58.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.21 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.36 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.32 ms. Allocated memory is still 204.5 MB. Free memory was 153.5 MB in the beginning and 100.8 MB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108622.00 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 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] [L722] 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] [L723] 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] [L809] 0 pthread_t t1763; 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] [L810] FCALL, FORK 0 pthread_create(&t1763, ((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] [L811] 0 pthread_t t1764; 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] [L812] FCALL, FORK 0 pthread_create(&t1764, ((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] [L757] 2 y$w_buff1 = y$w_buff0 [L758] 2 y$w_buff0 = 1 [L759] 2 y$w_buff1_used = y$w_buff0_used [L760] 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] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y 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=6, weak$$choice2=1, x=0, 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] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) 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=6, weak$$choice2=1, x=0, 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] [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 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=6, weak$$choice2=1, x=0, 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] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) 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=6, weak$$choice2=1, x=0, 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] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) 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=6, weak$$choice2=1, x=0, 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] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) 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=6, weak$$choice2=1, x=0, 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] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) 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=6, weak$$choice2=1, x=0, 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] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=0, 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] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) 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=6, weak$$choice2=1, x=0, 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] [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=6, weak$$choice2=1, x=0, 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] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = 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=6, weak$$choice2=1, x=0, 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] [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : 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=6, weak$$choice2=1, x=0, 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] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 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=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 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] [L736] 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] [L736] 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) [L737] 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=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, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 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)) [L738] 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=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, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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)) [L739] 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=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, 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))=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] [L739] 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)) [L740] 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=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, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 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)) [L787] 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}, 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] [L741] 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=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, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 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)) [L742] 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=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, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 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)) [L743] 1 __unbuffered_p0_EAX = 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] [L744] EXPR 1 y$flush_delayed ? 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$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=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used 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=1, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 [L750] 1 __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=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] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 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 [__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=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] [L789] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 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=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] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 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=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=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] [L791] 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 [L794] 2 __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] [L814] 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] [L818] 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] [L818] 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] [L818] 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] [L818] 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) [L819] 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] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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] [L820] 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 [L821] 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] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] 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] [L822] 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 [L825] 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] [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] [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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.1s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10195 SDtfs, 11556 SDslu, 26044 SDs, 0 SdLazy, 9579 SolverSat, 588 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 80 SyntacticMatches, 13 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196980occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 57.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 194221 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2266 NumberOfCodeBlocks, 2266 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2136 ConstructedInterpolants, 0 QuantifiedInterpolants, 430707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...