/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:11:01,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:11:01,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:11:01,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:11:01,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:11:01,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:11:01,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:11:01,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:11:01,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:11:01,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:11:01,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:11:01,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:11:01,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:11:01,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:11:01,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:11:01,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:11:01,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:11:01,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:11:01,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:11:01,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:11:01,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:11:01,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:11:01,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:11:01,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:11:01,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:11:01,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:11:01,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:11:01,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:11:01,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:11:01,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:11:01,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:11:01,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:11:01,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:11:01,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:11:01,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:11:01,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:11:01,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:11:01,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:11:01,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:11:01,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:11:01,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:11:01,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:11:01,891 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:11:01,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:11:01,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:11:01,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:11:01,893 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:11:01,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:11:01,893 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:11:01,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:11:01,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:11:01,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:11:01,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:11:01,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:11:01,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:11:01,895 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:11:01,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:11:01,895 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:11:01,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:11:01,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:11:01,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:11:01,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:11:01,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:11:01,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:11:01,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:11:01,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:11:01,897 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:11:01,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:11:01,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:11:01,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:11:01,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:11:01,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:11:02,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:11:02,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:11:02,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:11:02,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:11:02,214 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:11:02,215 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2019-12-26 22:11:02,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83296ab4b/4ac040f8c5f448e7aca327495e95e2c7/FLAGed5cba37b [2019-12-26 22:11:02,903 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:11:02,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2019-12-26 22:11:02,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83296ab4b/4ac040f8c5f448e7aca327495e95e2c7/FLAGed5cba37b [2019-12-26 22:11:03,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83296ab4b/4ac040f8c5f448e7aca327495e95e2c7 [2019-12-26 22:11:03,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:11:03,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:11:03,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:11:03,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:11:03,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:11:03,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:03,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a2a0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03, skipping insertion in model container [2019-12-26 22:11:03,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:03,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:11:03,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:11:03,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:11:03,811 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:11:03,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:11:03,950 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:11:03,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03 WrapperNode [2019-12-26 22:11:03,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:11:03,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:11:03,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:11:03,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:11:03,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:03,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:11:04,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:11:04,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:11:04,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:11:04,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (1/1) ... [2019-12-26 22:11:04,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:11:04,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:11:04,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:11:04,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:11:04,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (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-26 22:11:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:11:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:11:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:11:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:11:04,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:11:04,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:11:04,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:11:04,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:11:04,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:11:04,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:11:04,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:11:04,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:11:04,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:11:04,158 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:11:05,030 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:11:05,047 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:11:05,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:11:05 BoogieIcfgContainer [2019-12-26 22:11:05,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:11:05,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:11:05,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:11:05,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:11:05,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:11:03" (1/3) ... [2019-12-26 22:11:05,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1d22a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:11:05, skipping insertion in model container [2019-12-26 22:11:05,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:11:03" (2/3) ... [2019-12-26 22:11:05,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1d22a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:11:05, skipping insertion in model container [2019-12-26 22:11:05,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:11:05" (3/3) ... [2019-12-26 22:11:05,057 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.oepc.i [2019-12-26 22:11:05,068 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:11:05,068 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:11:05,076 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:11:05,077 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:11:05,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,117 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,118 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,128 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,132 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,163 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:11:05,184 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:11:05,202 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:11:05,202 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:11:05,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:11:05,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:11:05,203 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:11:05,203 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:11:05,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:11:05,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:11:05,222 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-26 22:11:05,224 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-26 22:11:05,372 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-26 22:11:05,372 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:11:05,388 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-26 22:11:05,420 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-26 22:11:05,487 INFO L132 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-26 22:11:05,487 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:11:05,500 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 0/190 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-26 22:11:05,535 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-26 22:11:05,536 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:11:10,901 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-26 22:11:11,212 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 22:11:11,352 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:11:11,496 INFO L206 etLargeBlockEncoding]: Checked pairs total: 165402 [2019-12-26 22:11:11,497 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-26 22:11:11,500 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 143 transitions [2019-12-26 22:11:16,506 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 57466 states. [2019-12-26 22:11:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 57466 states. [2019-12-26 22:11:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:11:16,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:16,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:16,516 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -953839885, now seen corresponding path program 1 times [2019-12-26 22:11:16,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:16,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422311597] [2019-12-26 22:11:16,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:16,837 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-26 22:11:16,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422311597] [2019-12-26 22:11:16,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:16,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:11:16,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214675112] [2019-12-26 22:11:16,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:16,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:16,858 INFO L87 Difference]: Start difference. First operand 57466 states. Second operand 3 states. [2019-12-26 22:11:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:19,271 INFO L93 Difference]: Finished difference Result 57370 states and 231250 transitions. [2019-12-26 22:11:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:19,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:11:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:19,724 INFO L225 Difference]: With dead ends: 57370 [2019-12-26 22:11:19,725 INFO L226 Difference]: Without dead ends: 56226 [2019-12-26 22:11:19,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-26 22:11:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56226 states. [2019-12-26 22:11:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56226 to 56226. [2019-12-26 22:11:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56226 states. [2019-12-26 22:11:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56226 states to 56226 states and 226882 transitions. [2019-12-26 22:11:23,096 INFO L78 Accepts]: Start accepts. Automaton has 56226 states and 226882 transitions. Word has length 7 [2019-12-26 22:11:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:23,097 INFO L462 AbstractCegarLoop]: Abstraction has 56226 states and 226882 transitions. [2019-12-26 22:11:23,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 56226 states and 226882 transitions. [2019-12-26 22:11:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:11:23,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:23,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:23,112 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash 749632042, now seen corresponding path program 1 times [2019-12-26 22:11:23,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:23,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203428773] [2019-12-26 22:11:23,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:23,244 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-26 22:11:23,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203428773] [2019-12-26 22:11:23,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:23,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:23,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988662880] [2019-12-26 22:11:23,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:23,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:23,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:23,249 INFO L87 Difference]: Start difference. First operand 56226 states and 226882 transitions. Second operand 4 states. [2019-12-26 22:11:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:26,044 INFO L93 Difference]: Finished difference Result 90514 states and 350820 transitions. [2019-12-26 22:11:26,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:26,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:11:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:26,543 INFO L225 Difference]: With dead ends: 90514 [2019-12-26 22:11:26,543 INFO L226 Difference]: Without dead ends: 90500 [2019-12-26 22:11:26,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90500 states. [2019-12-26 22:11:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90500 to 87886. [2019-12-26 22:11:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87886 states. [2019-12-26 22:11:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87886 states to 87886 states and 342542 transitions. [2019-12-26 22:11:30,630 INFO L78 Accepts]: Start accepts. Automaton has 87886 states and 342542 transitions. Word has length 13 [2019-12-26 22:11:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:30,631 INFO L462 AbstractCegarLoop]: Abstraction has 87886 states and 342542 transitions. [2019-12-26 22:11:30,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 87886 states and 342542 transitions. [2019-12-26 22:11:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:11:30,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:30,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:30,633 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1969493490, now seen corresponding path program 1 times [2019-12-26 22:11:30,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:30,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875529958] [2019-12-26 22:11:30,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:30,708 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-26 22:11:30,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875529958] [2019-12-26 22:11:30,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:30,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:30,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448862444] [2019-12-26 22:11:30,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:30,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:30,712 INFO L87 Difference]: Start difference. First operand 87886 states and 342542 transitions. Second operand 3 states. [2019-12-26 22:11:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:30,887 INFO L93 Difference]: Finished difference Result 48011 states and 163167 transitions. [2019-12-26 22:11:30,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:30,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:11:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:31,009 INFO L225 Difference]: With dead ends: 48011 [2019-12-26 22:11:31,009 INFO L226 Difference]: Without dead ends: 48011 [2019-12-26 22:11:31,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 22:11:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48011 states. [2019-12-26 22:11:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48011 to 48011. [2019-12-26 22:11:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-12-26 22:11:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 163167 transitions. [2019-12-26 22:11:35,540 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 163167 transitions. Word has length 13 [2019-12-26 22:11:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 48011 states and 163167 transitions. [2019-12-26 22:11:35,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 163167 transitions. [2019-12-26 22:11:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:11:35,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:35,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:11:35,542 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash 802741009, now seen corresponding path program 1 times [2019-12-26 22:11:35,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:35,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019920742] [2019-12-26 22:11:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:35,594 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-26 22:11:35,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019920742] [2019-12-26 22:11:35,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:35,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:35,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553516212] [2019-12-26 22:11:35,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:35,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:35,597 INFO L87 Difference]: Start difference. First operand 48011 states and 163167 transitions. Second operand 4 states. [2019-12-26 22:11:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:35,631 INFO L93 Difference]: Finished difference Result 5081 states and 12972 transitions. [2019-12-26 22:11:35,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:11:35,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:11:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:35,639 INFO L225 Difference]: With dead ends: 5081 [2019-12-26 22:11:35,640 INFO L226 Difference]: Without dead ends: 5081 [2019-12-26 22:11:35,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-12-26 22:11:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2019-12-26 22:11:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-12-26 22:11:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 12972 transitions. [2019-12-26 22:11:35,709 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 12972 transitions. Word has length 14 [2019-12-26 22:11:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:35,710 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 12972 transitions. [2019-12-26 22:11:35,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 12972 transitions. [2019-12-26 22:11:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:11:35,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:35,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] [2019-12-26 22:11:35,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1593078696, now seen corresponding path program 1 times [2019-12-26 22:11:35,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:35,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277838902] [2019-12-26 22:11:35,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:35,773 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-26 22:11:35,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277838902] [2019-12-26 22:11:35,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:35,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:11:35,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006098149] [2019-12-26 22:11:35,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:35,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:35,776 INFO L87 Difference]: Start difference. First operand 5081 states and 12972 transitions. Second operand 5 states. [2019-12-26 22:11:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:35,810 INFO L93 Difference]: Finished difference Result 1979 states and 5224 transitions. [2019-12-26 22:11:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:11:35,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:11:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:35,815 INFO L225 Difference]: With dead ends: 1979 [2019-12-26 22:11:35,815 INFO L226 Difference]: Without dead ends: 1979 [2019-12-26 22:11:35,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-26 22:11:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1881. [2019-12-26 22:11:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-26 22:11:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4993 transitions. [2019-12-26 22:11:35,845 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4993 transitions. Word has length 26 [2019-12-26 22:11:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:35,845 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4993 transitions. [2019-12-26 22:11:35,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4993 transitions. [2019-12-26 22:11:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-26 22:11:35,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:35,851 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] [2019-12-26 22:11:35,851 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 76160980, now seen corresponding path program 1 times [2019-12-26 22:11:35,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:35,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937140711] [2019-12-26 22:11:35,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:36,042 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-26 22:11:36,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937140711] [2019-12-26 22:11:36,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:36,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:36,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156511249] [2019-12-26 22:11:36,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:11:36,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:11:36,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:11:36,045 INFO L87 Difference]: Start difference. First operand 1881 states and 4993 transitions. Second operand 5 states. [2019-12-26 22:11:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:36,559 INFO L93 Difference]: Finished difference Result 2818 states and 7401 transitions. [2019-12-26 22:11:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:11:36,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-26 22:11:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:36,564 INFO L225 Difference]: With dead ends: 2818 [2019-12-26 22:11:36,564 INFO L226 Difference]: Without dead ends: 2818 [2019-12-26 22:11:36,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-26 22:11:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2057. [2019-12-26 22:11:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-12-26 22:11:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 5485 transitions. [2019-12-26 22:11:36,595 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 5485 transitions. Word has length 71 [2019-12-26 22:11:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:36,595 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 5485 transitions. [2019-12-26 22:11:36,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:11:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 5485 transitions. [2019-12-26 22:11:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-26 22:11:36,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:36,601 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] [2019-12-26 22:11:36,602 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash -789175518, now seen corresponding path program 2 times [2019-12-26 22:11:36,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:36,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712765305] [2019-12-26 22:11:36,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:36,725 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-26 22:11:36,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712765305] [2019-12-26 22:11:36,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:36,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:36,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532855458] [2019-12-26 22:11:36,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:36,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:36,727 INFO L87 Difference]: Start difference. First operand 2057 states and 5485 transitions. Second operand 6 states. [2019-12-26 22:11:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:37,324 INFO L93 Difference]: Finished difference Result 2346 states and 6185 transitions. [2019-12-26 22:11:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:11:37,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-26 22:11:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:37,329 INFO L225 Difference]: With dead ends: 2346 [2019-12-26 22:11:37,330 INFO L226 Difference]: Without dead ends: 2346 [2019-12-26 22:11:37,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-12-26 22:11:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2127. [2019-12-26 22:11:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-26 22:11:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 5650 transitions. [2019-12-26 22:11:37,354 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 5650 transitions. Word has length 71 [2019-12-26 22:11:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:37,354 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 5650 transitions. [2019-12-26 22:11:37,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 5650 transitions. [2019-12-26 22:11:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-26 22:11:37,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:37,361 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] [2019-12-26 22:11:37,361 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 920625250, now seen corresponding path program 3 times [2019-12-26 22:11:37,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:37,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780731453] [2019-12-26 22:11:37,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:37,477 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-26 22:11:37,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780731453] [2019-12-26 22:11:37,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:37,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:37,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171237847] [2019-12-26 22:11:37,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:37,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:37,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:37,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:37,479 INFO L87 Difference]: Start difference. First operand 2127 states and 5650 transitions. Second operand 6 states. [2019-12-26 22:11:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:37,956 INFO L93 Difference]: Finished difference Result 3285 states and 8595 transitions. [2019-12-26 22:11:37,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:11:37,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-26 22:11:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:37,961 INFO L225 Difference]: With dead ends: 3285 [2019-12-26 22:11:37,961 INFO L226 Difference]: Without dead ends: 3285 [2019-12-26 22:11:37,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-12-26 22:11:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2411. [2019-12-26 22:11:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-26 22:11:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6298 transitions. [2019-12-26 22:11:37,989 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6298 transitions. Word has length 71 [2019-12-26 22:11:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:37,989 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 6298 transitions. [2019-12-26 22:11:37,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6298 transitions. [2019-12-26 22:11:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:37,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:37,995 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-26 22:11:37,995 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1439498402, now seen corresponding path program 1 times [2019-12-26 22:11:37,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:37,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234319573] [2019-12-26 22:11:37,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:38,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234319573] [2019-12-26 22:11:38,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:38,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:11:38,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869944035] [2019-12-26 22:11:38,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:11:38,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:38,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:11:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:11:38,127 INFO L87 Difference]: Start difference. First operand 2411 states and 6298 transitions. Second operand 8 states. [2019-12-26 22:11:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:38,957 INFO L93 Difference]: Finished difference Result 4056 states and 10526 transitions. [2019-12-26 22:11:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:11:38,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-26 22:11:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:38,964 INFO L225 Difference]: With dead ends: 4056 [2019-12-26 22:11:38,964 INFO L226 Difference]: Without dead ends: 4056 [2019-12-26 22:11:38,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:11:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-26 22:11:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2423. [2019-12-26 22:11:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-26 22:11:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6326 transitions. [2019-12-26 22:11:39,251 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6326 transitions. Word has length 72 [2019-12-26 22:11:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:39,252 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 6326 transitions. [2019-12-26 22:11:39,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:11:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6326 transitions. [2019-12-26 22:11:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:39,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:39,257 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-26 22:11:39,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 362991256, now seen corresponding path program 2 times [2019-12-26 22:11:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:39,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489837746] [2019-12-26 22:11:39,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:39,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489837746] [2019-12-26 22:11:39,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:39,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:39,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658375387] [2019-12-26 22:11:39,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:39,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:39,433 INFO L87 Difference]: Start difference. First operand 2423 states and 6326 transitions. Second operand 7 states. [2019-12-26 22:11:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:40,074 INFO L93 Difference]: Finished difference Result 4529 states and 11696 transitions. [2019-12-26 22:11:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:11:40,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-26 22:11:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:40,082 INFO L225 Difference]: With dead ends: 4529 [2019-12-26 22:11:40,082 INFO L226 Difference]: Without dead ends: 4529 [2019-12-26 22:11:40,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:11:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-12-26 22:11:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 2513. [2019-12-26 22:11:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-26 22:11:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 6593 transitions. [2019-12-26 22:11:40,118 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 6593 transitions. Word has length 72 [2019-12-26 22:11:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:40,118 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 6593 transitions. [2019-12-26 22:11:40,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 6593 transitions. [2019-12-26 22:11:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:40,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:40,125 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-26 22:11:40,125 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:40,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:40,125 INFO L82 PathProgramCache]: Analyzing trace with hash -697994534, now seen corresponding path program 3 times [2019-12-26 22:11:40,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:40,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263351763] [2019-12-26 22:11:40,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:40,228 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-26 22:11:40,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263351763] [2019-12-26 22:11:40,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:40,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:40,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738874927] [2019-12-26 22:11:40,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:40,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:40,231 INFO L87 Difference]: Start difference. First operand 2513 states and 6593 transitions. Second operand 7 states. [2019-12-26 22:11:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:40,911 INFO L93 Difference]: Finished difference Result 4357 states and 11298 transitions. [2019-12-26 22:11:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:11:40,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-26 22:11:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:40,918 INFO L225 Difference]: With dead ends: 4357 [2019-12-26 22:11:40,918 INFO L226 Difference]: Without dead ends: 4357 [2019-12-26 22:11:40,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:11:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2019-12-26 22:11:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 2495. [2019-12-26 22:11:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2019-12-26 22:11:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 6548 transitions. [2019-12-26 22:11:40,966 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 6548 transitions. Word has length 72 [2019-12-26 22:11:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:40,968 INFO L462 AbstractCegarLoop]: Abstraction has 2495 states and 6548 transitions. [2019-12-26 22:11:40,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 6548 transitions. [2019-12-26 22:11:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:40,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:40,972 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-26 22:11:40,973 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:40,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2080066259, now seen corresponding path program 1 times [2019-12-26 22:11:40,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:40,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385495987] [2019-12-26 22:11:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:41,059 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-26 22:11:41,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385495987] [2019-12-26 22:11:41,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:41,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:41,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327728285] [2019-12-26 22:11:41,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:41,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:41,061 INFO L87 Difference]: Start difference. First operand 2495 states and 6548 transitions. Second operand 6 states. [2019-12-26 22:11:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:41,616 INFO L93 Difference]: Finished difference Result 3310 states and 8595 transitions. [2019-12-26 22:11:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:11:41,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-26 22:11:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:41,622 INFO L225 Difference]: With dead ends: 3310 [2019-12-26 22:11:41,623 INFO L226 Difference]: Without dead ends: 3310 [2019-12-26 22:11:41,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-26 22:11:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 2691. [2019-12-26 22:11:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-12-26 22:11:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 7052 transitions. [2019-12-26 22:11:41,655 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 7052 transitions. Word has length 72 [2019-12-26 22:11:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:41,655 INFO L462 AbstractCegarLoop]: Abstraction has 2691 states and 7052 transitions. [2019-12-26 22:11:41,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 7052 transitions. [2019-12-26 22:11:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:41,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:41,659 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-26 22:11:41,660 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1499063086, now seen corresponding path program 1 times [2019-12-26 22:11:41,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:41,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518626180] [2019-12-26 22:11:41,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:41,851 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-26 22:11:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518626180] [2019-12-26 22:11:41,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:41,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:41,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092509718] [2019-12-26 22:11:41,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:41,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:41,857 INFO L87 Difference]: Start difference. First operand 2691 states and 7052 transitions. Second operand 9 states. [2019-12-26 22:11:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:42,815 INFO L93 Difference]: Finished difference Result 5119 states and 13182 transitions. [2019-12-26 22:11:42,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:11:42,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-12-26 22:11:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:42,823 INFO L225 Difference]: With dead ends: 5119 [2019-12-26 22:11:42,823 INFO L226 Difference]: Without dead ends: 5119 [2019-12-26 22:11:42,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:11:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-26 22:11:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 3223. [2019-12-26 22:11:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3223 states. [2019-12-26 22:11:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 8468 transitions. [2019-12-26 22:11:42,866 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 8468 transitions. Word has length 72 [2019-12-26 22:11:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:42,867 INFO L462 AbstractCegarLoop]: Abstraction has 3223 states and 8468 transitions. [2019-12-26 22:11:42,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:42,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 8468 transitions. [2019-12-26 22:11:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:42,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:42,871 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-26 22:11:42,871 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1043345266, now seen corresponding path program 2 times [2019-12-26 22:11:42,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:42,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731190937] [2019-12-26 22:11:42,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:43,054 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-26 22:11:43,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731190937] [2019-12-26 22:11:43,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:43,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:43,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694047987] [2019-12-26 22:11:43,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:43,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:43,056 INFO L87 Difference]: Start difference. First operand 3223 states and 8468 transitions. Second operand 9 states. [2019-12-26 22:11:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:44,459 INFO L93 Difference]: Finished difference Result 4883 states and 12643 transitions. [2019-12-26 22:11:44,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:11:44,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-12-26 22:11:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:44,466 INFO L225 Difference]: With dead ends: 4883 [2019-12-26 22:11:44,466 INFO L226 Difference]: Without dead ends: 4883 [2019-12-26 22:11:44,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:11:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-12-26 22:11:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3193. [2019-12-26 22:11:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3193 states. [2019-12-26 22:11:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 8387 transitions. [2019-12-26 22:11:44,508 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 8387 transitions. Word has length 72 [2019-12-26 22:11:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:44,508 INFO L462 AbstractCegarLoop]: Abstraction has 3193 states and 8387 transitions. [2019-12-26 22:11:44,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 8387 transitions. [2019-12-26 22:11:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-26 22:11:44,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:44,513 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-26 22:11:44,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1192354030, now seen corresponding path program 3 times [2019-12-26 22:11:44,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:44,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817577373] [2019-12-26 22:11:44,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:44,686 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-26 22:11:44,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817577373] [2019-12-26 22:11:44,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:44,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:44,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011972772] [2019-12-26 22:11:44,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:11:44,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:11:44,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:44,688 INFO L87 Difference]: Start difference. First operand 3193 states and 8387 transitions. Second operand 9 states. [2019-12-26 22:11:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:45,887 INFO L93 Difference]: Finished difference Result 4470 states and 11516 transitions. [2019-12-26 22:11:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:11:45,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-12-26 22:11:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:45,894 INFO L225 Difference]: With dead ends: 4470 [2019-12-26 22:11:45,894 INFO L226 Difference]: Without dead ends: 4470 [2019-12-26 22:11:45,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-26 22:11:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2019-12-26 22:11:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 2755. [2019-12-26 22:11:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2019-12-26 22:11:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 7260 transitions. [2019-12-26 22:11:45,932 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 7260 transitions. Word has length 72 [2019-12-26 22:11:45,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:45,933 INFO L462 AbstractCegarLoop]: Abstraction has 2755 states and 7260 transitions. [2019-12-26 22:11:45,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:11:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 7260 transitions. [2019-12-26 22:11:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:45,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:45,938 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] [2019-12-26 22:11:45,939 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash -298102113, now seen corresponding path program 1 times [2019-12-26 22:11:45,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:45,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636895573] [2019-12-26 22:11:45,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:46,004 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-26 22:11:46,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636895573] [2019-12-26 22:11:46,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:46,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:46,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006440098] [2019-12-26 22:11:46,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:46,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:46,006 INFO L87 Difference]: Start difference. First operand 2755 states and 7260 transitions. Second operand 3 states. [2019-12-26 22:11:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:46,026 INFO L93 Difference]: Finished difference Result 2331 states and 5972 transitions. [2019-12-26 22:11:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:46,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-26 22:11:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:46,031 INFO L225 Difference]: With dead ends: 2331 [2019-12-26 22:11:46,031 INFO L226 Difference]: Without dead ends: 2331 [2019-12-26 22:11:46,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 22:11:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2019-12-26 22:11:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2291. [2019-12-26 22:11:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-26 22:11:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 5860 transitions. [2019-12-26 22:11:46,063 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 5860 transitions. Word has length 73 [2019-12-26 22:11:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:46,063 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 5860 transitions. [2019-12-26 22:11:46,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 5860 transitions. [2019-12-26 22:11:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:46,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:46,067 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] [2019-12-26 22:11:46,067 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:46,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:46,067 INFO L82 PathProgramCache]: Analyzing trace with hash -393402248, now seen corresponding path program 1 times [2019-12-26 22:11:46,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:46,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991154098] [2019-12-26 22:11:46,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:46,128 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-26 22:11:46,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991154098] [2019-12-26 22:11:46,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:46,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:11:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867093769] [2019-12-26 22:11:46,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:11:46,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:11:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:11:46,131 INFO L87 Difference]: Start difference. First operand 2291 states and 5860 transitions. Second operand 3 states. [2019-12-26 22:11:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:46,174 INFO L93 Difference]: Finished difference Result 2290 states and 5858 transitions. [2019-12-26 22:11:46,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:11:46,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-26 22:11:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:46,178 INFO L225 Difference]: With dead ends: 2290 [2019-12-26 22:11:46,178 INFO L226 Difference]: Without dead ends: 2290 [2019-12-26 22:11:46,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-26 22:11:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-12-26 22:11:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2025. [2019-12-26 22:11:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-12-26 22:11:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5244 transitions. [2019-12-26 22:11:46,212 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5244 transitions. Word has length 73 [2019-12-26 22:11:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:46,213 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 5244 transitions. [2019-12-26 22:11:46,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:11:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5244 transitions. [2019-12-26 22:11:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:46,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:46,217 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] [2019-12-26 22:11:46,217 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1480966909, now seen corresponding path program 1 times [2019-12-26 22:11:46,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:46,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861897967] [2019-12-26 22:11:46,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:46,346 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-26 22:11:46,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861897967] [2019-12-26 22:11:46,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:46,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:46,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423467694] [2019-12-26 22:11:46,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:46,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:46,349 INFO L87 Difference]: Start difference. First operand 2025 states and 5244 transitions. Second operand 6 states. [2019-12-26 22:11:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:46,585 INFO L93 Difference]: Finished difference Result 2545 states and 6628 transitions. [2019-12-26 22:11:46,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:11:46,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-26 22:11:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:46,589 INFO L225 Difference]: With dead ends: 2545 [2019-12-26 22:11:46,589 INFO L226 Difference]: Without dead ends: 2545 [2019-12-26 22:11:46,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2019-12-26 22:11:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2319. [2019-12-26 22:11:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2319 states. [2019-12-26 22:11:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 6047 transitions. [2019-12-26 22:11:46,626 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 6047 transitions. Word has length 73 [2019-12-26 22:11:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:46,626 INFO L462 AbstractCegarLoop]: Abstraction has 2319 states and 6047 transitions. [2019-12-26 22:11:46,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 6047 transitions. [2019-12-26 22:11:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:46,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:46,631 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] [2019-12-26 22:11:46,632 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 114893229, now seen corresponding path program 2 times [2019-12-26 22:11:46,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:46,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72835154] [2019-12-26 22:11:46,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:46,738 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-26 22:11:46,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72835154] [2019-12-26 22:11:46,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:46,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:11:46,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442727976] [2019-12-26 22:11:46,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:46,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:46,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:46,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:46,740 INFO L87 Difference]: Start difference. First operand 2319 states and 6047 transitions. Second operand 6 states. [2019-12-26 22:11:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:47,065 INFO L93 Difference]: Finished difference Result 3292 states and 8513 transitions. [2019-12-26 22:11:47,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:11:47,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-12-26 22:11:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:47,071 INFO L225 Difference]: With dead ends: 3292 [2019-12-26 22:11:47,071 INFO L226 Difference]: Without dead ends: 3292 [2019-12-26 22:11:47,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-12-26 22:11:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2679. [2019-12-26 22:11:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2679 states. [2019-12-26 22:11:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 6999 transitions. [2019-12-26 22:11:47,103 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 6999 transitions. Word has length 73 [2019-12-26 22:11:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:47,103 INFO L462 AbstractCegarLoop]: Abstraction has 2679 states and 6999 transitions. [2019-12-26 22:11:47,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 6999 transitions. [2019-12-26 22:11:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:47,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:47,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] [2019-12-26 22:11:47,107 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -524687625, now seen corresponding path program 3 times [2019-12-26 22:11:47,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:47,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321986835] [2019-12-26 22:11:47,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:47,238 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-26 22:11:47,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321986835] [2019-12-26 22:11:47,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:47,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:47,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140202732] [2019-12-26 22:11:47,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:47,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:47,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:47,241 INFO L87 Difference]: Start difference. First operand 2679 states and 6999 transitions. Second operand 7 states. [2019-12-26 22:11:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:47,856 INFO L93 Difference]: Finished difference Result 3814 states and 9900 transitions. [2019-12-26 22:11:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:11:47,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-26 22:11:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:47,861 INFO L225 Difference]: With dead ends: 3814 [2019-12-26 22:11:47,861 INFO L226 Difference]: Without dead ends: 3814 [2019-12-26 22:11:47,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:11:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2019-12-26 22:11:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 2685. [2019-12-26 22:11:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2685 states. [2019-12-26 22:11:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 7014 transitions. [2019-12-26 22:11:47,893 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 7014 transitions. Word has length 73 [2019-12-26 22:11:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:47,893 INFO L462 AbstractCegarLoop]: Abstraction has 2685 states and 7014 transitions. [2019-12-26 22:11:47,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 7014 transitions. [2019-12-26 22:11:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:47,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:47,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] [2019-12-26 22:11:47,897 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1787574207, now seen corresponding path program 4 times [2019-12-26 22:11:47,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:47,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987680666] [2019-12-26 22:11:47,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:48,000 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-26 22:11:48,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987680666] [2019-12-26 22:11:48,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:48,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:11:48,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114569083] [2019-12-26 22:11:48,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:11:48,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:11:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:11:48,004 INFO L87 Difference]: Start difference. First operand 2685 states and 7014 transitions. Second operand 7 states. [2019-12-26 22:11:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:48,486 INFO L93 Difference]: Finished difference Result 3770 states and 9762 transitions. [2019-12-26 22:11:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:11:48,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-26 22:11:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:48,492 INFO L225 Difference]: With dead ends: 3770 [2019-12-26 22:11:48,492 INFO L226 Difference]: Without dead ends: 3770 [2019-12-26 22:11:48,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:11:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3770 states. [2019-12-26 22:11:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3770 to 2687. [2019-12-26 22:11:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2687 states. [2019-12-26 22:11:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 7019 transitions. [2019-12-26 22:11:48,550 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 7019 transitions. Word has length 73 [2019-12-26 22:11:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:48,550 INFO L462 AbstractCegarLoop]: Abstraction has 2687 states and 7019 transitions. [2019-12-26 22:11:48,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:11:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 7019 transitions. [2019-12-26 22:11:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:48,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:48,556 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] [2019-12-26 22:11:48,556 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2092386417, now seen corresponding path program 5 times [2019-12-26 22:11:48,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:48,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057505766] [2019-12-26 22:11:48,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:48,770 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-26 22:11:48,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057505766] [2019-12-26 22:11:48,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:48,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:11:48,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099397280] [2019-12-26 22:11:48,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:11:48,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:11:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:11:48,777 INFO L87 Difference]: Start difference. First operand 2687 states and 7019 transitions. Second operand 10 states. [2019-12-26 22:11:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:49,575 INFO L93 Difference]: Finished difference Result 5307 states and 13803 transitions. [2019-12-26 22:11:49,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:11:49,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-26 22:11:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:49,584 INFO L225 Difference]: With dead ends: 5307 [2019-12-26 22:11:49,584 INFO L226 Difference]: Without dead ends: 5307 [2019-12-26 22:11:49,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:11:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2019-12-26 22:11:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 3407. [2019-12-26 22:11:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3407 states. [2019-12-26 22:11:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 8973 transitions. [2019-12-26 22:11:49,639 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 8973 transitions. Word has length 73 [2019-12-26 22:11:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:49,639 INFO L462 AbstractCegarLoop]: Abstraction has 3407 states and 8973 transitions. [2019-12-26 22:11:49,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:11:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 8973 transitions. [2019-12-26 22:11:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:49,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:49,644 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] [2019-12-26 22:11:49,644 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 109680953, now seen corresponding path program 6 times [2019-12-26 22:11:49,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:49,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464156665] [2019-12-26 22:11:49,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:11:49,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464156665] [2019-12-26 22:11:49,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:49,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:11:49,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493465485] [2019-12-26 22:11:49,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:11:49,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:49,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:11:49,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:11:49,893 INFO L87 Difference]: Start difference. First operand 3407 states and 8973 transitions. Second operand 10 states. [2019-12-26 22:11:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:50,814 INFO L93 Difference]: Finished difference Result 6159 states and 16091 transitions. [2019-12-26 22:11:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:11:50,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-26 22:11:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:50,823 INFO L225 Difference]: With dead ends: 6159 [2019-12-26 22:11:50,824 INFO L226 Difference]: Without dead ends: 6159 [2019-12-26 22:11:50,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:11:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6159 states. [2019-12-26 22:11:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6159 to 3505. [2019-12-26 22:11:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2019-12-26 22:11:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 9274 transitions. [2019-12-26 22:11:50,875 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 9274 transitions. Word has length 73 [2019-12-26 22:11:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:50,876 INFO L462 AbstractCegarLoop]: Abstraction has 3505 states and 9274 transitions. [2019-12-26 22:11:50,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:11:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 9274 transitions. [2019-12-26 22:11:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-26 22:11:50,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:50,881 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] [2019-12-26 22:11:50,881 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1267108309, now seen corresponding path program 7 times [2019-12-26 22:11:50,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:50,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468706398] [2019-12-26 22:11:50,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:51,170 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-26 22:11:51,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468706398] [2019-12-26 22:11:51,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:51,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:11:51,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323002874] [2019-12-26 22:11:51,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:11:51,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:11:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:51,172 INFO L87 Difference]: Start difference. First operand 3505 states and 9274 transitions. Second operand 11 states. [2019-12-26 22:11:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:52,269 INFO L93 Difference]: Finished difference Result 6184 states and 16155 transitions. [2019-12-26 22:11:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:11:52,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-12-26 22:11:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:52,278 INFO L225 Difference]: With dead ends: 6184 [2019-12-26 22:11:52,278 INFO L226 Difference]: Without dead ends: 6184 [2019-12-26 22:11:52,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:11:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6184 states. [2019-12-26 22:11:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6184 to 3057. [2019-12-26 22:11:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3057 states. [2019-12-26 22:11:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 8078 transitions. [2019-12-26 22:11:52,327 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 8078 transitions. Word has length 73 [2019-12-26 22:11:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,328 INFO L462 AbstractCegarLoop]: Abstraction has 3057 states and 8078 transitions. [2019-12-26 22:11:52,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:11:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 8078 transitions. [2019-12-26 22:11:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:11:52,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,332 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] [2019-12-26 22:11:52,332 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash 95378273, now seen corresponding path program 1 times [2019-12-26 22:11:52,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721973952] [2019-12-26 22:11:52,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:52,445 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-26 22:11:52,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721973952] [2019-12-26 22:11:52,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:52,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:11:52,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155171] [2019-12-26 22:11:52,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:11:52,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:52,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:11:52,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:11:52,447 INFO L87 Difference]: Start difference. First operand 3057 states and 8078 transitions. Second operand 6 states. [2019-12-26 22:11:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:52,576 INFO L93 Difference]: Finished difference Result 4872 states and 12102 transitions. [2019-12-26 22:11:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:11:52,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-26 22:11:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:52,580 INFO L225 Difference]: With dead ends: 4872 [2019-12-26 22:11:52,580 INFO L226 Difference]: Without dead ends: 2042 [2019-12-26 22:11:52,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:11:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2019-12-26 22:11:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1738. [2019-12-26 22:11:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-12-26 22:11:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 3863 transitions. [2019-12-26 22:11:52,602 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 3863 transitions. Word has length 74 [2019-12-26 22:11:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,602 INFO L462 AbstractCegarLoop]: Abstraction has 1738 states and 3863 transitions. [2019-12-26 22:11:52,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:11:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 3863 transitions. [2019-12-26 22:11:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:11:52,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,606 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] [2019-12-26 22:11:52,606 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1817677093, now seen corresponding path program 2 times [2019-12-26 22:11:52,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575661386] [2019-12-26 22:11:52,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:52,746 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-26 22:11:52,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575661386] [2019-12-26 22:11:52,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:52,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:11:52,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124731939] [2019-12-26 22:11:52,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:11:52,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:11:52,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:11:52,749 INFO L87 Difference]: Start difference. First operand 1738 states and 3863 transitions. Second operand 4 states. [2019-12-26 22:11:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:52,780 INFO L93 Difference]: Finished difference Result 1931 states and 4205 transitions. [2019-12-26 22:11:52,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:11:52,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-26 22:11:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:52,781 INFO L225 Difference]: With dead ends: 1931 [2019-12-26 22:11:52,781 INFO L226 Difference]: Without dead ends: 271 [2019-12-26 22:11:52,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 22:11:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-26 22:11:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-12-26 22:11:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-26 22:11:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 458 transitions. [2019-12-26 22:11:52,785 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 458 transitions. Word has length 74 [2019-12-26 22:11:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:52,786 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 458 transitions. [2019-12-26 22:11:52,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:11:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 458 transitions. [2019-12-26 22:11:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:11:52,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:52,787 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] [2019-12-26 22:11:52,787 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -398575509, now seen corresponding path program 3 times [2019-12-26 22:11:52,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:52,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412386228] [2019-12-26 22:11:52,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:11:53,212 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-26 22:11:53,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412386228] [2019-12-26 22:11:53,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:11:53,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:11:53,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172254902] [2019-12-26 22:11:53,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:11:53,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:11:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:11:53,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:11:53,216 INFO L87 Difference]: Start difference. First operand 271 states and 458 transitions. Second operand 11 states. [2019-12-26 22:11:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:11:53,580 INFO L93 Difference]: Finished difference Result 419 states and 701 transitions. [2019-12-26 22:11:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:11:53,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-26 22:11:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:11:53,581 INFO L225 Difference]: With dead ends: 419 [2019-12-26 22:11:53,581 INFO L226 Difference]: Without dead ends: 389 [2019-12-26 22:11:53,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:11:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-26 22:11:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2019-12-26 22:11:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-26 22:11:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 643 transitions. [2019-12-26 22:11:53,587 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 643 transitions. Word has length 74 [2019-12-26 22:11:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:11:53,588 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 643 transitions. [2019-12-26 22:11:53,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:11:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 643 transitions. [2019-12-26 22:11:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-26 22:11:53,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:11:53,589 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] [2019-12-26 22:11:53,589 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:11:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:11:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2034928915, now seen corresponding path program 4 times [2019-12-26 22:11:53,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:11:53,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441934295] [2019-12-26 22:11:53,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:11:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:11:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:11:53,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:11:53,741 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:11:53,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~y$r_buff1_thd1~0_137 0) (= v_~y$flush_delayed~0_201 0) (= v_~y$r_buff1_thd0~0_323 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff0_thd2~0_124) (= v_~y$w_buff1_used~0_443 0) (= 0 v_~y$r_buff1_thd3~0_282) (= 0 v_~y$r_buff0_thd3~0_461) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t763~0.base_27|) (= 0 v_~y$w_buff0~0_180) (= v_~main$tmp_guard1~0_34 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$r_buff1_thd2~0_202) (= v_~y$r_buff0_thd0~0_357 0) (= v_~y$r_buff0_thd1~0_62 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t763~0.base_27| 1)) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y~0_276 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t763~0.base_27| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t763~0.base_27|) 0) (= v_~z~0_23 0) (= v_~weak$$choice2~0_236 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t763~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t763~0.base_27|) |v_ULTIMATE.start_main_~#t763~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_5| 0) (= v_~y$mem_tmp~0_174 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_86) (= 0 v_~__unbuffered_p2_EAX~0_30) (= v_~x~0_36 0) (= v_~y$w_buff0_used~0_864 0) (= |v_ULTIMATE.start_main_~#t763~0.offset_21| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t763~0.base=|v_ULTIMATE.start_main_~#t763~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_27|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_65|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_25|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_52|, ~y$mem_tmp~0=v_~y$mem_tmp~0_174, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, ULTIMATE.start_main_~#t764~0.offset=|v_ULTIMATE.start_main_~#t764~0.offset_16|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_201, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_53|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ULTIMATE.start_main_~#t764~0.base=|v_ULTIMATE.start_main_~#t764~0.base_19|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_~#t765~0.base=|v_ULTIMATE.start_main_~#t765~0.base_18|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_122|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_29|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_323, ~x~0=v_~x~0_36, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_864, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_65|, ULTIMATE.start_main_~#t765~0.offset=|v_ULTIMATE.start_main_~#t765~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_53|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_55|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_75|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_38|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_137, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_46|, ~y$w_buff0~0=v_~y$w_buff0~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_461, ~y~0=v_~y~0_276, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_25|, ULTIMATE.start_main_~#t763~0.offset=|v_ULTIMATE.start_main_~#t763~0.offset_21|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_36|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_39|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_58|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_84|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_202, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_35|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_43|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t763~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t764~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t764~0.base, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_~#t765~0.base, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t765~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t763~0.offset, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:11:53,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L818-1-->L820: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t764~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t764~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t764~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t764~0.base_11|) |v_ULTIMATE.start_main_~#t764~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t764~0.base_11|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t764~0.base_11| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t764~0.base_11|)) (= |v_ULTIMATE.start_main_~#t764~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t764~0.offset=|v_ULTIMATE.start_main_~#t764~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t764~0.base=|v_ULTIMATE.start_main_~#t764~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t764~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t764~0.base, #length] because there is no mapped edge [2019-12-26 22:11:53,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t765~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t765~0.base_12|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t765~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t765~0.base_12|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t765~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t765~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t765~0.base_12|) |v_ULTIMATE.start_main_~#t765~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t765~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t765~0.offset=|v_ULTIMATE.start_main_~#t765~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t765~0.base=|v_ULTIMATE.start_main_~#t765~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t765~0.offset, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t765~0.base] because there is no mapped edge [2019-12-26 22:11:53,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= 1 v_~y$r_buff0_thd3~0_204) (= v_~weak$$choice2~0_87 v_~y$flush_delayed~0_53) (= |v_P2Thread1of1ForFork1_#t~nondet10_46| v_~weak$$choice2~0_87) (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_57) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= |v_P2Thread1of1ForFork1_#t~nondet9_46| v_~weak$$choice0~0_41) (= v_~y$r_buff0_thd3~0_205 v_~y$r_buff1_thd3~0_107) (= v_~y~0_105 v_~y$mem_tmp~0_43) (= v_~y$r_buff0_thd0~0_153 v_~y$r_buff1_thd0~0_106) (= v_~y$r_buff0_thd1~0_24 v_~y$r_buff1_thd1~0_24)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_46|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_46|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_105, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_45|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_45|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_57, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_107, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_204, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~y~0=v_~y~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:11:53,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-736449978 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-736449978 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-736449978| |P2Thread1of1ForFork1_#t~ite12_Out-736449978|))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork1_#t~ite11_Out-736449978| ~y$w_buff1~0_In-736449978)) (and (= ~y$w_buff0~0_In-736449978 |P2Thread1of1ForFork1_#t~ite11_Out-736449978|) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-736449978, ~y$w_buff1~0=~y$w_buff1~0_In-736449978, ~y$w_buff0~0=~y$w_buff0~0_In-736449978, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-736449978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-736449978, ~y$w_buff1~0=~y$w_buff1~0_In-736449978, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-736449978|, ~y$w_buff0~0=~y$w_buff0~0_In-736449978, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-736449978, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-736449978|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:11:53,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_81 256) 0)) (= v_~y$r_buff0_thd3~0_181 v_~y$r_buff0_thd3~0_180)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_13|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_12|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:11:53,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In378252523 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite31_Out378252523| ~y$mem_tmp~0_In378252523)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite31_Out378252523| ~y~0_In378252523)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In378252523, ~y$flush_delayed~0=~y$flush_delayed~0_In378252523, ~y~0=~y~0_In378252523} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In378252523, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out378252523|, ~y$flush_delayed~0=~y$flush_delayed~0_In378252523, ~y~0=~y~0_In378252523} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 22:11:53,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_19 1) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~z~0=v_~z~0_19, ~x~0=v_~x~0_21, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 22:11:53,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1528708453 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1528708453 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out1528708453| ~y$w_buff0_used~0_In1528708453) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1528708453|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1528708453, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1528708453} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1528708453, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1528708453|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1528708453} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 22:11:53,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1522220290 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1522220290 256))) (.cse1 (= |P1Thread1of1ForFork0_#t~ite3_Out1522220290| |P1Thread1of1ForFork0_#t~ite4_Out1522220290|))) (or (and (not .cse0) (= ~y$w_buff1~0_In1522220290 |P1Thread1of1ForFork0_#t~ite3_Out1522220290|) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out1522220290| ~y~0_In1522220290) (or .cse0 .cse2) .cse1))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522220290, ~y$w_buff1~0=~y$w_buff1~0_In1522220290, ~y~0=~y~0_In1522220290, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522220290} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1522220290, ~y$w_buff1~0=~y$w_buff1~0_In1522220290, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1522220290|, ~y~0=~y~0_In1522220290, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1522220290|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1522220290} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:11:53,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1586651489 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1586651489 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1586651489|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1586651489 |P1Thread1of1ForFork0_#t~ite5_Out-1586651489|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586651489, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1586651489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1586651489, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1586651489, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1586651489|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:11:53,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-161983088 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-161983088 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-161983088 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-161983088 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out-161983088|)) (and (= ~y$w_buff1_used~0_In-161983088 |P1Thread1of1ForFork0_#t~ite6_Out-161983088|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-161983088, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-161983088, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-161983088, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-161983088} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-161983088, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-161983088, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-161983088, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-161983088|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-161983088} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:11:53,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-111242426 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-111242426 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-111242426| ~y$r_buff0_thd2~0_In-111242426)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-111242426| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-111242426, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-111242426} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-111242426, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-111242426, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-111242426|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:11:53,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1430544565 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1430544565 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1430544565 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1430544565 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1430544565 |P1Thread1of1ForFork0_#t~ite8_Out1430544565|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite8_Out1430544565|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1430544565, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1430544565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1430544565, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1430544565} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1430544565, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1430544565, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1430544565, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out1430544565|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1430544565} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:11:53,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_75 |v_P1Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_75, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_27|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 22:11:53,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-444201078 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-444201078 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-444201078 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-444201078 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-444201078|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-444201078 |P2Thread1of1ForFork1_#t~ite35_Out-444201078|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-444201078, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-444201078, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-444201078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-444201078} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-444201078|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-444201078, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-444201078, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-444201078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-444201078} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 22:11:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1549594696 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1549594696 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1549594696 ~y$r_buff0_thd3~0_Out-1549594696)) (and (= 0 ~y$r_buff0_thd3~0_Out-1549594696) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1549594696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1549594696} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1549594696|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1549594696, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1549594696} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:11:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In2096685410 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In2096685410 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2096685410 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In2096685410 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out2096685410| ~y$r_buff1_thd3~0_In2096685410) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out2096685410| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2096685410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2096685410, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2096685410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096685410} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2096685410, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out2096685410|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2096685410, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2096685410, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096685410} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 22:11:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_34| v_~y$r_buff1_thd3~0_143) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 22:11:53,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:11:53,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1891162051 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1891162051 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1891162051 |ULTIMATE.start_main_#t~ite41_Out-1891162051|)) (and (or .cse0 .cse1) (= ~y~0_In-1891162051 |ULTIMATE.start_main_#t~ite41_Out-1891162051|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1891162051, ~y~0=~y~0_In-1891162051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1891162051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1891162051} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1891162051|, ~y$w_buff1~0=~y$w_buff1~0_In-1891162051, ~y~0=~y~0_In-1891162051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1891162051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1891162051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 22:11:53,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_57 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:11:53,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-823390271 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-823390271 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-823390271| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-823390271| ~y$w_buff0_used~0_In-823390271) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-823390271, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-823390271} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-823390271, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-823390271, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-823390271|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 22:11:53,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-526144897 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-526144897 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-526144897 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-526144897 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-526144897| ~y$w_buff1_used~0_In-526144897)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-526144897|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-526144897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-526144897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-526144897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-526144897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-526144897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-526144897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-526144897, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-526144897|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-526144897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:11:53,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1443793935 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1443793935 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1443793935| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1443793935| ~y$r_buff0_thd0~0_In1443793935)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1443793935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1443793935} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1443793935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1443793935, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1443793935|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:11:53,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1561792127 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1561792127 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1561792127 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1561792127 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1561792127| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1561792127| ~y$r_buff1_thd0~0_In-1561792127) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561792127, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1561792127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1561792127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1561792127} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1561792127, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1561792127, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1561792127|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1561792127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1561792127} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 22:11:53,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-931793191 256) 0))) (or (and .cse0 (= ~y~0_In-931793191 |ULTIMATE.start_main_#t~ite69_Out-931793191|)) (and (= ~y$mem_tmp~0_In-931793191 |ULTIMATE.start_main_#t~ite69_Out-931793191|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-931793191, ~y$flush_delayed~0=~y$flush_delayed~0_In-931793191, ~y~0=~y~0_In-931793191} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-931793191, ~y$flush_delayed~0=~y$flush_delayed~0_In-931793191, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-931793191|, ~y~0=~y~0_In-931793191} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-26 22:11:53,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_265 |v_ULTIMATE.start_main_#t~ite69_41|) (= v_~y$flush_delayed~0_194 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_40|, ~y~0=v_~y~0_265, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:11:53,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:11:53 BasicIcfg [2019-12-26 22:11:53,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:11:53,934 INFO L168 Benchmark]: Toolchain (without parser) took 50781.92 ms. Allocated memory was 138.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 101.0 MB in the beginning and 1.0 GB in the end (delta: -948.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,934 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.66 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.11 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 151.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,936 INFO L168 Benchmark]: Boogie Preprocessor took 44.16 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,936 INFO L168 Benchmark]: RCFGBuilder took 978.02 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 149.1 MB in the beginning and 207.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,937 INFO L168 Benchmark]: TraceAbstraction took 48882.85 ms. Allocated memory was 236.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 207.1 MB in the beginning and 1.0 GB in the end (delta: -842.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-26 22:11:53,939 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.66 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.11 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 151.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.16 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 978.02 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 149.1 MB in the beginning and 207.1 MB in the end (delta: -57.9 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48882.85 ms. Allocated memory was 236.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 207.1 MB in the beginning and 1.0 GB in the end (delta: -842.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 205 ProgramPointsBefore, 120 ProgramPointsAfterwards, 257 TransitionsBefore, 143 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 56 ConcurrentYvCompositions, 33 ChoiceCompositions, 9380 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 65 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 165402 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 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) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 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 [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 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 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.5s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5737 SDtfs, 6234 SDslu, 16147 SDs, 0 SdLazy, 10499 SolverSat, 539 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 134 SyntacticMatches, 53 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87886occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 27348 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 363811 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...