/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:14:52,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:14:52,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:14:52,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:14:52,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:14:52,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:14:52,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:14:52,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:14:52,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:14:52,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:14:52,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:14:52,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:14:52,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:14:52,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:14:52,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:14:52,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:14:52,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:14:52,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:14:52,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:14:52,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:14:52,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:14:52,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:14:52,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:14:52,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:14:52,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:14:52,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:14:52,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:14:52,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:14:52,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:14:52,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:14:52,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:14:52,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:14:52,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:14:52,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:14:52,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:14:52,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:14:52,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:14:52,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:14:52,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:14:52,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:14:52,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:14:52,254 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:14:52,277 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:14:52,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:14:52,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:14:52,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:14:52,280 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:14:52,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:14:52,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:14:52,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:14:52,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:14:52,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:14:52,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:14:52,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:14:52,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:14:52,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:14:52,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:14:52,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:14:52,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:14:52,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:14:52,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:14:52,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:14:52,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:14:52,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:14:52,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:14:52,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:14:52,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:14:52,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:14:52,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:14:52,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:14:52,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:14:52,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:14:52,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:14:52,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:14:52,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:14:52,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:14:52,550 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:14:52,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2019-12-26 23:14:52,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f59936ae/45615f7311ce4148bd2048eca43d6964/FLAGc0867a4df [2019-12-26 23:14:53,150 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:14:53,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2019-12-26 23:14:53,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f59936ae/45615f7311ce4148bd2048eca43d6964/FLAGc0867a4df [2019-12-26 23:14:53,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f59936ae/45615f7311ce4148bd2048eca43d6964 [2019-12-26 23:14:53,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:14:53,369 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:14:53,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:14:53,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:14:53,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:14:53,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:14:53" (1/1) ... [2019-12-26 23:14:53,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a4cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:53, skipping insertion in model container [2019-12-26 23:14:53,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:14:53" (1/1) ... [2019-12-26 23:14:53,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:14:53,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:14:54,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:14:54,017 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:14:54,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:14:54,196 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:14:54,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54 WrapperNode [2019-12-26 23:14:54,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:14:54,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:14:54,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:14:54,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:14:54,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:14:54,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:14:54,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:14:54,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:14:54,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... [2019-12-26 23:14:54,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:14:54,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:14:54,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:14:54,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:14:54,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:14:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:14:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:14:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:14:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:14:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:14:54,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:14:54,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:14:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:14:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:14:54,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:14:54,439 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:14:55,685 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:14:55,686 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:14:55,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:14:55 BoogieIcfgContainer [2019-12-26 23:14:55,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:14:55,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:14:55,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:14:55,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:14:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:14:53" (1/3) ... [2019-12-26 23:14:55,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5222cfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:14:55, skipping insertion in model container [2019-12-26 23:14:55,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:14:54" (2/3) ... [2019-12-26 23:14:55,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5222cfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:14:55, skipping insertion in model container [2019-12-26 23:14:55,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:14:55" (3/3) ... [2019-12-26 23:14:55,699 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.oepc.i [2019-12-26 23:14:55,710 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:14:55,711 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:14:55,723 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:14:55,724 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:14:55,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,802 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,803 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,821 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,899 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,914 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:14:55,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:14:55,953 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:14:55,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:14:55,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:14:55,953 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:14:55,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:14:55,954 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:14:55,954 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:14:55,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:14:55,976 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-26 23:14:55,978 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:14:56,148 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:14:56,149 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:14:56,182 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:14:56,248 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:14:56,389 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:14:56,389 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:14:56,408 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:14:56,446 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-26 23:14:56,447 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:15:03,512 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:15:03,762 INFO L206 etLargeBlockEncoding]: Checked pairs total: 282427 [2019-12-26 23:15:03,762 INFO L214 etLargeBlockEncoding]: Total number of compositions: 142 [2019-12-26 23:15:03,767 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 192 transitions [2019-12-26 23:15:13,019 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86906 states. [2019-12-26 23:15:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 86906 states. [2019-12-26 23:15:13,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:15:13,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:13,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:15:13,029 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240646, now seen corresponding path program 1 times [2019-12-26 23:15:13,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:13,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699406806] [2019-12-26 23:15:13,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:13,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699406806] [2019-12-26 23:15:13,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:13,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:15:13,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446068219] [2019-12-26 23:15:13,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:13,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:13,344 INFO L87 Difference]: Start difference. First operand 86906 states. Second operand 3 states. [2019-12-26 23:15:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:14,316 INFO L93 Difference]: Finished difference Result 86858 states and 312643 transitions. [2019-12-26 23:15:14,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:14,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:15:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:14,843 INFO L225 Difference]: With dead ends: 86858 [2019-12-26 23:15:14,843 INFO L226 Difference]: Without dead ends: 85058 [2019-12-26 23:15:14,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85058 states. [2019-12-26 23:15:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85058 to 85058. [2019-12-26 23:15:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85058 states. [2019-12-26 23:15:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85058 states to 85058 states and 306544 transitions. [2019-12-26 23:15:22,179 INFO L78 Accepts]: Start accepts. Automaton has 85058 states and 306544 transitions. Word has length 5 [2019-12-26 23:15:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:22,180 INFO L462 AbstractCegarLoop]: Abstraction has 85058 states and 306544 transitions. [2019-12-26 23:15:22,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 85058 states and 306544 transitions. [2019-12-26 23:15:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:15:22,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:22,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:22,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2045261550, now seen corresponding path program 1 times [2019-12-26 23:15:22,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:22,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78716976] [2019-12-26 23:15:22,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:22,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78716976] [2019-12-26 23:15:22,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:22,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:22,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552773792] [2019-12-26 23:15:22,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:22,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:22,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:22,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:22,310 INFO L87 Difference]: Start difference. First operand 85058 states and 306544 transitions. Second operand 4 states. [2019-12-26 23:15:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:26,231 INFO L93 Difference]: Finished difference Result 127330 states and 444666 transitions. [2019-12-26 23:15:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:15:26,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:15:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:26,794 INFO L225 Difference]: With dead ends: 127330 [2019-12-26 23:15:26,794 INFO L226 Difference]: Without dead ends: 127330 [2019-12-26 23:15:26,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127330 states. [2019-12-26 23:15:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127330 to 126190. [2019-12-26 23:15:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126190 states. [2019-12-26 23:15:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126190 states to 126190 states and 441366 transitions. [2019-12-26 23:15:35,538 INFO L78 Accepts]: Start accepts. Automaton has 126190 states and 441366 transitions. Word has length 11 [2019-12-26 23:15:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:35,538 INFO L462 AbstractCegarLoop]: Abstraction has 126190 states and 441366 transitions. [2019-12-26 23:15:35,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 126190 states and 441366 transitions. [2019-12-26 23:15:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:15:35,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:35,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:35,542 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 216920818, now seen corresponding path program 1 times [2019-12-26 23:15:35,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:35,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176410729] [2019-12-26 23:15:35,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:35,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176410729] [2019-12-26 23:15:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:35,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155895566] [2019-12-26 23:15:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:35,604 INFO L87 Difference]: Start difference. First operand 126190 states and 441366 transitions. Second operand 3 states. [2019-12-26 23:15:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:35,637 INFO L93 Difference]: Finished difference Result 7755 states and 18817 transitions. [2019-12-26 23:15:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:35,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-26 23:15:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:35,648 INFO L225 Difference]: With dead ends: 7755 [2019-12-26 23:15:35,648 INFO L226 Difference]: Without dead ends: 7755 [2019-12-26 23:15:35,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-26 23:15:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7715. [2019-12-26 23:15:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-12-26 23:15:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 18737 transitions. [2019-12-26 23:15:35,762 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 18737 transitions. Word has length 11 [2019-12-26 23:15:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:35,762 INFO L462 AbstractCegarLoop]: Abstraction has 7715 states and 18737 transitions. [2019-12-26 23:15:35,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 18737 transitions. [2019-12-26 23:15:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:15:35,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:35,766 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] [2019-12-26 23:15:35,766 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash -468341505, now seen corresponding path program 1 times [2019-12-26 23:15:35,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:35,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406138591] [2019-12-26 23:15:35,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:36,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406138591] [2019-12-26 23:15:36,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:36,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:36,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082052489] [2019-12-26 23:15:36,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:36,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:36,061 INFO L87 Difference]: Start difference. First operand 7715 states and 18737 transitions. Second operand 7 states. [2019-12-26 23:15:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:37,095 INFO L93 Difference]: Finished difference Result 9139 states and 21753 transitions. [2019-12-26 23:15:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:15:37,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-26 23:15:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:37,106 INFO L225 Difference]: With dead ends: 9139 [2019-12-26 23:15:37,106 INFO L226 Difference]: Without dead ends: 9139 [2019-12-26 23:15:37,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:15:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-12-26 23:15:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 8897. [2019-12-26 23:15:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2019-12-26 23:15:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 21286 transitions. [2019-12-26 23:15:38,043 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 21286 transitions. Word has length 22 [2019-12-26 23:15:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:38,043 INFO L462 AbstractCegarLoop]: Abstraction has 8897 states and 21286 transitions. [2019-12-26 23:15:38,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 21286 transitions. [2019-12-26 23:15:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 23:15:38,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:38,047 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] [2019-12-26 23:15:38,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:38,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1753070628, now seen corresponding path program 1 times [2019-12-26 23:15:38,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:38,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814319740] [2019-12-26 23:15:38,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:38,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814319740] [2019-12-26 23:15:38,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:38,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:15:38,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426710255] [2019-12-26 23:15:38,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:38,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:38,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:38,129 INFO L87 Difference]: Start difference. First operand 8897 states and 21286 transitions. Second operand 4 states. [2019-12-26 23:15:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:38,151 INFO L93 Difference]: Finished difference Result 3410 states and 7630 transitions. [2019-12-26 23:15:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:38,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-26 23:15:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:38,156 INFO L225 Difference]: With dead ends: 3410 [2019-12-26 23:15:38,157 INFO L226 Difference]: Without dead ends: 3410 [2019-12-26 23:15:38,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2019-12-26 23:15:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3334. [2019-12-26 23:15:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-12-26 23:15:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 7489 transitions. [2019-12-26 23:15:38,205 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 7489 transitions. Word has length 34 [2019-12-26 23:15:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:38,205 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 7489 transitions. [2019-12-26 23:15:38,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 7489 transitions. [2019-12-26 23:15:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-26 23:15:38,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:38,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:38,215 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:38,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1776556996, now seen corresponding path program 1 times [2019-12-26 23:15:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:38,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411103398] [2019-12-26 23:15:38,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:38,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411103398] [2019-12-26 23:15:38,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:38,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:38,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107480935] [2019-12-26 23:15:38,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:38,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:38,381 INFO L87 Difference]: Start difference. First operand 3334 states and 7489 transitions. Second operand 3 states. [2019-12-26 23:15:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:38,410 INFO L93 Difference]: Finished difference Result 3334 states and 7414 transitions. [2019-12-26 23:15:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:38,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-26 23:15:38,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:38,414 INFO L225 Difference]: With dead ends: 3334 [2019-12-26 23:15:38,414 INFO L226 Difference]: Without dead ends: 3334 [2019-12-26 23:15:38,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-12-26 23:15:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3334. [2019-12-26 23:15:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2019-12-26 23:15:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 7414 transitions. [2019-12-26 23:15:38,461 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 7414 transitions. Word has length 93 [2019-12-26 23:15:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:38,462 INFO L462 AbstractCegarLoop]: Abstraction has 3334 states and 7414 transitions. [2019-12-26 23:15:38,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 7414 transitions. [2019-12-26 23:15:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:38,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:38,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:38,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:38,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1261390719, now seen corresponding path program 1 times [2019-12-26 23:15:38,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:38,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916038334] [2019-12-26 23:15:38,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:38,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916038334] [2019-12-26 23:15:38,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:38,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:15:38,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938302550] [2019-12-26 23:15:38,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:38,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:38,610 INFO L87 Difference]: Start difference. First operand 3334 states and 7414 transitions. Second operand 7 states. [2019-12-26 23:15:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:39,681 INFO L93 Difference]: Finished difference Result 4159 states and 9153 transitions. [2019-12-26 23:15:39,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:15:39,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:15:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:39,687 INFO L225 Difference]: With dead ends: 4159 [2019-12-26 23:15:39,687 INFO L226 Difference]: Without dead ends: 4159 [2019-12-26 23:15:39,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:15:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2019-12-26 23:15:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 3820. [2019-12-26 23:15:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-26 23:15:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 8475 transitions. [2019-12-26 23:15:39,747 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 8475 transitions. Word has length 94 [2019-12-26 23:15:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:39,748 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 8475 transitions. [2019-12-26 23:15:39,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 8475 transitions. [2019-12-26 23:15:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:39,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:39,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:39,756 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash 870783717, now seen corresponding path program 2 times [2019-12-26 23:15:39,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:39,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411211251] [2019-12-26 23:15:39,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:39,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411211251] [2019-12-26 23:15:39,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:39,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:39,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850693649] [2019-12-26 23:15:39,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:15:39,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:15:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:39,906 INFO L87 Difference]: Start difference. First operand 3820 states and 8475 transitions. Second operand 5 states. [2019-12-26 23:15:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:40,345 INFO L93 Difference]: Finished difference Result 5841 states and 12982 transitions. [2019-12-26 23:15:40,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:15:40,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-26 23:15:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:40,353 INFO L225 Difference]: With dead ends: 5841 [2019-12-26 23:15:40,353 INFO L226 Difference]: Without dead ends: 5841 [2019-12-26 23:15:40,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5841 states. [2019-12-26 23:15:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5841 to 4941. [2019-12-26 23:15:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4941 states. [2019-12-26 23:15:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4941 states to 4941 states and 10922 transitions. [2019-12-26 23:15:40,408 INFO L78 Accepts]: Start accepts. Automaton has 4941 states and 10922 transitions. Word has length 94 [2019-12-26 23:15:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:40,408 INFO L462 AbstractCegarLoop]: Abstraction has 4941 states and 10922 transitions. [2019-12-26 23:15:40,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:15:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4941 states and 10922 transitions. [2019-12-26 23:15:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:40,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:40,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:40,417 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash -543927459, now seen corresponding path program 3 times [2019-12-26 23:15:40,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:40,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127270289] [2019-12-26 23:15:40,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:40,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127270289] [2019-12-26 23:15:40,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:40,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:15:40,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137890152] [2019-12-26 23:15:40,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:40,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:40,521 INFO L87 Difference]: Start difference. First operand 4941 states and 10922 transitions. Second operand 4 states. [2019-12-26 23:15:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:40,789 INFO L93 Difference]: Finished difference Result 8759 states and 19366 transitions. [2019-12-26 23:15:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:40,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-26 23:15:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:40,799 INFO L225 Difference]: With dead ends: 8759 [2019-12-26 23:15:40,800 INFO L226 Difference]: Without dead ends: 8759 [2019-12-26 23:15:40,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2019-12-26 23:15:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 6821. [2019-12-26 23:15:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2019-12-26 23:15:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 15210 transitions. [2019-12-26 23:15:40,877 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 15210 transitions. Word has length 94 [2019-12-26 23:15:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:40,878 INFO L462 AbstractCegarLoop]: Abstraction has 6821 states and 15210 transitions. [2019-12-26 23:15:40,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 15210 transitions. [2019-12-26 23:15:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:40,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:40,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:40,887 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:40,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1290837885, now seen corresponding path program 4 times [2019-12-26 23:15:40,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:40,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018314542] [2019-12-26 23:15:40,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:41,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018314542] [2019-12-26 23:15:41,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:41,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:15:41,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23362324] [2019-12-26 23:15:41,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:41,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:41,032 INFO L87 Difference]: Start difference. First operand 6821 states and 15210 transitions. Second operand 6 states. [2019-12-26 23:15:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:41,909 INFO L93 Difference]: Finished difference Result 7454 states and 16486 transitions. [2019-12-26 23:15:41,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:15:41,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:15:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:41,919 INFO L225 Difference]: With dead ends: 7454 [2019-12-26 23:15:41,919 INFO L226 Difference]: Without dead ends: 7454 [2019-12-26 23:15:41,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:15:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7454 states. [2019-12-26 23:15:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7454 to 7002. [2019-12-26 23:15:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7002 states. [2019-12-26 23:15:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 15587 transitions. [2019-12-26 23:15:41,991 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 15587 transitions. Word has length 94 [2019-12-26 23:15:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:41,992 INFO L462 AbstractCegarLoop]: Abstraction has 7002 states and 15587 transitions. [2019-12-26 23:15:41,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 15587 transitions. [2019-12-26 23:15:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:42,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:42,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:42,001 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2058012871, now seen corresponding path program 5 times [2019-12-26 23:15:42,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:42,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675528576] [2019-12-26 23:15:42,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:42,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675528576] [2019-12-26 23:15:42,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:42,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:42,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013620900] [2019-12-26 23:15:42,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:15:42,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:15:42,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:15:42,119 INFO L87 Difference]: Start difference. First operand 7002 states and 15587 transitions. Second operand 5 states. [2019-12-26 23:15:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:43,356 INFO L93 Difference]: Finished difference Result 7278 states and 16103 transitions. [2019-12-26 23:15:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:15:43,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-26 23:15:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:43,364 INFO L225 Difference]: With dead ends: 7278 [2019-12-26 23:15:43,365 INFO L226 Difference]: Without dead ends: 7278 [2019-12-26 23:15:43,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2019-12-26 23:15:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 7117. [2019-12-26 23:15:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7117 states. [2019-12-26 23:15:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7117 states to 7117 states and 15813 transitions. [2019-12-26 23:15:43,439 INFO L78 Accepts]: Start accepts. Automaton has 7117 states and 15813 transitions. Word has length 94 [2019-12-26 23:15:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:43,439 INFO L462 AbstractCegarLoop]: Abstraction has 7117 states and 15813 transitions. [2019-12-26 23:15:43,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:15:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7117 states and 15813 transitions. [2019-12-26 23:15:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:43,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:43,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:43,448 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash -770271505, now seen corresponding path program 6 times [2019-12-26 23:15:43,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:43,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823921102] [2019-12-26 23:15:43,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:43,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823921102] [2019-12-26 23:15:43,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:43,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:15:43,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621812285] [2019-12-26 23:15:43,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:43,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:43,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:43,566 INFO L87 Difference]: Start difference. First operand 7117 states and 15813 transitions. Second operand 7 states. [2019-12-26 23:15:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:44,488 INFO L93 Difference]: Finished difference Result 9681 states and 21311 transitions. [2019-12-26 23:15:44,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:15:44,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:15:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:44,502 INFO L225 Difference]: With dead ends: 9681 [2019-12-26 23:15:44,502 INFO L226 Difference]: Without dead ends: 9681 [2019-12-26 23:15:44,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:15:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9681 states. [2019-12-26 23:15:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9681 to 7465. [2019-12-26 23:15:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7465 states. [2019-12-26 23:15:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7465 states to 7465 states and 16636 transitions. [2019-12-26 23:15:44,590 INFO L78 Accepts]: Start accepts. Automaton has 7465 states and 16636 transitions. Word has length 94 [2019-12-26 23:15:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:44,590 INFO L462 AbstractCegarLoop]: Abstraction has 7465 states and 16636 transitions. [2019-12-26 23:15:44,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 7465 states and 16636 transitions. [2019-12-26 23:15:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:44,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:44,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:44,600 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 677033839, now seen corresponding path program 7 times [2019-12-26 23:15:44,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:44,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734867679] [2019-12-26 23:15:44,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:44,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734867679] [2019-12-26 23:15:44,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:44,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:15:44,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23003431] [2019-12-26 23:15:44,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:15:44,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:44,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:15:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:44,717 INFO L87 Difference]: Start difference. First operand 7465 states and 16636 transitions. Second operand 7 states. [2019-12-26 23:15:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:45,715 INFO L93 Difference]: Finished difference Result 9886 states and 21773 transitions. [2019-12-26 23:15:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:15:45,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:15:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:45,726 INFO L225 Difference]: With dead ends: 9886 [2019-12-26 23:15:45,726 INFO L226 Difference]: Without dead ends: 9886 [2019-12-26 23:15:45,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:15:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9886 states. [2019-12-26 23:15:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9886 to 7397. [2019-12-26 23:15:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7397 states. [2019-12-26 23:15:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7397 states to 7397 states and 16484 transitions. [2019-12-26 23:15:45,814 INFO L78 Accepts]: Start accepts. Automaton has 7397 states and 16484 transitions. Word has length 94 [2019-12-26 23:15:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:45,815 INFO L462 AbstractCegarLoop]: Abstraction has 7397 states and 16484 transitions. [2019-12-26 23:15:45,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:15:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7397 states and 16484 transitions. [2019-12-26 23:15:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:15:45,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:45,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:45,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:45,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -210008649, now seen corresponding path program 8 times [2019-12-26 23:15:45,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:45,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12306231] [2019-12-26 23:15:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:45,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12306231] [2019-12-26 23:15:45,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:45,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:15:45,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890373315] [2019-12-26 23:15:45,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:45,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:45,909 INFO L87 Difference]: Start difference. First operand 7397 states and 16484 transitions. Second operand 3 states. [2019-12-26 23:15:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:45,966 INFO L93 Difference]: Finished difference Result 7396 states and 16482 transitions. [2019-12-26 23:15:45,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:45,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-26 23:15:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:45,973 INFO L225 Difference]: With dead ends: 7396 [2019-12-26 23:15:45,974 INFO L226 Difference]: Without dead ends: 7396 [2019-12-26 23:15:45,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states. [2019-12-26 23:15:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 7015. [2019-12-26 23:15:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7015 states. [2019-12-26 23:15:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 15710 transitions. [2019-12-26 23:15:46,048 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 15710 transitions. Word has length 94 [2019-12-26 23:15:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:46,048 INFO L462 AbstractCegarLoop]: Abstraction has 7015 states and 15710 transitions. [2019-12-26 23:15:46,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 15710 transitions. [2019-12-26 23:15:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:46,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:46,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:46,058 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:46,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash 900755581, now seen corresponding path program 1 times [2019-12-26 23:15:46,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:46,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924710236] [2019-12-26 23:15:46,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:46,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924710236] [2019-12-26 23:15:46,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:46,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:15:46,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889226235] [2019-12-26 23:15:46,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:15:46,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:46,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:15:46,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:46,142 INFO L87 Difference]: Start difference. First operand 7015 states and 15710 transitions. Second operand 4 states. [2019-12-26 23:15:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:46,402 INFO L93 Difference]: Finished difference Result 9731 states and 21529 transitions. [2019-12-26 23:15:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:46,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-26 23:15:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:46,415 INFO L225 Difference]: With dead ends: 9731 [2019-12-26 23:15:46,416 INFO L226 Difference]: Without dead ends: 9731 [2019-12-26 23:15:46,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:15:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2019-12-26 23:15:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 7653. [2019-12-26 23:15:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7653 states. [2019-12-26 23:15:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7653 states to 7653 states and 17106 transitions. [2019-12-26 23:15:46,527 INFO L78 Accepts]: Start accepts. Automaton has 7653 states and 17106 transitions. Word has length 95 [2019-12-26 23:15:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:46,528 INFO L462 AbstractCegarLoop]: Abstraction has 7653 states and 17106 transitions. [2019-12-26 23:15:46,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:15:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7653 states and 17106 transitions. [2019-12-26 23:15:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:15:46,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:46,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:46,538 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1454974861, now seen corresponding path program 2 times [2019-12-26 23:15:46,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:46,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084348048] [2019-12-26 23:15:46,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:46,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084348048] [2019-12-26 23:15:46,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:46,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:46,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795850670] [2019-12-26 23:15:46,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:46,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:46,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:46,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:46,719 INFO L87 Difference]: Start difference. First operand 7653 states and 17106 transitions. Second operand 6 states. [2019-12-26 23:15:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:46,870 INFO L93 Difference]: Finished difference Result 11559 states and 25676 transitions. [2019-12-26 23:15:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:15:46,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-26 23:15:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:46,875 INFO L225 Difference]: With dead ends: 11559 [2019-12-26 23:15:46,875 INFO L226 Difference]: Without dead ends: 3966 [2019-12-26 23:15:46,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:15:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2019-12-26 23:15:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3792. [2019-12-26 23:15:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3792 states. [2019-12-26 23:15:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 8350 transitions. [2019-12-26 23:15:46,929 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 8350 transitions. Word has length 95 [2019-12-26 23:15:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:46,929 INFO L462 AbstractCegarLoop]: Abstraction has 3792 states and 8350 transitions. [2019-12-26 23:15:46,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 8350 transitions. [2019-12-26 23:15:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:15:46,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:46,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:46,934 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1693003594, now seen corresponding path program 1 times [2019-12-26 23:15:46,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:46,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030619628] [2019-12-26 23:15:46,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:47,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030619628] [2019-12-26 23:15:47,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:47,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:15:47,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284214032] [2019-12-26 23:15:47,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:15:47,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:15:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:15:47,243 INFO L87 Difference]: Start difference. First operand 3792 states and 8350 transitions. Second operand 14 states. [2019-12-26 23:15:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:47,843 INFO L93 Difference]: Finished difference Result 5498 states and 12049 transitions. [2019-12-26 23:15:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:15:47,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-26 23:15:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:47,850 INFO L225 Difference]: With dead ends: 5498 [2019-12-26 23:15:47,850 INFO L226 Difference]: Without dead ends: 5469 [2019-12-26 23:15:47,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:15:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-12-26 23:15:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 4972. [2019-12-26 23:15:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4972 states. [2019-12-26 23:15:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 11053 transitions. [2019-12-26 23:15:47,902 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 11053 transitions. Word has length 96 [2019-12-26 23:15:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:47,902 INFO L462 AbstractCegarLoop]: Abstraction has 4972 states and 11053 transitions. [2019-12-26 23:15:47,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:15:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 11053 transitions. [2019-12-26 23:15:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:15:47,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:47,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:47,907 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 46562021, now seen corresponding path program 1 times [2019-12-26 23:15:47,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:47,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214769692] [2019-12-26 23:15:47,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:48,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214769692] [2019-12-26 23:15:48,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:48,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 23:15:48,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094924842] [2019-12-26 23:15:48,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 23:15:48,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 23:15:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:15:48,395 INFO L87 Difference]: Start difference. First operand 4972 states and 11053 transitions. Second operand 22 states. [2019-12-26 23:15:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:49,898 INFO L93 Difference]: Finished difference Result 7570 states and 16648 transitions. [2019-12-26 23:15:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:15:49,898 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-12-26 23:15:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:49,910 INFO L225 Difference]: With dead ends: 7570 [2019-12-26 23:15:49,911 INFO L226 Difference]: Without dead ends: 7541 [2019-12-26 23:15:49,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 23:15:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7541 states. [2019-12-26 23:15:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7541 to 5975. [2019-12-26 23:15:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5975 states. [2019-12-26 23:15:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5975 states to 5975 states and 13287 transitions. [2019-12-26 23:15:50,020 INFO L78 Accepts]: Start accepts. Automaton has 5975 states and 13287 transitions. Word has length 96 [2019-12-26 23:15:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:50,020 INFO L462 AbstractCegarLoop]: Abstraction has 5975 states and 13287 transitions. [2019-12-26 23:15:50,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-26 23:15:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5975 states and 13287 transitions. [2019-12-26 23:15:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:15:50,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:50,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:50,028 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1127270605, now seen corresponding path program 2 times [2019-12-26 23:15:50,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:50,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908413677] [2019-12-26 23:15:50,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908413677] [2019-12-26 23:15:50,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:50,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:15:50,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287192054] [2019-12-26 23:15:50,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:15:50,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:50,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:15:50,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:15:50,498 INFO L87 Difference]: Start difference. First operand 5975 states and 13287 transitions. Second operand 19 states. [2019-12-26 23:15:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:52,147 INFO L93 Difference]: Finished difference Result 12335 states and 27273 transitions. [2019-12-26 23:15:52,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:15:52,147 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-26 23:15:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:52,162 INFO L225 Difference]: With dead ends: 12335 [2019-12-26 23:15:52,163 INFO L226 Difference]: Without dead ends: 12306 [2019-12-26 23:15:52,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 23:15:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12306 states. [2019-12-26 23:15:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12306 to 7816. [2019-12-26 23:15:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7816 states. [2019-12-26 23:15:52,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 17652 transitions. [2019-12-26 23:15:52,320 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 17652 transitions. Word has length 96 [2019-12-26 23:15:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:52,321 INFO L462 AbstractCegarLoop]: Abstraction has 7816 states and 17652 transitions. [2019-12-26 23:15:52,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:15:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 17652 transitions. [2019-12-26 23:15:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:52,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:52,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:52,328 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash 273024232, now seen corresponding path program 1 times [2019-12-26 23:15:52,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:52,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287290075] [2019-12-26 23:15:52,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:52,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287290075] [2019-12-26 23:15:52,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:52,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:15:52,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693847754] [2019-12-26 23:15:52,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:52,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:52,424 INFO L87 Difference]: Start difference. First operand 7816 states and 17652 transitions. Second operand 6 states. [2019-12-26 23:15:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:52,810 INFO L93 Difference]: Finished difference Result 8046 states and 18042 transitions. [2019-12-26 23:15:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:15:52,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:15:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:52,821 INFO L225 Difference]: With dead ends: 8046 [2019-12-26 23:15:52,821 INFO L226 Difference]: Without dead ends: 7922 [2019-12-26 23:15:52,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:15:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2019-12-26 23:15:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7579. [2019-12-26 23:15:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7579 states. [2019-12-26 23:15:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 17053 transitions. [2019-12-26 23:15:52,905 INFO L78 Accepts]: Start accepts. Automaton has 7579 states and 17053 transitions. Word has length 97 [2019-12-26 23:15:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:52,905 INFO L462 AbstractCegarLoop]: Abstraction has 7579 states and 17053 transitions. [2019-12-26 23:15:52,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 7579 states and 17053 transitions. [2019-12-26 23:15:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:52,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:52,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:52,913 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1635016551, now seen corresponding path program 1 times [2019-12-26 23:15:52,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:52,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956874437] [2019-12-26 23:15:52,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:53,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956874437] [2019-12-26 23:15:53,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:53,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:53,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351086257] [2019-12-26 23:15:53,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:53,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:53,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:53,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:53,072 INFO L87 Difference]: Start difference. First operand 7579 states and 17053 transitions. Second operand 6 states. [2019-12-26 23:15:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:53,206 INFO L93 Difference]: Finished difference Result 7571 states and 17039 transitions. [2019-12-26 23:15:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:15:53,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:15:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:53,219 INFO L225 Difference]: With dead ends: 7571 [2019-12-26 23:15:53,219 INFO L226 Difference]: Without dead ends: 6964 [2019-12-26 23:15:53,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:15:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6964 states. [2019-12-26 23:15:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6964 to 6789. [2019-12-26 23:15:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2019-12-26 23:15:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 15285 transitions. [2019-12-26 23:15:53,376 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 15285 transitions. Word has length 97 [2019-12-26 23:15:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:53,377 INFO L462 AbstractCegarLoop]: Abstraction has 6789 states and 15285 transitions. [2019-12-26 23:15:53,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 15285 transitions. [2019-12-26 23:15:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:53,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:53,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:53,387 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:53,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash -153500625, now seen corresponding path program 1 times [2019-12-26 23:15:53,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:53,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367118782] [2019-12-26 23:15:53,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:53,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367118782] [2019-12-26 23:15:53,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:53,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:15:53,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523788852] [2019-12-26 23:15:53,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:15:53,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:15:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:15:53,447 INFO L87 Difference]: Start difference. First operand 6789 states and 15285 transitions. Second operand 3 states. [2019-12-26 23:15:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:53,611 INFO L93 Difference]: Finished difference Result 5974 states and 12764 transitions. [2019-12-26 23:15:53,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:15:53,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-26 23:15:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:53,621 INFO L225 Difference]: With dead ends: 5974 [2019-12-26 23:15:53,622 INFO L226 Difference]: Without dead ends: 5946 [2019-12-26 23:15:53,622 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-26 23:15:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2019-12-26 23:15:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 4477. [2019-12-26 23:15:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4477 states. [2019-12-26 23:15:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 9824 transitions. [2019-12-26 23:15:53,721 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 9824 transitions. Word has length 97 [2019-12-26 23:15:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:53,721 INFO L462 AbstractCegarLoop]: Abstraction has 4477 states and 9824 transitions. [2019-12-26 23:15:53,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:15:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 9824 transitions. [2019-12-26 23:15:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:15:53,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:53,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:53,728 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 361616868, now seen corresponding path program 1 times [2019-12-26 23:15:53,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:53,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696266783] [2019-12-26 23:15:53,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:53,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696266783] [2019-12-26 23:15:53,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:53,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:15:53,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342245122] [2019-12-26 23:15:53,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:15:53,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:53,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:15:53,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:15:53,910 INFO L87 Difference]: Start difference. First operand 4477 states and 9824 transitions. Second operand 6 states. [2019-12-26 23:15:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:53,963 INFO L93 Difference]: Finished difference Result 3642 states and 7780 transitions. [2019-12-26 23:15:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:15:53,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:15:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:53,968 INFO L225 Difference]: With dead ends: 3642 [2019-12-26 23:15:53,968 INFO L226 Difference]: Without dead ends: 3642 [2019-12-26 23:15:53,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:15:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2019-12-26 23:15:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3600. [2019-12-26 23:15:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2019-12-26 23:15:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 7695 transitions. [2019-12-26 23:15:54,019 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 7695 transitions. Word has length 97 [2019-12-26 23:15:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:54,019 INFO L462 AbstractCegarLoop]: Abstraction has 3600 states and 7695 transitions. [2019-12-26 23:15:54,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:15:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 7695 transitions. [2019-12-26 23:15:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:54,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:54,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:54,024 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash 272691207, now seen corresponding path program 1 times [2019-12-26 23:15:54,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:54,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894153666] [2019-12-26 23:15:54,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:15:54,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894153666] [2019-12-26 23:15:54,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:54,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:15:54,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385315282] [2019-12-26 23:15:54,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:15:54,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:15:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:15:54,568 INFO L87 Difference]: Start difference. First operand 3600 states and 7695 transitions. Second operand 15 states. [2019-12-26 23:15:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:56,413 INFO L93 Difference]: Finished difference Result 7758 states and 16647 transitions. [2019-12-26 23:15:56,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:15:56,414 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-26 23:15:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:56,420 INFO L225 Difference]: With dead ends: 7758 [2019-12-26 23:15:56,420 INFO L226 Difference]: Without dead ends: 5547 [2019-12-26 23:15:56,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-26 23:15:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2019-12-26 23:15:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 3630. [2019-12-26 23:15:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3630 states. [2019-12-26 23:15:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 7708 transitions. [2019-12-26 23:15:56,463 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 7708 transitions. Word has length 98 [2019-12-26 23:15:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:56,463 INFO L462 AbstractCegarLoop]: Abstraction has 3630 states and 7708 transitions. [2019-12-26 23:15:56,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:15:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 7708 transitions. [2019-12-26 23:15:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:56,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:56,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:56,467 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash 741591247, now seen corresponding path program 1 times [2019-12-26 23:15:56,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:56,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227350456] [2019-12-26 23:15:56,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:15:56,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-26 23:15:56,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227350456] [2019-12-26 23:15:56,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:15:56,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:15:56,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562050939] [2019-12-26 23:15:56,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:15:56,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:15:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:15:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:15:56,745 INFO L87 Difference]: Start difference. First operand 3630 states and 7708 transitions. Second operand 12 states. [2019-12-26 23:15:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:15:57,628 INFO L93 Difference]: Finished difference Result 5469 states and 11566 transitions. [2019-12-26 23:15:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:15:57,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-12-26 23:15:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:15:57,634 INFO L225 Difference]: With dead ends: 5469 [2019-12-26 23:15:57,634 INFO L226 Difference]: Without dead ends: 4180 [2019-12-26 23:15:57,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:15:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2019-12-26 23:15:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 3822. [2019-12-26 23:15:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3822 states. [2019-12-26 23:15:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3822 states and 7980 transitions. [2019-12-26 23:15:57,691 INFO L78 Accepts]: Start accepts. Automaton has 3822 states and 7980 transitions. Word has length 98 [2019-12-26 23:15:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:15:57,692 INFO L462 AbstractCegarLoop]: Abstraction has 3822 states and 7980 transitions. [2019-12-26 23:15:57,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:15:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3822 states and 7980 transitions. [2019-12-26 23:15:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:15:57,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:15:57,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:15:57,697 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:15:57,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:15:57,697 INFO L82 PathProgramCache]: Analyzing trace with hash 402744400, now seen corresponding path program 1 times [2019-12-26 23:15:57,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:15:57,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504975419] [2019-12-26 23:15:57,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:15:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:15:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:15:57,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:15:57,916 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:15:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19|) |v_ULTIMATE.start_main_~#t1645~0.offset_15| 0)) |v_#memory_int_9|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff1_thd1~0_311 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1645~0.base_19| 4)) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1645~0.base_19|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 |v_ULTIMATE.start_main_~#t1645~0.offset_15|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19| 1) |v_#valid_46|) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1645~0.base=|v_ULTIMATE.start_main_~#t1645~0.base_19|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_~#t1645~0.offset=|v_ULTIMATE.start_main_~#t1645~0.offset_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_17|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1645~0.base, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t1645~0.offset, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t1646~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_~#t1646~0.base, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:15:57,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1646~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1646~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1646~0.base_11| 4)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11|) |v_ULTIMATE.start_main_~#t1646~0.offset_10| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t1646~0.offset, #length, ULTIMATE.start_main_~#t1646~0.base] because there is no mapped edge [2019-12-26 23:15:57,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-44910230 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-44910230 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-44910230| |P0Thread1of1ForFork0_#t~ite3_Out-44910230|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-44910230 |P0Thread1of1ForFork0_#t~ite3_Out-44910230|) .cse2) (and (= ~y~0_In-44910230 |P0Thread1of1ForFork0_#t~ite3_Out-44910230|) (or .cse1 .cse0) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-44910230, ~y$w_buff1~0=~y$w_buff1~0_In-44910230, ~y~0=~y~0_In-44910230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44910230} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-44910230, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-44910230|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-44910230|, ~y$w_buff1~0=~y$w_buff1~0_In-44910230, ~y~0=~y~0_In-44910230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44910230} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:15:57,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-685532058 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-685532058 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-685532058| ~y$w_buff0_used~0_In-685532058)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-685532058| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-685532058, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-685532058} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-685532058|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-685532058, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-685532058} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:15:57,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-948486457 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-948486457 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-948486457 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-948486457 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-948486457 |P0Thread1of1ForFork0_#t~ite6_Out-948486457|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-948486457|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-948486457, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-948486457, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-948486457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948486457} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-948486457|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-948486457, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-948486457, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-948486457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-948486457} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:15:57,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1420205203 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1420205203 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1420205203| ~y$r_buff0_thd1~0_In-1420205203)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1420205203| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1420205203, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1420205203} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1420205203, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1420205203|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1420205203} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:15:57,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In1552109522 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1552109522 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1552109522 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1552109522 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1552109522|)) (and (= ~y$r_buff1_thd1~0_In1552109522 |P0Thread1of1ForFork0_#t~ite8_Out1552109522|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1552109522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1552109522, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1552109522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1552109522} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1552109522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1552109522, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1552109522|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1552109522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1552109522} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:15:57,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-573249959 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite9_Out-573249959| |P0Thread1of1ForFork0_#t~ite10_Out-573249959|)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-573249959 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite9_Out-573249959| ~y~0_In-573249959) .cse2) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite9_Out-573249959| ~y$w_buff1~0_In-573249959) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-573249959, ~y$w_buff1~0=~y$w_buff1~0_In-573249959, ~y~0=~y~0_In-573249959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-573249959} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out-573249959|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-573249959, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-573249959|, ~y$w_buff1~0=~y$w_buff1~0_In-573249959, ~y~0=~y~0_In-573249959, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-573249959} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-26 23:15:57,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_458 1) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= v_P1Thread1of1ForFork1_~arg.base_31 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_31) (= (mod v_~y$w_buff1_used~0_217 256) 0) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_33, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_31, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_31|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_31, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:15:57,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1357011972 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1357011972 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out-1357011972| ~y$w_buff1~0_In-1357011972) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite17_Out-1357011972| ~y$w_buff0~0_In-1357011972) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1357011972, ~y$w_buff1~0=~y$w_buff1~0_In-1357011972, ~y$w_buff0~0=~y$w_buff0~0_In-1357011972, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1357011972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1357011972, ~y$w_buff1~0=~y$w_buff1~0_In-1357011972, ~y$w_buff0~0=~y$w_buff0~0_In-1357011972, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1357011972, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1357011972|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:15:57,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_10|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_10|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_13|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-26 23:15:57,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_14|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_10|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 23:15:57,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-424088322 256)))) (or (and (= ~y$mem_tmp~0_In-424088322 |P1Thread1of1ForFork1_#t~ite37_Out-424088322|) (not .cse0)) (and (= ~y~0_In-424088322 |P1Thread1of1ForFork1_#t~ite37_Out-424088322|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-424088322, ~y$flush_delayed~0=~y$flush_delayed~0_In-424088322, ~y~0=~y~0_In-424088322} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-424088322, ~y$flush_delayed~0=~y$flush_delayed~0_In-424088322, ~y~0=~y~0_In-424088322, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-424088322|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:15:57,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite40_Out1462256842| |P1Thread1of1ForFork1_#t~ite41_Out1462256842|)) (.cse2 (= (mod ~y$w_buff0_used~0_In1462256842 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1462256842 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite40_Out1462256842| ~y$w_buff0~0_In1462256842)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite40_Out1462256842| ~y$w_buff1~0_In1462256842)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1462256842, ~y$w_buff1~0=~y$w_buff1~0_In1462256842, ~y$w_buff0~0=~y$w_buff0~0_In1462256842, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1462256842} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1462256842, ~y$w_buff1~0=~y$w_buff1~0_In1462256842, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out1462256842|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out1462256842|, ~y$w_buff0~0=~y$w_buff0~0_In1462256842, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1462256842} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-26 23:15:57,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_11|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_14|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 23:15:57,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-249385026 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out-249385026| ~y$mem_tmp~0_In-249385026) (not .cse0)) (and (= ~y~0_In-249385026 |P1Thread1of1ForFork1_#t~ite60_Out-249385026|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-249385026, ~y$flush_delayed~0=~y$flush_delayed~0_In-249385026, ~y~0=~y~0_In-249385026} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-249385026, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-249385026|, ~y$flush_delayed~0=~y$flush_delayed~0_In-249385026, ~y~0=~y~0_In-249385026} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-26 23:15:57,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1562323185 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1562323185 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1562323185 |P1Thread1of1ForFork1_#t~ite63_Out-1562323185|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite63_Out-1562323185|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562323185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1562323185} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out-1562323185|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562323185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1562323185} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-26 23:15:57,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-37420157 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-37420157 256)))) (or (and (= ~y$w_buff0_used~0_In-37420157 |P0Thread1of1ForFork0_#t~ite11_Out-37420157|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite11_Out-37420157|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-37420157, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-37420157} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-37420157|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-37420157, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-37420157} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 23:15:57,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1177743906 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1177743906 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1177743906 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1177743906 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1177743906 |P1Thread1of1ForFork1_#t~ite64_Out1177743906|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite64_Out1177743906|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1177743906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1177743906, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1177743906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1177743906} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1177743906, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out1177743906|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1177743906, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1177743906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1177743906} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-26 23:15:57,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In253009989 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In253009989 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out253009989)) (and (= ~y$r_buff0_thd2~0_In253009989 ~y$r_buff0_thd2~0_Out253009989) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In253009989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In253009989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In253009989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out253009989, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out253009989|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-26 23:15:57,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1795588980 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1795588980 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1795588980 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1795588980 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite66_Out-1795588980|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1795588980 |P1Thread1of1ForFork1_#t~ite66_Out-1795588980|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1795588980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1795588980, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1795588980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1795588980} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1795588980, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1795588980, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1795588980, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out-1795588980|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1795588980} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-26 23:15:57,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:15:57,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-967420074 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-967420074 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-967420074 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-967420074 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite12_Out-967420074| 0)) (and (= |P0Thread1of1ForFork0_#t~ite12_Out-967420074| ~y$w_buff1_used~0_In-967420074) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-967420074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-967420074, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-967420074, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-967420074} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-967420074, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-967420074, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-967420074, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-967420074|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-967420074} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 23:15:57,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1104988046 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1104988046 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1104988046 |P0Thread1of1ForFork0_#t~ite13_Out-1104988046|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite13_Out-1104988046|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1104988046, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1104988046} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1104988046, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1104988046, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-1104988046|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 23:15:57,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1518782882 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1518782882 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1518782882 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1518782882 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite14_Out1518782882|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1518782882 |P0Thread1of1ForFork0_#t~ite14_Out1518782882|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1518782882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1518782882, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1518782882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1518782882} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1518782882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1518782882, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1518782882, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out1518782882|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1518782882} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 23:15:57,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_28|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_27|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 23:15:57,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 2 v_~__unbuffered_cnt~0_26)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:15:57,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1009603621 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1009603621 256)))) (or (and (= ~y~0_In-1009603621 |ULTIMATE.start_main_#t~ite69_Out-1009603621|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-1009603621 |ULTIMATE.start_main_#t~ite69_Out-1009603621|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1009603621, ~y~0=~y~0_In-1009603621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1009603621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1009603621} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1009603621, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1009603621|, ~y~0=~y~0_In-1009603621, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1009603621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1009603621} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-26 23:15:57,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-26 23:15:57,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In10636084 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In10636084 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite71_Out10636084| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite71_Out10636084| ~y$w_buff0_used~0_In10636084) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In10636084, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In10636084} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out10636084|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In10636084, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In10636084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-26 23:15:57,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1515973127 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1515973127 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1515973127 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1515973127 256)))) (or (and (= |ULTIMATE.start_main_#t~ite72_Out-1515973127| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite72_Out-1515973127| ~y$w_buff1_used~0_In-1515973127) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515973127, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1515973127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1515973127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1515973127} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1515973127|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515973127, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1515973127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1515973127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1515973127} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-26 23:15:57,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-565918906 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-565918906 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite73_Out-565918906| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite73_Out-565918906| ~y$r_buff0_thd0~0_In-565918906) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-565918906, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-565918906} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-565918906|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-565918906, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-565918906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-26 23:15:57,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1849560328 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1849560328 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1849560328 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1849560328 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite74_Out-1849560328|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite74_Out-1849560328| ~y$r_buff1_thd0~0_In-1849560328) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1849560328, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1849560328, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1849560328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1849560328} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1849560328|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1849560328, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1849560328, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1849560328, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1849560328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-26 23:15:57,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1933166587 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite97_Out-1933166587| ~y~0_In-1933166587)) (and (not .cse0) (= ~y$mem_tmp~0_In-1933166587 |ULTIMATE.start_main_#t~ite97_Out-1933166587|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1933166587, ~y$flush_delayed~0=~y$flush_delayed~0_In-1933166587, ~y~0=~y~0_In-1933166587} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1933166587, ~y$flush_delayed~0=~y$flush_delayed~0_In-1933166587, ~y~0=~y~0_In-1933166587, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1933166587|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-26 23:15:57,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-26 23:15:58,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:15:58 BasicIcfg [2019-12-26 23:15:58,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:15:58,115 INFO L168 Benchmark]: Toolchain (without parser) took 64746.41 ms. Allocated memory was 138.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 100.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 385.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,115 INFO L168 Benchmark]: CDTParser took 0.21 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.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.81 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 154.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.50 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 150.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,120 INFO L168 Benchmark]: Boogie Preprocessor took 49.29 ms. Allocated memory is still 203.9 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,120 INFO L168 Benchmark]: RCFGBuilder took 1360.23 ms. Allocated memory was 203.9 MB in the beginning and 237.0 MB in the end (delta: 33.0 MB). Free memory was 148.0 MB in the beginning and 191.9 MB in the end (delta: -43.9 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,121 INFO L168 Benchmark]: TraceAbstraction took 62423.30 ms. Allocated memory was 237.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 191.9 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 377.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:15:58,126 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.21 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.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.81 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 154.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.50 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 150.7 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.29 ms. Allocated memory is still 203.9 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1360.23 ms. Allocated memory was 203.9 MB in the beginning and 237.0 MB in the end (delta: 33.0 MB). Free memory was 148.0 MB in the beginning and 191.9 MB in the end (delta: -43.9 MB). Peak memory consumption was 65.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62423.30 ms. Allocated memory was 237.0 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 191.9 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 377.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 244 ProgramPointsBefore, 155 ProgramPointsAfterwards, 326 TransitionsBefore, 192 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 78 ConcurrentYvCompositions, 48 ChoiceCompositions, 16023 VarBasedMoverChecksPositive, 415 VarBasedMoverChecksNegative, 104 SemBasedMoverChecksPositive, 452 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 0 MoverChecksTotal, 282427 CheckedPairsTotal, 142 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 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)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 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)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 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)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 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)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 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) [L788] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 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)) [L789] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 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)) [L790] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 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)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 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)) [L793] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 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)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.9s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7182 SDtfs, 7130 SDslu, 27284 SDs, 0 SdLazy, 11334 SolverSat, 381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 60 SyntacticMatches, 36 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126190occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 23483 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2088 NumberOfCodeBlocks, 2088 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1965 ConstructedInterpolants, 0 QuantifiedInterpolants, 696582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...