/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:52:22,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:52:22,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:52:23,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:52:23,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:52:23,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:52:23,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:52:23,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:52:23,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:52:23,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:52:23,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:52:23,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:52:23,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:52:23,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:52:23,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:52:23,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:52:23,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:52:23,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:52:23,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:52:23,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:52:23,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:52:23,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:52:23,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:52:23,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:52:23,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:52:23,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:52:23,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:52:23,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:52:23,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:52:23,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:52:23,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:52:23,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:52:23,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:52:23,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:52:23,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:52:23,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:52:23,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:52:23,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:52:23,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:52:23,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:52:23,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:52:23,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:52:23,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:52:23,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:52:23,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:52:23,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:52:23,068 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:52:23,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:52:23,068 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:52:23,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:52:23,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:52:23,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:52:23,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:52:23,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:52:23,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:52:23,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:52:23,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:52:23,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:52:23,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:52:23,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:52:23,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:52:23,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:52:23,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:52:23,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:52:23,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:52:23,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:52:23,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:52:23,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:52:23,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:52:23,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:52:23,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:52:23,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:52:23,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:52:23,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:52:23,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:52:23,352 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:52:23,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-27 01:52:23,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7817b322/7f41298dc0ae487badd9e6295d441ef0/FLAG9fb3c07b7 [2019-12-27 01:52:23,976 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:52:23,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-27 01:52:24,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7817b322/7f41298dc0ae487badd9e6295d441ef0/FLAG9fb3c07b7 [2019-12-27 01:52:24,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7817b322/7f41298dc0ae487badd9e6295d441ef0 [2019-12-27 01:52:24,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:52:24,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:52:24,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:52:24,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:52:24,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:52:24,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:52:24" (1/1) ... [2019-12-27 01:52:24,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a83c622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:24, skipping insertion in model container [2019-12-27 01:52:24,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:52:24" (1/1) ... [2019-12-27 01:52:24,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:52:24,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:52:24,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:52:24,935 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:52:24,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:52:25,085 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:52:25,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25 WrapperNode [2019-12-27 01:52:25,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:52:25,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:52:25,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:52:25,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:52:25,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:52:25,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:52:25,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:52:25,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:52:25,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (1/1) ... [2019-12-27 01:52:25,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:52:25,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:52:25,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:52:25,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:52:25,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (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-27 01:52:25,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:52:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:52:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:52:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:52:25,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:52:25,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:52:25,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:52:25,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:52:25,263 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:52:25,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:52:25,263 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 01:52:25,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 01:52:25,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:52:25,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:52:25,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:52:25,266 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:52:25,976 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:52:25,977 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:52:25,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:52:25 BoogieIcfgContainer [2019-12-27 01:52:25,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:52:25,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:52:25,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:52:25,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:52:25,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:52:24" (1/3) ... [2019-12-27 01:52:25,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d516483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:52:25, skipping insertion in model container [2019-12-27 01:52:25,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:52:25" (2/3) ... [2019-12-27 01:52:25,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d516483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:52:25, skipping insertion in model container [2019-12-27 01:52:25,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:52:25" (3/3) ... [2019-12-27 01:52:25,987 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_rmo.opt.i [2019-12-27 01:52:25,998 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:52:25,998 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:52:26,006 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:52:26,007 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:52:26,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,053 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,053 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,096 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,097 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,097 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,097 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,098 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,104 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,104 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,104 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,105 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,106 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,107 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,108 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,109 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,113 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,114 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,114 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,115 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,115 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,125 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,129 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,129 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,130 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,131 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:52:26,146 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 01:52:26,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:52:26,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:52:26,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:52:26,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:52:26,166 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:52:26,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:52:26,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:52:26,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:52:26,183 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 01:52:26,185 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 01:52:26,286 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 01:52:26,287 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:52:26,303 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 01:52:26,330 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 01:52:26,385 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 01:52:26,386 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:52:26,402 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 01:52:26,427 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 01:52:26,428 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:52:31,390 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-27 01:52:32,237 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 01:52:32,385 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 01:52:32,558 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-27 01:52:32,559 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 01:52:32,562 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-27 01:53:05,998 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-27 01:53:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-27 01:53:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 01:53:06,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:06,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:06,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:53:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-27 01:53:06,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:06,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101909205] [2019-12-27 01:53:06,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:06,314 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-27 01:53:06,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101909205] [2019-12-27 01:53:06,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:06,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:53:06,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007013537] [2019-12-27 01:53:06,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:53:06,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:06,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:53:06,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:53:06,339 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-27 01:53:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:11,316 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-27 01:53:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:53:11,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 01:53:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:12,392 INFO L225 Difference]: With dead ends: 158998 [2019-12-27 01:53:12,392 INFO L226 Difference]: Without dead ends: 149254 [2019-12-27 01:53:12,396 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-27 01:53:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-27 01:53:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-27 01:53:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-27 01:53:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-27 01:53:27,443 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-27 01:53:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:27,444 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-27 01:53:27,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:53:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-27 01:53:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 01:53:27,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:27,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:27,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:53:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-27 01:53:27,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:27,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679685237] [2019-12-27 01:53:27,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:27,528 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-27 01:53:27,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679685237] [2019-12-27 01:53:27,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:27,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:53:27,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294950179] [2019-12-27 01:53:27,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:53:27,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:27,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:53:27,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:53:27,533 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-27 01:53:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:33,648 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-27 01:53:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:53:33,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 01:53:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:34,036 INFO L225 Difference]: With dead ends: 94546 [2019-12-27 01:53:34,036 INFO L226 Difference]: Without dead ends: 94546 [2019-12-27 01:53:34,037 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-27 01:53:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-27 01:53:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-27 01:53:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-27 01:53:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-27 01:53:39,290 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-27 01:53:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:39,290 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-27 01:53:39,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:53:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-27 01:53:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 01:53:39,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:39,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:39,294 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:53:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-27 01:53:39,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:39,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743194879] [2019-12-27 01:53:39,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:39,372 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-27 01:53:39,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743194879] [2019-12-27 01:53:39,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:39,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:53:39,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959706125] [2019-12-27 01:53:39,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:53:39,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:53:39,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:53:39,378 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-27 01:53:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:40,378 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-27 01:53:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:53:40,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 01:53:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:42,152 INFO L225 Difference]: With dead ends: 144639 [2019-12-27 01:53:42,152 INFO L226 Difference]: Without dead ends: 144527 [2019-12-27 01:53:42,153 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-27 01:53:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-27 01:53:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-27 01:53:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-27 01:53:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-27 01:53:56,689 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-27 01:53:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:56,689 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-27 01:53:56,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:53:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-27 01:53:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:53:56,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:56,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:56,694 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:53:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-27 01:53:56,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:56,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508075421] [2019-12-27 01:53:56,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:56,780 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-27 01:53:56,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508075421] [2019-12-27 01:53:56,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:56,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:53:56,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044527734] [2019-12-27 01:53:56,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:53:56,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:53:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:53:56,782 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-27 01:53:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:56,979 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-27 01:53:56,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:53:56,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:53:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:57,055 INFO L225 Difference]: With dead ends: 37161 [2019-12-27 01:53:57,055 INFO L226 Difference]: Without dead ends: 37161 [2019-12-27 01:53:57,055 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-27 01:53:57,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-27 01:53:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-27 01:53:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-27 01:53:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-27 01:53:58,350 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-27 01:53:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:53:58,351 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-27 01:53:58,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:53:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-27 01:53:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:53:58,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:53:58,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:53:58,355 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:53:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:53:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-27 01:53:58,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:53:58,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486531865] [2019-12-27 01:53:58,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:53:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:53:58,436 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-27 01:53:58,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486531865] [2019-12-27 01:53:58,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:53:58,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:53:58,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302134345] [2019-12-27 01:53:58,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:53:58,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:53:58,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:53:58,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:53:58,438 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-27 01:53:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:53:59,016 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-27 01:53:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:53:59,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:53:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:53:59,124 INFO L225 Difference]: With dead ends: 54896 [2019-12-27 01:53:59,124 INFO L226 Difference]: Without dead ends: 54878 [2019-12-27 01:53:59,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:53:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-27 01:54:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-27 01:54:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-27 01:54:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-27 01:54:02,619 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-27 01:54:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:02,619 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-27 01:54:02,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:54:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-27 01:54:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 01:54:02,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:02,637 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] [2019-12-27 01:54:02,637 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-27 01:54:02,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:02,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923962394] [2019-12-27 01:54:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:02,743 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-27 01:54:02,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923962394] [2019-12-27 01:54:02,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:02,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:54:02,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444454698] [2019-12-27 01:54:02,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:54:02,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:54:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:54:02,746 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-27 01:54:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:03,812 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-27 01:54:03,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:54:03,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 01:54:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:03,944 INFO L225 Difference]: With dead ends: 65283 [2019-12-27 01:54:03,944 INFO L226 Difference]: Without dead ends: 65253 [2019-12-27 01:54:03,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:54:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-27 01:54:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-27 01:54:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-27 01:54:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-27 01:54:05,270 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-27 01:54:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:05,271 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-27 01:54:05,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:54:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-27 01:54:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:54:05,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:05,294 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] [2019-12-27 01:54:05,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-27 01:54:05,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:05,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182443935] [2019-12-27 01:54:05,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:05,374 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-27 01:54:05,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182443935] [2019-12-27 01:54:05,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:05,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:54:05,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620233825] [2019-12-27 01:54:05,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:54:05,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:05,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:54:05,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:54:05,378 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-27 01:54:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:05,494 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-27 01:54:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:54:05,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:54:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:05,539 INFO L225 Difference]: With dead ends: 23301 [2019-12-27 01:54:05,539 INFO L226 Difference]: Without dead ends: 23301 [2019-12-27 01:54:05,540 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-27 01:54:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-27 01:54:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-27 01:54:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-27 01:54:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-27 01:54:05,947 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-27 01:54:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:05,948 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-27 01:54:05,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:54:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-27 01:54:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 01:54:05,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:05,988 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] [2019-12-27 01:54:05,988 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-27 01:54:05,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:05,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334394190] [2019-12-27 01:54:05,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:06,090 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-27 01:54:06,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334394190] [2019-12-27 01:54:06,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:06,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:54:06,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29052886] [2019-12-27 01:54:06,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:06,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:06,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:06,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:06,093 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-27 01:54:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:06,270 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-27 01:54:06,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:06,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-27 01:54:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:06,313 INFO L225 Difference]: With dead ends: 34696 [2019-12-27 01:54:06,313 INFO L226 Difference]: Without dead ends: 23444 [2019-12-27 01:54:06,314 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-27 01:54:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-27 01:54:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-27 01:54:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-27 01:54:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-27 01:54:07,033 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-27 01:54:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:07,033 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-27 01:54:07,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-27 01:54:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 01:54:07,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:07,068 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] [2019-12-27 01:54:07,069 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-27 01:54:07,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:07,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28329921] [2019-12-27 01:54:07,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:07,166 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-27 01:54:07,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28329921] [2019-12-27 01:54:07,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:07,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:54:07,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679691780] [2019-12-27 01:54:07,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:54:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:54:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:54:07,172 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-27 01:54:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:07,338 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-27 01:54:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:54:07,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 01:54:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:07,366 INFO L225 Difference]: With dead ends: 21758 [2019-12-27 01:54:07,366 INFO L226 Difference]: Without dead ends: 11194 [2019-12-27 01:54:07,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:54:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-27 01:54:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-27 01:54:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-27 01:54:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-27 01:54:07,637 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-27 01:54:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:07,638 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-27 01:54:07,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:54:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-27 01:54:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:07,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:07,658 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] [2019-12-27 01:54:07,658 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-27 01:54:07,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:07,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563052713] [2019-12-27 01:54:07,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:07,742 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-27 01:54:07,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563052713] [2019-12-27 01:54:07,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:07,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:54:07,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175369220] [2019-12-27 01:54:07,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:07,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:07,744 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-27 01:54:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:07,838 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-27 01:54:07,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:07,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 01:54:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:07,866 INFO L225 Difference]: With dead ends: 14554 [2019-12-27 01:54:07,867 INFO L226 Difference]: Without dead ends: 14554 [2019-12-27 01:54:07,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-27 01:54:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-27 01:54:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-27 01:54:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-27 01:54:08,066 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-27 01:54:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:08,067 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-27 01:54:08,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-27 01:54:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:08,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:08,079 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] [2019-12-27 01:54:08,079 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:08,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:08,079 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-27 01:54:08,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:08,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789721345] [2019-12-27 01:54:08,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:08,146 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-27 01:54:08,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789721345] [2019-12-27 01:54:08,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:08,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:54:08,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262675689] [2019-12-27 01:54:08,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:54:08,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:54:08,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:54:08,149 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-27 01:54:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:08,231 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-27 01:54:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:54:08,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 01:54:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:08,246 INFO L225 Difference]: With dead ends: 21477 [2019-12-27 01:54:08,246 INFO L226 Difference]: Without dead ends: 9937 [2019-12-27 01:54:08,246 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-27 01:54:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-27 01:54:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-27 01:54:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-27 01:54:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-27 01:54:08,395 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-27 01:54:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:08,395 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-27 01:54:08,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:54:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-27 01:54:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:08,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:08,407 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] [2019-12-27 01:54:08,407 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-27 01:54:08,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:08,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410702671] [2019-12-27 01:54:08,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:08,505 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-27 01:54:08,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410702671] [2019-12-27 01:54:08,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:08,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:54:08,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105624984] [2019-12-27 01:54:08,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:54:08,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:08,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:54:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:54:08,508 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-27 01:54:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:08,956 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-27 01:54:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:54:08,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 01:54:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:08,996 INFO L225 Difference]: With dead ends: 26843 [2019-12-27 01:54:08,996 INFO L226 Difference]: Without dead ends: 20587 [2019-12-27 01:54:08,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:54:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-27 01:54:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-27 01:54:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-27 01:54:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-27 01:54:09,288 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-27 01:54:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:09,289 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-27 01:54:09,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:54:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-27 01:54:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:09,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:09,310 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] [2019-12-27 01:54:09,310 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-27 01:54:09,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:09,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658800576] [2019-12-27 01:54:09,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:09,396 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-27 01:54:09,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658800576] [2019-12-27 01:54:09,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:09,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:54:09,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560498327] [2019-12-27 01:54:09,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:54:09,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:09,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:54:09,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:54:09,399 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-27 01:54:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:09,862 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-27 01:54:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:54:09,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 01:54:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:09,911 INFO L225 Difference]: With dead ends: 33666 [2019-12-27 01:54:09,911 INFO L226 Difference]: Without dead ends: 24086 [2019-12-27 01:54:09,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:54:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-27 01:54:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-27 01:54:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-27 01:54:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-27 01:54:10,228 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-27 01:54:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:10,229 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-27 01:54:10,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:54:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-27 01:54:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:10,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:10,250 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] [2019-12-27 01:54:10,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-27 01:54:10,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:10,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947956821] [2019-12-27 01:54:10,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:10,342 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-27 01:54:10,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947956821] [2019-12-27 01:54:10,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:10,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:54:10,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455797259] [2019-12-27 01:54:10,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:54:10,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:54:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:54:10,345 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-27 01:54:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:11,296 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-27 01:54:11,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:54:11,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 01:54:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:11,343 INFO L225 Difference]: With dead ends: 34932 [2019-12-27 01:54:11,343 INFO L226 Difference]: Without dead ends: 32668 [2019-12-27 01:54:11,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:54:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-27 01:54:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-27 01:54:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-27 01:54:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-27 01:54:11,816 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-27 01:54:11,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:11,817 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-27 01:54:11,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:54:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-27 01:54:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:11,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:11,835 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] [2019-12-27 01:54:11,835 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-27 01:54:11,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:11,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042290107] [2019-12-27 01:54:11,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:11,961 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-27 01:54:11,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042290107] [2019-12-27 01:54:11,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:11,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:11,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017188431] [2019-12-27 01:54:11,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:54:11,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:54:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:54:11,963 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-27 01:54:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:13,410 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-27 01:54:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:54:13,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 01:54:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:13,477 INFO L225 Difference]: With dead ends: 48430 [2019-12-27 01:54:13,478 INFO L226 Difference]: Without dead ends: 46166 [2019-12-27 01:54:13,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:54:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-27 01:54:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-27 01:54:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-27 01:54:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-27 01:54:13,959 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-27 01:54:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:13,959 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-27 01:54:13,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:54:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-27 01:54:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:13,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:13,977 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] [2019-12-27 01:54:13,977 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:13,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:13,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-27 01:54:13,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:13,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772272565] [2019-12-27 01:54:13,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:14,261 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-27 01:54:14,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772272565] [2019-12-27 01:54:14,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:14,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:14,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042873007] [2019-12-27 01:54:14,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:54:14,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:14,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:54:14,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:54:14,263 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-27 01:54:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:15,828 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-27 01:54:15,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 01:54:15,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 01:54:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:15,917 INFO L225 Difference]: With dead ends: 62597 [2019-12-27 01:54:15,917 INFO L226 Difference]: Without dead ends: 54167 [2019-12-27 01:54:15,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 01:54:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-27 01:54:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-27 01:54:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-27 01:54:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-27 01:54:16,559 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-27 01:54:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:16,560 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-27 01:54:16,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:54:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-27 01:54:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 01:54:16,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:16,581 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] [2019-12-27 01:54:16,581 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:16,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-27 01:54:16,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:16,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049373298] [2019-12-27 01:54:16,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:16,678 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-27 01:54:16,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049373298] [2019-12-27 01:54:16,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:16,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:54:16,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471792094] [2019-12-27 01:54:16,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:16,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:16,680 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-27 01:54:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:16,755 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-27 01:54:16,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:16,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 01:54:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:16,788 INFO L225 Difference]: With dead ends: 16496 [2019-12-27 01:54:16,788 INFO L226 Difference]: Without dead ends: 16496 [2019-12-27 01:54:16,789 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-27 01:54:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-27 01:54:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-27 01:54:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-27 01:54:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-27 01:54:17,337 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-27 01:54:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-27 01:54:17,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-27 01:54:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:17,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:17,363 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] [2019-12-27 01:54:17,363 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-27 01:54:17,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:17,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023647977] [2019-12-27 01:54:17,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:17,611 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-27 01:54:17,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023647977] [2019-12-27 01:54:17,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:54:17,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019139728] [2019-12-27 01:54:17,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:54:17,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:54:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:54:17,612 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 11 states. [2019-12-27 01:54:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:20,353 INFO L93 Difference]: Finished difference Result 33289 states and 102035 transitions. [2019-12-27 01:54:20,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:54:20,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 01:54:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:20,389 INFO L225 Difference]: With dead ends: 33289 [2019-12-27 01:54:20,389 INFO L226 Difference]: Without dead ends: 23951 [2019-12-27 01:54:20,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:54:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2019-12-27 01:54:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 16786. [2019-12-27 01:54:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16786 states. [2019-12-27 01:54:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16786 states to 16786 states and 51436 transitions. [2019-12-27 01:54:20,707 INFO L78 Accepts]: Start accepts. Automaton has 16786 states and 51436 transitions. Word has length 58 [2019-12-27 01:54:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:20,707 INFO L462 AbstractCegarLoop]: Abstraction has 16786 states and 51436 transitions. [2019-12-27 01:54:20,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:54:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16786 states and 51436 transitions. [2019-12-27 01:54:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:20,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:20,725 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] [2019-12-27 01:54:20,725 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash 540759914, now seen corresponding path program 2 times [2019-12-27 01:54:20,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:20,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862175036] [2019-12-27 01:54:20,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:20,845 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-27 01:54:20,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862175036] [2019-12-27 01:54:20,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:20,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:20,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528452137] [2019-12-27 01:54:20,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:54:20,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:20,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:54:20,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:54:20,847 INFO L87 Difference]: Start difference. First operand 16786 states and 51436 transitions. Second operand 8 states. [2019-12-27 01:54:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:22,663 INFO L93 Difference]: Finished difference Result 29302 states and 86887 transitions. [2019-12-27 01:54:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:54:22,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 01:54:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:22,705 INFO L225 Difference]: With dead ends: 29302 [2019-12-27 01:54:22,705 INFO L226 Difference]: Without dead ends: 29080 [2019-12-27 01:54:22,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:54:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29080 states. [2019-12-27 01:54:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29080 to 20735. [2019-12-27 01:54:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-27 01:54:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 63126 transitions. [2019-12-27 01:54:23,102 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 63126 transitions. Word has length 58 [2019-12-27 01:54:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:23,102 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 63126 transitions. [2019-12-27 01:54:23,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:54:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 63126 transitions. [2019-12-27 01:54:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:23,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:23,124 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] [2019-12-27 01:54:23,124 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash 755166698, now seen corresponding path program 3 times [2019-12-27 01:54:23,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:23,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672444880] [2019-12-27 01:54:23,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:23,319 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-27 01:54:23,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672444880] [2019-12-27 01:54:23,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:23,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:54:23,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614411150] [2019-12-27 01:54:23,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:54:23,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:54:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:54:23,321 INFO L87 Difference]: Start difference. First operand 20735 states and 63126 transitions. Second operand 11 states. [2019-12-27 01:54:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:25,136 INFO L93 Difference]: Finished difference Result 32233 states and 97204 transitions. [2019-12-27 01:54:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:54:25,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 01:54:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:25,179 INFO L225 Difference]: With dead ends: 32233 [2019-12-27 01:54:25,180 INFO L226 Difference]: Without dead ends: 27963 [2019-12-27 01:54:25,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:54:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27963 states. [2019-12-27 01:54:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27963 to 20789. [2019-12-27 01:54:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20789 states. [2019-12-27 01:54:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20789 states to 20789 states and 63080 transitions. [2019-12-27 01:54:25,557 INFO L78 Accepts]: Start accepts. Automaton has 20789 states and 63080 transitions. Word has length 58 [2019-12-27 01:54:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:25,557 INFO L462 AbstractCegarLoop]: Abstraction has 20789 states and 63080 transitions. [2019-12-27 01:54:25,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:54:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20789 states and 63080 transitions. [2019-12-27 01:54:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:25,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:25,750 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] [2019-12-27 01:54:25,750 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:25,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 4 times [2019-12-27 01:54:25,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:25,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185440289] [2019-12-27 01:54:25,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:25,943 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-27 01:54:25,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185440289] [2019-12-27 01:54:25,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:25,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:54:25,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380962226] [2019-12-27 01:54:25,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:54:25,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:54:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:54:25,946 INFO L87 Difference]: Start difference. First operand 20789 states and 63080 transitions. Second operand 11 states. [2019-12-27 01:54:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:27,606 INFO L93 Difference]: Finished difference Result 29331 states and 88457 transitions. [2019-12-27 01:54:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:54:27,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 01:54:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:27,648 INFO L225 Difference]: With dead ends: 29331 [2019-12-27 01:54:27,648 INFO L226 Difference]: Without dead ends: 27843 [2019-12-27 01:54:27,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:54:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27843 states. [2019-12-27 01:54:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27843 to 20901. [2019-12-27 01:54:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2019-12-27 01:54:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 63326 transitions. [2019-12-27 01:54:28,016 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 63326 transitions. Word has length 58 [2019-12-27 01:54:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:28,016 INFO L462 AbstractCegarLoop]: Abstraction has 20901 states and 63326 transitions. [2019-12-27 01:54:28,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:54:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 63326 transitions. [2019-12-27 01:54:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:28,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:28,037 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] [2019-12-27 01:54:28,037 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 797101106, now seen corresponding path program 5 times [2019-12-27 01:54:28,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:28,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832577800] [2019-12-27 01:54:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:28,181 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-27 01:54:28,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832577800] [2019-12-27 01:54:28,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:28,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:54:28,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738785547] [2019-12-27 01:54:28,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:54:28,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:28,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:54:28,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:54:28,184 INFO L87 Difference]: Start difference. First operand 20901 states and 63326 transitions. Second operand 11 states. [2019-12-27 01:54:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:29,670 INFO L93 Difference]: Finished difference Result 28487 states and 85982 transitions. [2019-12-27 01:54:29,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:54:29,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 01:54:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:29,712 INFO L225 Difference]: With dead ends: 28487 [2019-12-27 01:54:29,712 INFO L226 Difference]: Without dead ends: 27866 [2019-12-27 01:54:29,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:54:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27866 states. [2019-12-27 01:54:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27866 to 20865. [2019-12-27 01:54:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20865 states. [2019-12-27 01:54:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20865 states to 20865 states and 63238 transitions. [2019-12-27 01:54:30,217 INFO L78 Accepts]: Start accepts. Automaton has 20865 states and 63238 transitions. Word has length 58 [2019-12-27 01:54:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:30,217 INFO L462 AbstractCegarLoop]: Abstraction has 20865 states and 63238 transitions. [2019-12-27 01:54:30,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:54:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20865 states and 63238 transitions. [2019-12-27 01:54:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:30,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:30,239 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] [2019-12-27 01:54:30,239 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:30,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash -199714182, now seen corresponding path program 6 times [2019-12-27 01:54:30,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:30,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163323470] [2019-12-27 01:54:30,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:30,404 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-27 01:54:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163323470] [2019-12-27 01:54:30,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:30,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:54:30,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875778938] [2019-12-27 01:54:30,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:54:30,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:54:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:54:30,406 INFO L87 Difference]: Start difference. First operand 20865 states and 63238 transitions. Second operand 12 states. [2019-12-27 01:54:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:32,304 INFO L93 Difference]: Finished difference Result 30585 states and 91967 transitions. [2019-12-27 01:54:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:54:32,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-27 01:54:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:32,347 INFO L225 Difference]: With dead ends: 30585 [2019-12-27 01:54:32,347 INFO L226 Difference]: Without dead ends: 29521 [2019-12-27 01:54:32,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:54:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29521 states. [2019-12-27 01:54:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29521 to 20677. [2019-12-27 01:54:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-12-27 01:54:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 62762 transitions. [2019-12-27 01:54:32,737 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 62762 transitions. Word has length 58 [2019-12-27 01:54:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:32,738 INFO L462 AbstractCegarLoop]: Abstraction has 20677 states and 62762 transitions. [2019-12-27 01:54:32,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:54:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 62762 transitions. [2019-12-27 01:54:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:32,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:32,761 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] [2019-12-27 01:54:32,761 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2078538356, now seen corresponding path program 7 times [2019-12-27 01:54:32,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:32,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273192197] [2019-12-27 01:54:32,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:33,010 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-27 01:54:33,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273192197] [2019-12-27 01:54:33,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:33,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:54:33,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238414096] [2019-12-27 01:54:33,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:54:33,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:54:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:54:33,014 INFO L87 Difference]: Start difference. First operand 20677 states and 62762 transitions. Second operand 11 states. [2019-12-27 01:54:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:34,292 INFO L93 Difference]: Finished difference Result 39994 states and 120533 transitions. [2019-12-27 01:54:34,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 01:54:34,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 01:54:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:34,338 INFO L225 Difference]: With dead ends: 39994 [2019-12-27 01:54:34,338 INFO L226 Difference]: Without dead ends: 32678 [2019-12-27 01:54:34,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:54:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32678 states. [2019-12-27 01:54:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32678 to 20121. [2019-12-27 01:54:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20121 states. [2019-12-27 01:54:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20121 states to 20121 states and 61090 transitions. [2019-12-27 01:54:34,727 INFO L78 Accepts]: Start accepts. Automaton has 20121 states and 61090 transitions. Word has length 58 [2019-12-27 01:54:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:34,727 INFO L462 AbstractCegarLoop]: Abstraction has 20121 states and 61090 transitions. [2019-12-27 01:54:34,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:54:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20121 states and 61090 transitions. [2019-12-27 01:54:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:34,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:34,751 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] [2019-12-27 01:54:34,751 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1619424878, now seen corresponding path program 8 times [2019-12-27 01:54:34,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:34,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847309491] [2019-12-27 01:54:34,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:34,916 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-27 01:54:34,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847309491] [2019-12-27 01:54:34,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:34,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:54:34,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178818862] [2019-12-27 01:54:34,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:54:34,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:34,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:54:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:54:34,918 INFO L87 Difference]: Start difference. First operand 20121 states and 61090 transitions. Second operand 10 states. [2019-12-27 01:54:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:36,262 INFO L93 Difference]: Finished difference Result 26848 states and 80941 transitions. [2019-12-27 01:54:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:54:36,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 01:54:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:36,301 INFO L225 Difference]: With dead ends: 26848 [2019-12-27 01:54:36,301 INFO L226 Difference]: Without dead ends: 25946 [2019-12-27 01:54:36,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:54:36,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25946 states. [2019-12-27 01:54:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25946 to 19771. [2019-12-27 01:54:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19771 states. [2019-12-27 01:54:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19771 states to 19771 states and 60100 transitions. [2019-12-27 01:54:36,662 INFO L78 Accepts]: Start accepts. Automaton has 19771 states and 60100 transitions. Word has length 58 [2019-12-27 01:54:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:36,662 INFO L462 AbstractCegarLoop]: Abstraction has 19771 states and 60100 transitions. [2019-12-27 01:54:36,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:54:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19771 states and 60100 transitions. [2019-12-27 01:54:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 01:54:36,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:36,686 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] [2019-12-27 01:54:36,686 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:36,687 INFO L82 PathProgramCache]: Analyzing trace with hash 883191828, now seen corresponding path program 9 times [2019-12-27 01:54:36,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:36,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553729688] [2019-12-27 01:54:36,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:36,750 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-27 01:54:36,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553729688] [2019-12-27 01:54:36,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:36,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:54:36,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881593382] [2019-12-27 01:54:36,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:54:36,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:54:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:54:36,752 INFO L87 Difference]: Start difference. First operand 19771 states and 60100 transitions. Second operand 3 states. [2019-12-27 01:54:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:36,847 INFO L93 Difference]: Finished difference Result 19771 states and 60098 transitions. [2019-12-27 01:54:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:54:36,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 01:54:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:36,884 INFO L225 Difference]: With dead ends: 19771 [2019-12-27 01:54:36,884 INFO L226 Difference]: Without dead ends: 19771 [2019-12-27 01:54:36,885 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-27 01:54:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19771 states. [2019-12-27 01:54:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19771 to 16878. [2019-12-27 01:54:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16878 states. [2019-12-27 01:54:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16878 states to 16878 states and 52145 transitions. [2019-12-27 01:54:37,561 INFO L78 Accepts]: Start accepts. Automaton has 16878 states and 52145 transitions. Word has length 58 [2019-12-27 01:54:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:37,562 INFO L462 AbstractCegarLoop]: Abstraction has 16878 states and 52145 transitions. [2019-12-27 01:54:37,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:54:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16878 states and 52145 transitions. [2019-12-27 01:54:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:54:37,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:37,597 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] [2019-12-27 01:54:37,598 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 1 times [2019-12-27 01:54:37,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:37,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347872224] [2019-12-27 01:54:37,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:38,145 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-27 01:54:38,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347872224] [2019-12-27 01:54:38,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:38,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:54:38,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98111774] [2019-12-27 01:54:38,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:54:38,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:54:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:54:38,147 INFO L87 Difference]: Start difference. First operand 16878 states and 52145 transitions. Second operand 18 states. [2019-12-27 01:54:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:41,049 INFO L93 Difference]: Finished difference Result 18780 states and 57259 transitions. [2019-12-27 01:54:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:54:41,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-27 01:54:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:41,077 INFO L225 Difference]: With dead ends: 18780 [2019-12-27 01:54:41,078 INFO L226 Difference]: Without dead ends: 18696 [2019-12-27 01:54:41,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 01:54:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18696 states. [2019-12-27 01:54:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18696 to 16978. [2019-12-27 01:54:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16978 states. [2019-12-27 01:54:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16978 states to 16978 states and 52359 transitions. [2019-12-27 01:54:41,344 INFO L78 Accepts]: Start accepts. Automaton has 16978 states and 52359 transitions. Word has length 59 [2019-12-27 01:54:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:41,345 INFO L462 AbstractCegarLoop]: Abstraction has 16978 states and 52359 transitions. [2019-12-27 01:54:41,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:54:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16978 states and 52359 transitions. [2019-12-27 01:54:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:54:41,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:41,363 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] [2019-12-27 01:54:41,363 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1026660081, now seen corresponding path program 2 times [2019-12-27 01:54:41,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:41,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871045142] [2019-12-27 01:54:41,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:54:41,544 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-27 01:54:41,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871045142] [2019-12-27 01:54:41,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:54:41,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:54:41,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175560891] [2019-12-27 01:54:41,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:54:41,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:54:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:54:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:54:41,546 INFO L87 Difference]: Start difference. First operand 16978 states and 52359 transitions. Second operand 12 states. [2019-12-27 01:54:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:54:43,618 INFO L93 Difference]: Finished difference Result 23526 states and 72103 transitions. [2019-12-27 01:54:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:54:43,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-27 01:54:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:54:43,651 INFO L225 Difference]: With dead ends: 23526 [2019-12-27 01:54:43,651 INFO L226 Difference]: Without dead ends: 23098 [2019-12-27 01:54:43,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:54:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23098 states. [2019-12-27 01:54:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23098 to 16678. [2019-12-27 01:54:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16678 states. [2019-12-27 01:54:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51651 transitions. [2019-12-27 01:54:43,934 INFO L78 Accepts]: Start accepts. Automaton has 16678 states and 51651 transitions. Word has length 59 [2019-12-27 01:54:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:54:43,934 INFO L462 AbstractCegarLoop]: Abstraction has 16678 states and 51651 transitions. [2019-12-27 01:54:43,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:54:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16678 states and 51651 transitions. [2019-12-27 01:54:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 01:54:43,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:54:43,951 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] [2019-12-27 01:54:43,951 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:54:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:54:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 3 times [2019-12-27 01:54:43,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:54:43,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238814978] [2019-12-27 01:54:43,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:54:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:54:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:54:44,048 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:54:44,049 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:54:44,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= (select .cse0 |v_ULTIMATE.start_main_~#t621~0.base_29|) 0) (= v_~__unbuffered_cnt~0_187 0) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t621~0.base_29| 4)) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t621~0.base_29|) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_29|) |v_ULTIMATE.start_main_~#t621~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~__unbuffered_p1_EAX~0_47) (= (store .cse0 |v_ULTIMATE.start_main_~#t621~0.base_29| 1) |v_#valid_72|) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= 0 |v_ULTIMATE.start_main_~#t621~0.offset_21|) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_21|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_29|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_~#t621~0.base=|v_ULTIMATE.start_main_~#t621~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ULTIMATE.start_main_~#t621~0.offset=|v_ULTIMATE.start_main_~#t621~0.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_17|, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_21|, ~z~0=v_~z~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t622~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t622~0.base, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t623~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~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_~#t621~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t621~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t624~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t624~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t623~0.offset, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:54:44,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t622~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t622~0.base_12| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t622~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12|) |v_ULTIMATE.start_main_~#t622~0.offset_10| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t622~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t622~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t622~0.base] because there is no mapped edge [2019-12-27 01:54:44,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t623~0.base_13| 4) |v_#length_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t623~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t623~0.offset_11|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13|) |v_ULTIMATE.start_main_~#t623~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t623~0.base_13|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t623~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t623~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:54:44,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:54:44,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t624~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t624~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t624~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t624~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10|) |v_ULTIMATE.start_main_~#t624~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t624~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t624~0.base, #length] because there is no mapped edge [2019-12-27 01:54:44,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:54:44,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1925349412 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In1925349412 256)))) (or (and (= ~y~0_In1925349412 |P3Thread1of1ForFork0_#t~ite32_Out1925349412|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In1925349412 |P3Thread1of1ForFork0_#t~ite32_Out1925349412|) (not .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1925349412, ~y$w_buff1~0=~y$w_buff1~0_In1925349412, ~y~0=~y~0_In1925349412, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1925349412} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1925349412, ~y$w_buff1~0=~y$w_buff1~0_In1925349412, ~y~0=~y~0_In1925349412, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1925349412|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1925349412} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 01:54:44,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 01:54:44,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In386479117 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In386479117 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out386479117| ~y$w_buff0_used~0_In386479117) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out386479117| 0) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In386479117, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386479117} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In386479117, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386479117, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out386479117|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 01:54:44,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In688836182 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In688836182 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out688836182|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In688836182 |P2Thread1of1ForFork3_#t~ite28_Out688836182|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In688836182, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In688836182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In688836182, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In688836182, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out688836182|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 01:54:44,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1264563688 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1264563688 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1264563688 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1264563688 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1264563688|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-1264563688| ~y$w_buff1_used~0_In-1264563688)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1264563688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1264563688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1264563688, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1264563688} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1264563688, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1264563688, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1264563688, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1264563688|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1264563688} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 01:54:44,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In433212828 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In433212828 256)))) (or (and (= ~y$r_buff0_thd3~0_In433212828 ~y$r_buff0_thd3~0_Out433212828) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out433212828 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In433212828, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In433212828} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out433212828|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In433212828, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out433212828} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 01:54:44,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-1503056342 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1503056342 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1503056342 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1503056342 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-1503056342|)) (and (= ~y$r_buff1_thd3~0_In-1503056342 |P2Thread1of1ForFork3_#t~ite31_Out-1503056342|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1503056342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503056342, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1503056342, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503056342} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1503056342, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1503056342, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1503056342, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1503056342|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1503056342} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 01:54:44,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 01:54:44,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd4~0_In1658226844 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1658226844 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1658226844 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1658226844 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out1658226844| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out1658226844| ~y$w_buff1_used~0_In1658226844)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1658226844, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1658226844, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658226844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658226844} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1658226844, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1658226844, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1658226844, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1658226844|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1658226844} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 01:54:44,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1927249824 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1927249824 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1927249824|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-1927249824 |P3Thread1of1ForFork0_#t~ite36_Out-1927249824|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1927249824, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1927249824} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1927249824, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1927249824, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1927249824|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 01:54:44,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In153847169 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In153847169 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In153847169 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In153847169 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out153847169|)) (and (= ~y$r_buff1_thd4~0_In153847169 |P3Thread1of1ForFork0_#t~ite37_Out153847169|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In153847169, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In153847169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153847169, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153847169} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In153847169, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In153847169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153847169, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out153847169|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153847169} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 01:54:44,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:54:44,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1013880800 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1013880800 256)))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-1013880800 256) 0)) (= (mod ~y$w_buff0_used~0_In-1013880800 256) 0) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1013880800 256) 0)))) .cse1 (= ~y$w_buff0~0_In-1013880800 |P1Thread1of1ForFork2_#t~ite8_Out-1013880800|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1013880800| |P1Thread1of1ForFork2_#t~ite8_Out-1013880800|)) (and (not .cse1) (= ~y$w_buff0~0_In-1013880800 |P1Thread1of1ForFork2_#t~ite9_Out-1013880800|) (= |P1Thread1of1ForFork2_#t~ite8_In-1013880800| |P1Thread1of1ForFork2_#t~ite8_Out-1013880800|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1013880800, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1013880800, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1013880800|, ~y$w_buff0~0=~y$w_buff0~0_In-1013880800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1013880800, ~weak$$choice2~0=~weak$$choice2~0_In-1013880800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1013880800} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1013880800, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1013880800|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1013880800, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1013880800|, ~y$w_buff0~0=~y$w_buff0~0_In-1013880800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1013880800, ~weak$$choice2~0=~weak$$choice2~0_In-1013880800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1013880800} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 01:54:44,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1864284740 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In1864284740 |P1Thread1of1ForFork2_#t~ite14_Out1864284740|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1864284740 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1864284740 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1864284740 256)) (and (= (mod ~y$w_buff1_used~0_In1864284740 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out1864284740| |P1Thread1of1ForFork2_#t~ite15_Out1864284740|)) (and (= ~y$w_buff0_used~0_In1864284740 |P1Thread1of1ForFork2_#t~ite15_Out1864284740|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In1864284740| |P1Thread1of1ForFork2_#t~ite14_Out1864284740|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1864284740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1864284740, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1864284740, ~weak$$choice2~0=~weak$$choice2~0_In1864284740, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1864284740|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1864284740} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1864284740, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1864284740, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1864284740, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1864284740|, ~weak$$choice2~0=~weak$$choice2~0_In1864284740, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1864284740|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1864284740} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 01:54:44,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 01:54:44,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1916604737 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-1916604737| |P1Thread1of1ForFork2_#t~ite23_Out-1916604737|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1916604737| ~y$r_buff1_thd2~0_In-1916604737)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1916604737 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1916604737 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1916604737 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-1916604737 256) 0) .cse1))) (= ~y$r_buff1_thd2~0_In-1916604737 |P1Thread1of1ForFork2_#t~ite23_Out-1916604737|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1916604737| |P1Thread1of1ForFork2_#t~ite23_Out-1916604737|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1916604737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916604737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1916604737, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1916604737|, ~weak$$choice2~0=~weak$$choice2~0_In-1916604737, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916604737} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1916604737, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916604737, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1916604737, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1916604737|, ~weak$$choice2~0=~weak$$choice2~0_In-1916604737, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1916604737|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1916604737} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 01:54:44,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 01:54:44,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:54:44,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite43_Out-542128265| |ULTIMATE.start_main_#t~ite42_Out-542128265|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-542128265 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-542128265 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-542128265 |ULTIMATE.start_main_#t~ite42_Out-542128265|)) (and .cse2 (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-542128265 |ULTIMATE.start_main_#t~ite42_Out-542128265|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-542128265, ~y~0=~y~0_In-542128265, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-542128265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-542128265} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-542128265, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-542128265|, ~y~0=~y~0_In-542128265, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-542128265|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-542128265, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-542128265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:54:44,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In417863231 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In417863231 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out417863231| ~y$w_buff0_used~0_In417863231)) (and (= |ULTIMATE.start_main_#t~ite44_Out417863231| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In417863231, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In417863231} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In417863231, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In417863231, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out417863231|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:54:44,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-438002647 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-438002647 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-438002647 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-438002647 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-438002647| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-438002647 |ULTIMATE.start_main_#t~ite45_Out-438002647|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-438002647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438002647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-438002647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438002647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-438002647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-438002647, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-438002647, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-438002647|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438002647} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:54:44,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1615183852 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1615183852 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1615183852 |ULTIMATE.start_main_#t~ite46_Out-1615183852|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1615183852|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1615183852, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1615183852} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1615183852, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1615183852, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1615183852|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 01:54:44,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In953900473 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In953900473 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In953900473 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In953900473 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out953900473|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In953900473 |ULTIMATE.start_main_#t~ite47_Out953900473|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In953900473, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In953900473, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In953900473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953900473} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In953900473, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In953900473, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out953900473|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In953900473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953900473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:54:44,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:54:44,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:54:44 BasicIcfg [2019-12-27 01:54:44,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:54:44,196 INFO L168 Benchmark]: Toolchain (without parser) took 139913.40 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 100.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,196 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.75 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,198 INFO L168 Benchmark]: Boogie Preprocessor took 38.60 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,198 INFO L168 Benchmark]: RCFGBuilder took 792.15 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 100.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,199 INFO L168 Benchmark]: TraceAbstraction took 138214.32 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 01:54:44,202 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.75 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.60 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.15 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 100.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 138214.32 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). 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.3s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t621, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t622, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t623, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] FCALL, FORK 0 pthread_create(&t624, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 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) [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 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 [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 137.8s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6572 SDtfs, 9386 SDslu, 26555 SDs, 0 SdLazy, 19805 SolverSat, 504 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 50 SyntacticMatches, 13 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 223847 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1361 NumberOfCodeBlocks, 1361 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1274 ConstructedInterpolants, 0 QuantifiedInterpolants, 283783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...