/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:23:04,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:23:04,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:23:04,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:23:04,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:23:04,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:23:04,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:23:04,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:23:04,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:23:04,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:23:04,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:23:04,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:23:04,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:23:04,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:23:04,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:23:04,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:23:04,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:23:04,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:23:04,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:23:04,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:23:04,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:23:04,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:23:04,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:23:04,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:23:04,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:23:04,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:23:04,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:23:04,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:23:04,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:23:04,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:23:04,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:23:04,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:23:04,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:23:04,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:23:04,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:23:04,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:23:04,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:23:04,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:23:04,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:23:04,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:23:04,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:23:04,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:23:04,420 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:23:04,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:23:04,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:23:04,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:23:04,422 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:23:04,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:23:04,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:23:04,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:23:04,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:23:04,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:23:04,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:23:04,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:23:04,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:23:04,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:23:04,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:23:04,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:23:04,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:23:04,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:23:04,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:23:04,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:23:04,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:23:04,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:23:04,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:23:04,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:23:04,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:23:04,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:23:04,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:23:04,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:23:04,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:23:04,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:23:04,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:23:04,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:23:04,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:23:04,781 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:23:04,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-18 16:23:04,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a5e0b3b/ae5243a67a8f4878b01d76a978527438/FLAGe8b5aa313 [2019-12-18 16:23:05,370 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:23:05,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.opt.i [2019-12-18 16:23:05,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a5e0b3b/ae5243a67a8f4878b01d76a978527438/FLAGe8b5aa313 [2019-12-18 16:23:05,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7a5e0b3b/ae5243a67a8f4878b01d76a978527438 [2019-12-18 16:23:05,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:23:05,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:23:05,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:23:05,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:23:05,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:23:05,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:23:05" (1/1) ... [2019-12-18 16:23:05,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:05, skipping insertion in model container [2019-12-18 16:23:05,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:23:05" (1/1) ... [2019-12-18 16:23:05,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:23:05,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:23:06,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:23:06,394 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:23:06,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:23:06,569 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:23:06,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06 WrapperNode [2019-12-18 16:23:06,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:23:06,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:23:06,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:23:06,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:23:06,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:23:06,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:23:06,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:23:06,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:23:06,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (1/1) ... [2019-12-18 16:23:06,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:23:06,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:23:06,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:23:06,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:23:06,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (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-18 16:23:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:23:06,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:23:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:23:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:23:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:23:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:23:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:23:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:23:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:23:06,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:23:06,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:23:06,780 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:23:07,606 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:23:07,606 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:23:07,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:23:07 BoogieIcfgContainer [2019-12-18 16:23:07,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:23:07,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:23:07,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:23:07,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:23:07,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:23:05" (1/3) ... [2019-12-18 16:23:07,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399834f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:23:07, skipping insertion in model container [2019-12-18 16:23:07,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:06" (2/3) ... [2019-12-18 16:23:07,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399834f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:23:07, skipping insertion in model container [2019-12-18 16:23:07,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:23:07" (3/3) ... [2019-12-18 16:23:07,617 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.opt.i [2019-12-18 16:23:07,629 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:23:07,629 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:23:07,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:23:07,639 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:23:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,779 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:07,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 16:23:07,816 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:23:07,817 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:23:07,817 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:23:07,817 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:23:07,817 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:23:07,817 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:23:07,817 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:23:07,817 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:23:07,836 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-18 16:23:07,838 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 16:23:07,950 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 16:23:07,951 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:23:07,979 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 16:23:08,010 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 16:23:08,099 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 16:23:08,099 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:23:08,107 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 16:23:08,135 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 16:23:08,137 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:23:13,099 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 16:23:13,376 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 16:23:13,494 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 16:23:13,564 INFO L206 etLargeBlockEncoding]: Checked pairs total: 122314 [2019-12-18 16:23:13,564 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 16:23:13,567 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 126 transitions [2019-12-18 16:23:14,949 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24222 states. [2019-12-18 16:23:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 24222 states. [2019-12-18 16:23:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:23:14,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:14,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:23:14,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash 958600405, now seen corresponding path program 1 times [2019-12-18 16:23:14,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:14,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652263765] [2019-12-18 16:23:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:15,182 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-18 16:23:15,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652263765] [2019-12-18 16:23:15,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:15,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:23:15,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544416887] [2019-12-18 16:23:15,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:15,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:15,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:15,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:15,208 INFO L87 Difference]: Start difference. First operand 24222 states. Second operand 3 states. [2019-12-18 16:23:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:15,677 INFO L93 Difference]: Finished difference Result 24022 states and 85786 transitions. [2019-12-18 16:23:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:15,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:23:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:15,868 INFO L225 Difference]: With dead ends: 24022 [2019-12-18 16:23:15,868 INFO L226 Difference]: Without dead ends: 22482 [2019-12-18 16:23:15,869 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-18 16:23:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22482 states. [2019-12-18 16:23:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22482 to 22482. [2019-12-18 16:23:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22482 states. [2019-12-18 16:23:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 80227 transitions. [2019-12-18 16:23:18,174 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 80227 transitions. Word has length 5 [2019-12-18 16:23:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:18,174 INFO L462 AbstractCegarLoop]: Abstraction has 22482 states and 80227 transitions. [2019-12-18 16:23:18,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 80227 transitions. [2019-12-18 16:23:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:23:18,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:18,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:18,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash -131274802, now seen corresponding path program 1 times [2019-12-18 16:23:18,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:18,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297661829] [2019-12-18 16:23:18,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:18,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-18 16:23:18,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297661829] [2019-12-18 16:23:18,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:18,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:18,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094372133] [2019-12-18 16:23:18,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:18,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:18,309 INFO L87 Difference]: Start difference. First operand 22482 states and 80227 transitions. Second operand 4 states. [2019-12-18 16:23:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:18,909 INFO L93 Difference]: Finished difference Result 34872 states and 119343 transitions. [2019-12-18 16:23:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:18,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:23:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:19,053 INFO L225 Difference]: With dead ends: 34872 [2019-12-18 16:23:19,053 INFO L226 Difference]: Without dead ends: 34857 [2019-12-18 16:23:19,054 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-18 16:23:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34857 states. [2019-12-18 16:23:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34857 to 33973. [2019-12-18 16:23:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33973 states. [2019-12-18 16:23:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33973 states to 33973 states and 117000 transitions. [2019-12-18 16:23:22,364 INFO L78 Accepts]: Start accepts. Automaton has 33973 states and 117000 transitions. Word has length 11 [2019-12-18 16:23:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:22,364 INFO L462 AbstractCegarLoop]: Abstraction has 33973 states and 117000 transitions. [2019-12-18 16:23:22,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 33973 states and 117000 transitions. [2019-12-18 16:23:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:23:22,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:22,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:22,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -570349916, now seen corresponding path program 1 times [2019-12-18 16:23:22,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:22,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564007260] [2019-12-18 16:23:22,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:22,471 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-18 16:23:22,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564007260] [2019-12-18 16:23:22,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:22,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:22,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184513519] [2019-12-18 16:23:22,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:22,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:22,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:22,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:22,473 INFO L87 Difference]: Start difference. First operand 33973 states and 117000 transitions. Second operand 4 states. [2019-12-18 16:23:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:22,934 INFO L93 Difference]: Finished difference Result 43608 states and 147815 transitions. [2019-12-18 16:23:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:22,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:23:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:23,205 INFO L225 Difference]: With dead ends: 43608 [2019-12-18 16:23:23,206 INFO L226 Difference]: Without dead ends: 43594 [2019-12-18 16:23:23,206 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-18 16:23:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43594 states. [2019-12-18 16:23:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43594 to 39207. [2019-12-18 16:23:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39207 states. [2019-12-18 16:23:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39207 states to 39207 states and 134217 transitions. [2019-12-18 16:23:24,790 INFO L78 Accepts]: Start accepts. Automaton has 39207 states and 134217 transitions. Word has length 14 [2019-12-18 16:23:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:24,791 INFO L462 AbstractCegarLoop]: Abstraction has 39207 states and 134217 transitions. [2019-12-18 16:23:24,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 39207 states and 134217 transitions. [2019-12-18 16:23:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:23:24,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:24,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:24,796 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -500949887, now seen corresponding path program 1 times [2019-12-18 16:23:24,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:24,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984886981] [2019-12-18 16:23:24,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:24,844 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-18 16:23:24,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984886981] [2019-12-18 16:23:24,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:24,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:24,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223415755] [2019-12-18 16:23:24,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:24,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:24,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:24,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:24,849 INFO L87 Difference]: Start difference. First operand 39207 states and 134217 transitions. Second operand 3 states. [2019-12-18 16:23:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:25,490 INFO L93 Difference]: Finished difference Result 65918 states and 215197 transitions. [2019-12-18 16:23:25,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:25,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 16:23:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:25,665 INFO L225 Difference]: With dead ends: 65918 [2019-12-18 16:23:25,665 INFO L226 Difference]: Without dead ends: 65918 [2019-12-18 16:23:25,666 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-18 16:23:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65918 states. [2019-12-18 16:23:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65918 to 58476. [2019-12-18 16:23:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58476 states. [2019-12-18 16:23:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58476 states to 58476 states and 193967 transitions. [2019-12-18 16:23:30,017 INFO L78 Accepts]: Start accepts. Automaton has 58476 states and 193967 transitions. Word has length 15 [2019-12-18 16:23:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:30,017 INFO L462 AbstractCegarLoop]: Abstraction has 58476 states and 193967 transitions. [2019-12-18 16:23:30,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 58476 states and 193967 transitions. [2019-12-18 16:23:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:23:30,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:30,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:30,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1418364262, now seen corresponding path program 1 times [2019-12-18 16:23:30,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:30,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849993975] [2019-12-18 16:23:30,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:30,114 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-18 16:23:30,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849993975] [2019-12-18 16:23:30,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:30,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:23:30,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103607502] [2019-12-18 16:23:30,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:30,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:30,116 INFO L87 Difference]: Start difference. First operand 58476 states and 193967 transitions. Second operand 3 states. [2019-12-18 16:23:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:30,320 INFO L93 Difference]: Finished difference Result 55330 states and 183290 transitions. [2019-12-18 16:23:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:30,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:23:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:30,424 INFO L225 Difference]: With dead ends: 55330 [2019-12-18 16:23:30,424 INFO L226 Difference]: Without dead ends: 55330 [2019-12-18 16:23:30,424 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-18 16:23:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55330 states. [2019-12-18 16:23:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55330 to 55330. [2019-12-18 16:23:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55330 states. [2019-12-18 16:23:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55330 states to 55330 states and 183290 transitions. [2019-12-18 16:23:31,727 INFO L78 Accepts]: Start accepts. Automaton has 55330 states and 183290 transitions. Word has length 16 [2019-12-18 16:23:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:31,727 INFO L462 AbstractCegarLoop]: Abstraction has 55330 states and 183290 transitions. [2019-12-18 16:23:31,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states and 183290 transitions. [2019-12-18 16:23:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 16:23:31,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:31,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:31,735 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:31,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:31,735 INFO L82 PathProgramCache]: Analyzing trace with hash 285364695, now seen corresponding path program 1 times [2019-12-18 16:23:31,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:31,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882159252] [2019-12-18 16:23:31,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:31,776 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-18 16:23:31,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882159252] [2019-12-18 16:23:31,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:31,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:31,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926286694] [2019-12-18 16:23:31,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:31,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:31,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:31,778 INFO L87 Difference]: Start difference. First operand 55330 states and 183290 transitions. Second operand 4 states. [2019-12-18 16:23:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:32,578 INFO L93 Difference]: Finished difference Result 68586 states and 223928 transitions. [2019-12-18 16:23:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:32,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 16:23:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:32,706 INFO L225 Difference]: With dead ends: 68586 [2019-12-18 16:23:32,706 INFO L226 Difference]: Without dead ends: 68569 [2019-12-18 16:23:32,706 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-18 16:23:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68569 states. [2019-12-18 16:23:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68569 to 56099. [2019-12-18 16:23:35,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56099 states. [2019-12-18 16:23:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56099 states to 56099 states and 185794 transitions. [2019-12-18 16:23:35,846 INFO L78 Accepts]: Start accepts. Automaton has 56099 states and 185794 transitions. Word has length 17 [2019-12-18 16:23:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:35,846 INFO L462 AbstractCegarLoop]: Abstraction has 56099 states and 185794 transitions. [2019-12-18 16:23:35,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 56099 states and 185794 transitions. [2019-12-18 16:23:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 16:23:35,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:35,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:35,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:35,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash -762555601, now seen corresponding path program 1 times [2019-12-18 16:23:35,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:35,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853689901] [2019-12-18 16:23:35,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:35,921 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-18 16:23:35,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853689901] [2019-12-18 16:23:35,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:35,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:35,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438769724] [2019-12-18 16:23:35,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:35,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:35,923 INFO L87 Difference]: Start difference. First operand 56099 states and 185794 transitions. Second operand 5 states. [2019-12-18 16:23:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:36,775 INFO L93 Difference]: Finished difference Result 78809 states and 254697 transitions. [2019-12-18 16:23:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:23:36,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-18 16:23:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:36,931 INFO L225 Difference]: With dead ends: 78809 [2019-12-18 16:23:36,931 INFO L226 Difference]: Without dead ends: 78795 [2019-12-18 16:23:36,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:23:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78795 states. [2019-12-18 16:23:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78795 to 61307. [2019-12-18 16:23:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61307 states. [2019-12-18 16:23:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61307 states to 61307 states and 202072 transitions. [2019-12-18 16:23:41,355 INFO L78 Accepts]: Start accepts. Automaton has 61307 states and 202072 transitions. Word has length 20 [2019-12-18 16:23:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:41,355 INFO L462 AbstractCegarLoop]: Abstraction has 61307 states and 202072 transitions. [2019-12-18 16:23:41,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 61307 states and 202072 transitions. [2019-12-18 16:23:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 16:23:41,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:41,374 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] [2019-12-18 16:23:41,374 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash -915737050, now seen corresponding path program 1 times [2019-12-18 16:23:41,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:41,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045626492] [2019-12-18 16:23:41,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:41,435 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-18 16:23:41,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045626492] [2019-12-18 16:23:41,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:41,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:41,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711358314] [2019-12-18 16:23:41,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:41,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:41,437 INFO L87 Difference]: Start difference. First operand 61307 states and 202072 transitions. Second operand 4 states. [2019-12-18 16:23:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:41,514 INFO L93 Difference]: Finished difference Result 11362 states and 30298 transitions. [2019-12-18 16:23:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:23:41,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 16:23:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:41,527 INFO L225 Difference]: With dead ends: 11362 [2019-12-18 16:23:41,527 INFO L226 Difference]: Without dead ends: 7054 [2019-12-18 16:23:41,527 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-18 16:23:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-12-18 16:23:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 7010. [2019-12-18 16:23:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-12-18 16:23:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 16196 transitions. [2019-12-18 16:23:41,617 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 16196 transitions. Word has length 23 [2019-12-18 16:23:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:41,618 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 16196 transitions. [2019-12-18 16:23:41,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 16196 transitions. [2019-12-18 16:23:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 16:23:41,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:41,625 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] [2019-12-18 16:23:41,625 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 484194479, now seen corresponding path program 1 times [2019-12-18 16:23:41,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130755820] [2019-12-18 16:23:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:41,670 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-18 16:23:41,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130755820] [2019-12-18 16:23:41,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:41,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:41,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899290575] [2019-12-18 16:23:41,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:41,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:41,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:41,672 INFO L87 Difference]: Start difference. First operand 7010 states and 16196 transitions. Second operand 3 states. [2019-12-18 16:23:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:41,748 INFO L93 Difference]: Finished difference Result 7678 states and 16747 transitions. [2019-12-18 16:23:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:41,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 16:23:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:41,755 INFO L225 Difference]: With dead ends: 7678 [2019-12-18 16:23:41,755 INFO L226 Difference]: Without dead ends: 7678 [2019-12-18 16:23:41,756 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-18 16:23:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7678 states. [2019-12-18 16:23:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7678 to 7092. [2019-12-18 16:23:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7092 states. [2019-12-18 16:23:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7092 states to 7092 states and 15530 transitions. [2019-12-18 16:23:41,827 INFO L78 Accepts]: Start accepts. Automaton has 7092 states and 15530 transitions. Word has length 31 [2019-12-18 16:23:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:41,828 INFO L462 AbstractCegarLoop]: Abstraction has 7092 states and 15530 transitions. [2019-12-18 16:23:41,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7092 states and 15530 transitions. [2019-12-18 16:23:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:23:41,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:41,834 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-18 16:23:41,834 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:41,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1443742418, now seen corresponding path program 1 times [2019-12-18 16:23:41,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:41,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872849470] [2019-12-18 16:23:41,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:41,919 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-18 16:23:41,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872849470] [2019-12-18 16:23:41,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:41,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:41,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310890113] [2019-12-18 16:23:41,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:41,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:41,921 INFO L87 Difference]: Start difference. First operand 7092 states and 15530 transitions. Second operand 5 states. [2019-12-18 16:23:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:42,280 INFO L93 Difference]: Finished difference Result 8001 states and 17262 transitions. [2019-12-18 16:23:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:23:42,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 16:23:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:42,291 INFO L225 Difference]: With dead ends: 8001 [2019-12-18 16:23:42,291 INFO L226 Difference]: Without dead ends: 8000 [2019-12-18 16:23:42,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2019-12-18 16:23:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 6268. [2019-12-18 16:23:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6268 states. [2019-12-18 16:23:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13863 transitions. [2019-12-18 16:23:42,358 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13863 transitions. Word has length 34 [2019-12-18 16:23:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:42,358 INFO L462 AbstractCegarLoop]: Abstraction has 6268 states and 13863 transitions. [2019-12-18 16:23:42,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13863 transitions. [2019-12-18 16:23:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 16:23:42,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:42,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:42,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash -774360428, now seen corresponding path program 1 times [2019-12-18 16:23:42,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:42,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393576783] [2019-12-18 16:23:42,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:42,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393576783] [2019-12-18 16:23:42,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:42,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:42,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465876974] [2019-12-18 16:23:42,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:42,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:42,434 INFO L87 Difference]: Start difference. First operand 6268 states and 13863 transitions. Second operand 5 states. [2019-12-18 16:23:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:42,559 INFO L93 Difference]: Finished difference Result 9283 states and 20621 transitions. [2019-12-18 16:23:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:23:42,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 16:23:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:42,569 INFO L225 Difference]: With dead ends: 9283 [2019-12-18 16:23:42,569 INFO L226 Difference]: Without dead ends: 7431 [2019-12-18 16:23:42,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:23:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2019-12-18 16:23:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7431. [2019-12-18 16:23:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7431 states. [2019-12-18 16:23:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7431 states to 7431 states and 16520 transitions. [2019-12-18 16:23:42,650 INFO L78 Accepts]: Start accepts. Automaton has 7431 states and 16520 transitions. Word has length 41 [2019-12-18 16:23:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:42,650 INFO L462 AbstractCegarLoop]: Abstraction has 7431 states and 16520 transitions. [2019-12-18 16:23:42,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7431 states and 16520 transitions. [2019-12-18 16:23:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 16:23:42,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:42,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:42,660 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 102105480, now seen corresponding path program 1 times [2019-12-18 16:23:42,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:42,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693363090] [2019-12-18 16:23:42,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:42,782 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-18 16:23:42,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693363090] [2019-12-18 16:23:42,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:42,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:23:42,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019766984] [2019-12-18 16:23:42,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:42,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:42,784 INFO L87 Difference]: Start difference. First operand 7431 states and 16520 transitions. Second operand 5 states. [2019-12-18 16:23:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:43,189 INFO L93 Difference]: Finished difference Result 8540 states and 18759 transitions. [2019-12-18 16:23:43,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:23:43,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 16:23:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:43,199 INFO L225 Difference]: With dead ends: 8540 [2019-12-18 16:23:43,199 INFO L226 Difference]: Without dead ends: 8540 [2019-12-18 16:23:43,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-18 16:23:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2019-12-18 16:23:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8196. [2019-12-18 16:23:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-18 16:23:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 18092 transitions. [2019-12-18 16:23:43,487 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 18092 transitions. Word has length 42 [2019-12-18 16:23:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:43,487 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 18092 transitions. [2019-12-18 16:23:43,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 18092 transitions. [2019-12-18 16:23:43,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 16:23:43,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:43,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:43,496 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:43,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:43,496 INFO L82 PathProgramCache]: Analyzing trace with hash -743886017, now seen corresponding path program 1 times [2019-12-18 16:23:43,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:43,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946727030] [2019-12-18 16:23:43,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:43,579 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-18 16:23:43,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946727030] [2019-12-18 16:23:43,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:43,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:23:43,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596425769] [2019-12-18 16:23:43,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:43,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:43,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:43,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:43,581 INFO L87 Difference]: Start difference. First operand 8196 states and 18092 transitions. Second operand 5 states. [2019-12-18 16:23:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:43,954 INFO L93 Difference]: Finished difference Result 9041 states and 19641 transitions. [2019-12-18 16:23:43,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:23:43,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 16:23:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:43,964 INFO L225 Difference]: With dead ends: 9041 [2019-12-18 16:23:43,964 INFO L226 Difference]: Without dead ends: 9041 [2019-12-18 16:23:43,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:23:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9041 states. [2019-12-18 16:23:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9041 to 8167. [2019-12-18 16:23:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-12-18 16:23:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 17685 transitions. [2019-12-18 16:23:44,052 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 17685 transitions. Word has length 43 [2019-12-18 16:23:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:44,052 INFO L462 AbstractCegarLoop]: Abstraction has 8167 states and 17685 transitions. [2019-12-18 16:23:44,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 17685 transitions. [2019-12-18 16:23:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 16:23:44,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:44,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:44,061 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2031288696, now seen corresponding path program 1 times [2019-12-18 16:23:44,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:44,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958719408] [2019-12-18 16:23:44,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:44,161 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-18 16:23:44,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958719408] [2019-12-18 16:23:44,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:44,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:23:44,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581713300] [2019-12-18 16:23:44,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:44,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:44,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:44,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:44,163 INFO L87 Difference]: Start difference. First operand 8167 states and 17685 transitions. Second operand 5 states. [2019-12-18 16:23:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:44,231 INFO L93 Difference]: Finished difference Result 5420 states and 11591 transitions. [2019-12-18 16:23:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:23:44,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 16:23:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:44,240 INFO L225 Difference]: With dead ends: 5420 [2019-12-18 16:23:44,241 INFO L226 Difference]: Without dead ends: 5102 [2019-12-18 16:23:44,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2019-12-18 16:23:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 4812. [2019-12-18 16:23:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4812 states. [2019-12-18 16:23:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 10392 transitions. [2019-12-18 16:23:44,335 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 10392 transitions. Word has length 43 [2019-12-18 16:23:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:44,335 INFO L462 AbstractCegarLoop]: Abstraction has 4812 states and 10392 transitions. [2019-12-18 16:23:44,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 10392 transitions. [2019-12-18 16:23:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:44,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:44,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:44,348 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:44,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash -687344087, now seen corresponding path program 1 times [2019-12-18 16:23:44,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:44,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537053442] [2019-12-18 16:23:44,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:44,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537053442] [2019-12-18 16:23:44,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:44,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:44,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113312979] [2019-12-18 16:23:44,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:44,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:44,424 INFO L87 Difference]: Start difference. First operand 4812 states and 10392 transitions. Second operand 4 states. [2019-12-18 16:23:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:44,462 INFO L93 Difference]: Finished difference Result 5623 states and 12060 transitions. [2019-12-18 16:23:44,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:23:44,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-18 16:23:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:44,464 INFO L225 Difference]: With dead ends: 5623 [2019-12-18 16:23:44,464 INFO L226 Difference]: Without dead ends: 878 [2019-12-18 16:23:44,465 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-18 16:23:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-12-18 16:23:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2019-12-18 16:23:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-12-18 16:23:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1758 transitions. [2019-12-18 16:23:44,480 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1758 transitions. Word has length 59 [2019-12-18 16:23:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:44,481 INFO L462 AbstractCegarLoop]: Abstraction has 878 states and 1758 transitions. [2019-12-18 16:23:44,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1758 transitions. [2019-12-18 16:23:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:44,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:44,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:44,484 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 472534802, now seen corresponding path program 1 times [2019-12-18 16:23:44,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:44,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340269539] [2019-12-18 16:23:44,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:44,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-18 16:23:44,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340269539] [2019-12-18 16:23:44,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:44,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:23:44,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838429519] [2019-12-18 16:23:44,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:23:44,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:23:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:23:44,603 INFO L87 Difference]: Start difference. First operand 878 states and 1758 transitions. Second operand 8 states. [2019-12-18 16:23:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:44,907 INFO L93 Difference]: Finished difference Result 1818 states and 3479 transitions. [2019-12-18 16:23:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:23:44,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-18 16:23:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:44,910 INFO L225 Difference]: With dead ends: 1818 [2019-12-18 16:23:44,910 INFO L226 Difference]: Without dead ends: 1302 [2019-12-18 16:23:44,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:23:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-18 16:23:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 928. [2019-12-18 16:23:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-18 16:23:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1832 transitions. [2019-12-18 16:23:44,927 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1832 transitions. Word has length 59 [2019-12-18 16:23:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:44,928 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1832 transitions. [2019-12-18 16:23:44,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:23:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1832 transitions. [2019-12-18 16:23:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:44,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:44,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:44,931 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1337355214, now seen corresponding path program 2 times [2019-12-18 16:23:44,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:44,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662195346] [2019-12-18 16:23:44,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:23:45,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662195346] [2019-12-18 16:23:45,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:45,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:23:45,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481770010] [2019-12-18 16:23:45,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:23:45,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:45,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:23:45,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:23:45,127 INFO L87 Difference]: Start difference. First operand 928 states and 1832 transitions. Second operand 10 states. [2019-12-18 16:23:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:45,747 INFO L93 Difference]: Finished difference Result 1439 states and 2757 transitions. [2019-12-18 16:23:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:23:45,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 16:23:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:45,750 INFO L225 Difference]: With dead ends: 1439 [2019-12-18 16:23:45,750 INFO L226 Difference]: Without dead ends: 1439 [2019-12-18 16:23:45,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:23:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-12-18 16:23:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 937. [2019-12-18 16:23:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-18 16:23:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1850 transitions. [2019-12-18 16:23:45,761 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1850 transitions. Word has length 59 [2019-12-18 16:23:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:45,761 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1850 transitions. [2019-12-18 16:23:45,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:23:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1850 transitions. [2019-12-18 16:23:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:45,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:45,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:45,763 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -656253202, now seen corresponding path program 3 times [2019-12-18 16:23:45,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:45,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530967615] [2019-12-18 16:23:45,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:45,835 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-18 16:23:45,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530967615] [2019-12-18 16:23:45,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:45,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:23:45,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519668703] [2019-12-18 16:23:45,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:23:45,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:45,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:23:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:23:45,837 INFO L87 Difference]: Start difference. First operand 937 states and 1850 transitions. Second operand 6 states. [2019-12-18 16:23:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:46,229 INFO L93 Difference]: Finished difference Result 1145 states and 2216 transitions. [2019-12-18 16:23:46,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:23:46,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 16:23:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:46,231 INFO L225 Difference]: With dead ends: 1145 [2019-12-18 16:23:46,231 INFO L226 Difference]: Without dead ends: 1145 [2019-12-18 16:23:46,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:23:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-18 16:23:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 967. [2019-12-18 16:23:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2019-12-18 16:23:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1905 transitions. [2019-12-18 16:23:46,245 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1905 transitions. Word has length 59 [2019-12-18 16:23:46,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:46,246 INFO L462 AbstractCegarLoop]: Abstraction has 967 states and 1905 transitions. [2019-12-18 16:23:46,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:23:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1905 transitions. [2019-12-18 16:23:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 16:23:46,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:46,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:46,249 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:46,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:46,249 INFO L82 PathProgramCache]: Analyzing trace with hash -308873018, now seen corresponding path program 4 times [2019-12-18 16:23:46,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:46,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953629659] [2019-12-18 16:23:46,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:46,309 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-18 16:23:46,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953629659] [2019-12-18 16:23:46,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:46,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:46,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316204818] [2019-12-18 16:23:46,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:46,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:46,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:46,312 INFO L87 Difference]: Start difference. First operand 967 states and 1905 transitions. Second operand 3 states. [2019-12-18 16:23:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:46,324 INFO L93 Difference]: Finished difference Result 966 states and 1903 transitions. [2019-12-18 16:23:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:46,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 16:23:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:46,326 INFO L225 Difference]: With dead ends: 966 [2019-12-18 16:23:46,326 INFO L226 Difference]: Without dead ends: 966 [2019-12-18 16:23:46,327 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-18 16:23:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-18 16:23:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 823. [2019-12-18 16:23:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-18 16:23:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1640 transitions. [2019-12-18 16:23:46,337 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1640 transitions. Word has length 59 [2019-12-18 16:23:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:46,338 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1640 transitions. [2019-12-18 16:23:46,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1640 transitions. [2019-12-18 16:23:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 16:23:46,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:46,342 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] [2019-12-18 16:23:46,343 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1424316398, now seen corresponding path program 1 times [2019-12-18 16:23:46,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:46,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425370886] [2019-12-18 16:23:46,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:23:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:23:46,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:23:46,463 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:23:46,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x$w_buff0~0_184) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35|)) (= v_~x$r_buff0_thd0~0_104 0) (= v_~x$flush_delayed~0_211 0) (= 0 v_~x$w_buff1~0_179) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= 0 v_~x~0_237) (= 0 v_~x$mem_tmp~0_172) (= 0 v_~x$r_buff1_thd2~0_289) (= v_~y~0_71 0) (= v_~__unbuffered_p1_EBX~0_59 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_39 0) (= 0 v_~__unbuffered_cnt~0_51) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_189 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_243 0) (= v_~main$tmp_guard0~0_35 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff1_used~0_431) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t311~0.base_35|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t311~0.base_35| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t311~0.base_35| 1) |v_#valid_53|) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~x$r_buff0_thd2~0_420) (= v_~x$r_buff1_thd1~0_241 0) (= 0 |v_ULTIMATE.start_main_~#t311~0.offset_25|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$w_buff0_used~0_795) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t311~0.base_35|) |v_ULTIMATE.start_main_~#t311~0.offset_25| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ~x$flush_delayed~0=v_~x$flush_delayed~0_211, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_20|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ~x$mem_tmp~0=v_~x$mem_tmp~0_172, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_19|, ~y~0=v_~y~0_71, ULTIMATE.start_main_~#t311~0.offset=|v_ULTIMATE.start_main_~#t311~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_179, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_35|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_289, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_169|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_35, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_189, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_420, ULTIMATE.start_main_~#t311~0.base=|v_ULTIMATE.start_main_~#t311~0.base_35|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_79|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_229|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_27|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_243, ~x~0=v_~x~0_237, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t312~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t311~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t311~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 16:23:46,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L808-1-->L810: Formula: (and (not (= |v_ULTIMATE.start_main_~#t312~0.base_11| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t312~0.base_11|) |v_ULTIMATE.start_main_~#t312~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t312~0.offset_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11| 1)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t312~0.base_11|) 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t312~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t312~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t312~0.base=|v_ULTIMATE.start_main_~#t312~0.base_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t312~0.offset=|v_ULTIMATE.start_main_~#t312~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t312~0.base, #length, ULTIMATE.start_main_~#t312~0.offset] because there is no mapped edge [2019-12-18 16:23:46,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_6|) (= 1 v_~x$w_buff0~0_24) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_123) (= v_~x$w_buff0~0_25 v_~x$w_buff1~0_31) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| 1) (= v_~x$w_buff1_used~0_76 v_~x$w_buff0_used~0_124) (= 0 (mod v_~x$w_buff1_used~0_76 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_6| v_P1Thread1of1ForFork1_~arg.offset_6)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_25, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_24, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_6|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 16:23:46,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-558295592 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-558295592 256) 0))) (or (and (not .cse0) (= ~x$w_buff0~0_In-558295592 |P1Thread1of1ForFork1_#t~ite28_Out-558295592|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-558295592| ~x$w_buff1~0_In-558295592)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-558295592, ~x$w_buff1~0=~x$w_buff1~0_In-558295592, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-558295592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-558295592} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-558295592, ~x$w_buff1~0=~x$w_buff1~0_In-558295592, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-558295592, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-558295592|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-558295592} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:23:46,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_35 |v_P1Thread1of1ForFork1_#t~ite28_14|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_14|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_13|, ~x~0=v_~x~0_35, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:23:46,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_206 v_~x$r_buff0_thd2~0_205) (not (= 0 (mod v_~weak$$choice2~0_111 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~weak$$choice2~0=v_~weak$$choice2~0_111} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_13|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_10|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_12|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_111} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:23:46,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1480329581 256)))) (or (and .cse0 (= ~x~0_In-1480329581 |P1Thread1of1ForFork1_#t~ite48_Out-1480329581|)) (and (= ~x$mem_tmp~0_In-1480329581 |P1Thread1of1ForFork1_#t~ite48_Out-1480329581|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1480329581, ~x$mem_tmp~0=~x$mem_tmp~0_In-1480329581, ~x~0=~x~0_In-1480329581} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1480329581, ~x$mem_tmp~0=~x$mem_tmp~0_In-1480329581, ~x~0=~x~0_In-1480329581, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1480329581|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 16:23:46,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-721033054 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out-721033054| ~x~0_In-721033054) .cse0) (and (= |P0Thread1of1ForFork0_#t~ite25_Out-721033054| ~x$mem_tmp~0_In-721033054) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-721033054, ~x$mem_tmp~0=~x$mem_tmp~0_In-721033054, ~x~0=~x~0_In-721033054} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-721033054|, ~x$flush_delayed~0=~x$flush_delayed~0_In-721033054, ~x$mem_tmp~0=~x$mem_tmp~0_In-721033054, ~x~0=~x~0_In-721033054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 16:23:46,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite25_20| v_~x~0_109) (= v_~x$flush_delayed~0_78 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 16:23:46,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In552059699 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In552059699 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out552059699| ~x$w_buff0_used~0_In552059699)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out552059699| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In552059699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In552059699} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out552059699|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In552059699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In552059699} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 16:23:46,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In382017919 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In382017919 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In382017919 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In382017919 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out382017919| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite52_Out382017919| ~x$w_buff1_used~0_In382017919) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In382017919, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In382017919, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In382017919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In382017919} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out382017919|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In382017919, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In382017919, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In382017919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In382017919} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 16:23:46,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-537493259 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-537493259 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-537493259 ~x$r_buff0_thd2~0_Out-537493259)) (and (= 0 ~x$r_buff0_thd2~0_Out-537493259) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-537493259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-537493259} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-537493259|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-537493259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-537493259} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 16:23:46,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-248565567 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-248565567 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-248565567 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-248565567 256)))) (or (and (= ~x$r_buff1_thd2~0_In-248565567 |P1Thread1of1ForFork1_#t~ite54_Out-248565567|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-248565567|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-248565567, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-248565567, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-248565567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-248565567} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-248565567, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-248565567, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-248565567|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-248565567, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-248565567} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 16:23:46,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$r_buff1_thd2~0_141 |v_P1Thread1of1ForFork1_#t~ite54_20|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_19|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 16:23:46,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~x$w_buff0_used~0_229 256)) (= (mod v_~x$r_buff0_thd0~0_27 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:23:46,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1488484322 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1488484322 256)))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out-1488484322| ~x$w_buff1~0_In-1488484322) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1488484322| ~x~0_In-1488484322) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1488484322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488484322, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488484322, ~x~0=~x~0_In-1488484322} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1488484322, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1488484322|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1488484322, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1488484322, ~x~0=~x~0_In-1488484322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 16:23:46,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_76 |v_ULTIMATE.start_main_#t~ite57_12|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~x~0=v_~x~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-18 16:23:46,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-935620169 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-935620169 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-935620169|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-935620169 |ULTIMATE.start_main_#t~ite59_Out-935620169|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-935620169, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-935620169} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-935620169, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-935620169|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-935620169} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 16:23:46,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1176870230 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1176870230 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1176870230 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1176870230 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1176870230|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1176870230 |ULTIMATE.start_main_#t~ite60_Out-1176870230|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1176870230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1176870230, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1176870230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1176870230} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1176870230, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1176870230|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1176870230, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1176870230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1176870230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 16:23:46,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1133740192 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1133740192 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1133740192| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1133740192| ~x$r_buff0_thd0~0_In-1133740192)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1133740192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1133740192} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1133740192, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1133740192|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1133740192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 16:23:46,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1421393158 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1421393158 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1421393158 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1421393158 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-1421393158| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1421393158| ~x$r_buff1_thd0~0_In-1421393158) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1421393158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1421393158, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1421393158, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1421393158} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1421393158|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1421393158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1421393158, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1421393158, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1421393158} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 16:23:46,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~x$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite62_47|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_35 0) (= 1 v_~__unbuffered_p1_EAX~0_36)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_171, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:23:46,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:23:46 BasicIcfg [2019-12-18 16:23:46,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:23:46,597 INFO L168 Benchmark]: Toolchain (without parser) took 40892.03 ms. Allocated memory was 137.4 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 100.5 MB in the beginning and 778.5 MB in the end (delta: -678.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,597 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.35 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 155.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.04 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,599 INFO L168 Benchmark]: Boogie Preprocessor took 39.29 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,599 INFO L168 Benchmark]: RCFGBuilder took 916.63 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 97.1 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,600 INFO L168 Benchmark]: TraceAbstraction took 38985.97 ms. Allocated memory was 202.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 96.4 MB in the beginning and 778.5 MB in the end (delta: -682.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 16:23:46,606 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.53 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.35 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 155.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.04 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.29 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.63 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 97.1 MB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38985.97 ms. Allocated memory was 202.4 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 96.4 MB in the beginning and 778.5 MB in the end (delta: -682.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 178 ProgramPointsBefore, 103 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 29 ChoiceCompositions, 8870 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 290 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 122314 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t311, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 38.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3787 SDtfs, 3652 SDslu, 6329 SDs, 0 SdLazy, 3152 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61307occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 47738 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 82611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...