java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:06:16,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:06:16,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:06:16,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:06:16,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:06:16,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:06:16,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:06:16,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:06:16,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:06:16,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:06:16,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:06:16,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:06:16,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:06:16,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:06:16,513 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:06:16,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:06:16,515 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:06:16,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:06:16,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:06:16,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:06:16,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:06:16,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:06:16,526 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:06:16,526 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:06:16,526 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:06:16,527 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:06:16,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:06:16,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:06:16,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:06:16,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:06:16,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:06:16,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:06:16,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:06:16,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:06:16,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:06:16,542 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:06:16,542 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:06:16,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:06:16,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:06:16,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:06:16,562 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:06:16,562 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:06:16,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:06:16,563 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:06:16,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:06:16,563 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:06:16,563 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:06:16,564 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:06:16,564 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:06:16,564 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:06:16,564 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:06:16,564 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:06:16,565 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:06:16,565 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:06:16,565 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:06:16,565 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:06:16,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:06:16,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:06:16,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:06:16,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:06:16,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:06:16,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:06:16,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:06:16,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:06:16,567 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:06:16,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:06:16,567 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:06:16,567 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:06:16,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:06:16,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:06:16,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:06:16,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:06:16,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:06:16,649 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:06:16,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-09-19 16:06:17,019 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff56bd799/094d762dd53d4084a0452cf7fa1aa0f2/FLAGac8e3413e [2018-09-19 16:06:17,228 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:06:17,229 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0730c_true-unreach-call.c [2018-09-19 16:06:17,238 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff56bd799/094d762dd53d4084a0452cf7fa1aa0f2/FLAGac8e3413e [2018-09-19 16:06:17,254 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff56bd799/094d762dd53d4084a0452cf7fa1aa0f2 [2018-09-19 16:06:17,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:06:17,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:06:17,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:06:17,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:06:17,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:06:17,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d956bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17, skipping insertion in model container [2018-09-19 16:06:17,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,292 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:06:17,634 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:06:17,657 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:06:17,707 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:06:17,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17 WrapperNode [2018-09-19 16:06:17,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:06:17,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:06:17,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:06:17,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:06:17,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (1/1) ... [2018-09-19 16:06:17,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:06:17,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:06:17,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:06:17,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:06:17,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (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 [2018-09-19 16:06:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:06:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:06:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-19 16:06:17,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-19 16:06:17,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:06:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:06:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:06:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-19 16:06:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:06:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:06:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:06:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:06:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:06:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:06:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-19 16:06:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:06:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:06:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:06:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:06:17,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:06:18,202 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:06:18,238 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:06:18,582 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:06:18,606 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:06:18,638 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:06:22,359 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:06:22,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:06:22 BoogieIcfgContainer [2018-09-19 16:06:22,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:06:22,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:06:22,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:06:22,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:06:22,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:06:17" (1/3) ... [2018-09-19 16:06:22,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76949e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:06:22, skipping insertion in model container [2018-09-19 16:06:22,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:06:17" (2/3) ... [2018-09-19 16:06:22,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76949e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:06:22, skipping insertion in model container [2018-09-19 16:06:22,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:06:22" (3/3) ... [2018-09-19 16:06:22,369 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730c_true-unreach-call.c [2018-09-19 16:06:22,379 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:06:22,389 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:06:22,443 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:06:22,444 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:06:22,445 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:06:22,445 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:06:22,445 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:06:22,445 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:06:22,446 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:06:22,446 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:06:22,446 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:06:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-09-19 16:06:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-19 16:06:22,494 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:22,495 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:06:22,497 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1374597462, now seen corresponding path program 1 times [2018-09-19 16:06:22,507 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:22,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:22,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:22,965 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:22,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:06:22,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:06:22,984 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:06:22,985 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:06:22,987 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 2 states. [2018-09-19 16:06:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:23,025 INFO L93 Difference]: Finished difference Result 192 states and 255 transitions. [2018-09-19 16:06:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:06:23,027 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-09-19 16:06:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:23,040 INFO L225 Difference]: With dead ends: 192 [2018-09-19 16:06:23,040 INFO L226 Difference]: Without dead ends: 96 [2018-09-19 16:06:23,045 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:06:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-19 16:06:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-19 16:06:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-19 16:06:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2018-09-19 16:06:23,098 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 16 [2018-09-19 16:06:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2018-09-19 16:06:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:06:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-09-19 16:06:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-19 16:06:23,100 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:23,100 INFO L376 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] [2018-09-19 16:06:23,101 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1447842776, now seen corresponding path program 1 times [2018-09-19 16:06:23,102 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:23,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:23,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:23,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:23,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:06:23,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:06:23,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:23,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:23,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:23,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:23,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:06:23,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:06:23,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:23,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:23,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:23,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:24,278 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:24,299 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:24,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:06:24,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:06:24,302 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:06:24,303 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:06:24,303 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand 8 states. [2018-09-19 16:06:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:32,313 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-09-19 16:06:32,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:06:32,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-09-19 16:06:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:32,324 INFO L225 Difference]: With dead ends: 128 [2018-09-19 16:06:32,324 INFO L226 Difference]: Without dead ends: 105 [2018-09-19 16:06:32,326 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:06:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-19 16:06:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2018-09-19 16:06:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-19 16:06:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 115 transitions. [2018-09-19 16:06:32,340 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 115 transitions. Word has length 29 [2018-09-19 16:06:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:32,341 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 115 transitions. [2018-09-19 16:06:32,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:06:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2018-09-19 16:06:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 16:06:32,342 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:32,343 INFO L376 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] [2018-09-19 16:06:32,343 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1588044780, now seen corresponding path program 1 times [2018-09-19 16:06:32,344 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:06:32,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:32,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:32,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:32,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:32,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:06:32,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:06:32,537 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:06:32,537 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:06:32,538 INFO L87 Difference]: Start difference. First operand 96 states and 115 transitions. Second operand 7 states. [2018-09-19 16:06:32,923 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-19 16:06:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:36,476 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-09-19 16:06:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:06:36,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-09-19 16:06:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:36,478 INFO L225 Difference]: With dead ends: 103 [2018-09-19 16:06:36,478 INFO L226 Difference]: Without dead ends: 100 [2018-09-19 16:06:36,479 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:06:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-19 16:06:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-19 16:06:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-19 16:06:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-09-19 16:06:36,491 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 31 [2018-09-19 16:06:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:36,492 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-09-19 16:06:36,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:06:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-09-19 16:06:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-19 16:06:36,493 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:36,494 INFO L376 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] [2018-09-19 16:06:36,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:36,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1854185662, now seen corresponding path program 1 times [2018-09-19 16:06:36,495 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:36,495 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:36,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:37,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:37,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:06:37,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:06:37,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:37,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:37,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:06:37,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:06:37,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:37,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:37,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:37,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:37,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:06:37,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:06:37,703 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:06:37,703 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:06:37,703 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 8 states. [2018-09-19 16:06:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:44,278 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2018-09-19 16:06:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:06:44,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-09-19 16:06:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:44,281 INFO L225 Difference]: With dead ends: 130 [2018-09-19 16:06:44,281 INFO L226 Difference]: Without dead ends: 107 [2018-09-19 16:06:44,283 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:06:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-19 16:06:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2018-09-19 16:06:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-19 16:06:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2018-09-19 16:06:44,297 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 32 [2018-09-19 16:06:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:44,297 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2018-09-19 16:06:44,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:06:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2018-09-19 16:06:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-19 16:06:44,299 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:44,300 INFO L376 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] [2018-09-19 16:06:44,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1175923215, now seen corresponding path program 1 times [2018-09-19 16:06:44,301 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:44,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:44,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:44,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:44,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:06:44,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:06:44,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:44,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:44,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:44,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:44,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:06:44,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:06:44,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:44,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:44,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:44,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:45,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:45,075 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:45,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 16:06:45,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:06:45,076 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:06:45,077 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:06:45,077 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand 14 states. [2018-09-19 16:06:46,840 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-19 16:06:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:47,284 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2018-09-19 16:06:47,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:06:47,285 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-09-19 16:06:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:47,288 INFO L225 Difference]: With dead ends: 105 [2018-09-19 16:06:47,288 INFO L226 Difference]: Without dead ends: 96 [2018-09-19 16:06:47,289 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-09-19 16:06:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-19 16:06:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-19 16:06:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-19 16:06:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2018-09-19 16:06:47,303 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 47 [2018-09-19 16:06:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:47,303 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2018-09-19 16:06:47,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:06:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2018-09-19 16:06:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-19 16:06:47,306 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:47,306 INFO L376 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] [2018-09-19 16:06:47,306 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2066914366, now seen corresponding path program 1 times [2018-09-19 16:06:47,307 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:47,307 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:47,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:47,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:47,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:06:47,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:06:47,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:47,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:47,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:47,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:47,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:06:47,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:06:47,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:47,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:47,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:47,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:48,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:48,021 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:48,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:06:48,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:06:48,022 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:06:48,024 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:06:48,025 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand 8 states. [2018-09-19 16:06:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:50,312 INFO L93 Difference]: Finished difference Result 224 states and 275 transitions. [2018-09-19 16:06:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:06:50,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-09-19 16:06:50,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:50,316 INFO L225 Difference]: With dead ends: 224 [2018-09-19 16:06:50,317 INFO L226 Difference]: Without dead ends: 103 [2018-09-19 16:06:50,319 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:06:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-19 16:06:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-09-19 16:06:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-19 16:06:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-09-19 16:06:50,334 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 57 [2018-09-19 16:06:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:50,334 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-09-19 16:06:50,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:06:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-09-19 16:06:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-19 16:06:50,336 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:50,337 INFO L376 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] [2018-09-19 16:06:50,337 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1537492296, now seen corresponding path program 1 times [2018-09-19 16:06:50,338 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:50,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:50,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:50,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:06:50,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:06:50,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:50,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:50,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:50,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:50,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:06:50,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:06:50,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:50,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:50,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:06:50,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:06:50,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:50,891 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:50,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:06:50,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:06:50,892 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:06:50,892 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:06:50,893 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 9 states. [2018-09-19 16:06:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:53,641 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2018-09-19 16:06:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:06:53,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-09-19 16:06:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:53,644 INFO L225 Difference]: With dead ends: 168 [2018-09-19 16:06:53,644 INFO L226 Difference]: Without dead ends: 105 [2018-09-19 16:06:53,645 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:06:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-19 16:06:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-09-19 16:06:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-19 16:06:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-09-19 16:06:53,659 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 59 [2018-09-19 16:06:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:53,659 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-09-19 16:06:53,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:06:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2018-09-19 16:06:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-19 16:06:53,662 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:53,662 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:06:53,663 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash -870056175, now seen corresponding path program 1 times [2018-09-19 16:06:53,664 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:53,664 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:53,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:53,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-19 16:06:53,784 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:53,795 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:53,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:06:53,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:06:53,797 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:06:53,797 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:06:53,797 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand 3 states. [2018-09-19 16:06:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:53,894 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2018-09-19 16:06:53,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:06:53,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-09-19 16:06:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:53,902 INFO L225 Difference]: With dead ends: 159 [2018-09-19 16:06:53,902 INFO L226 Difference]: Without dead ends: 105 [2018-09-19 16:06:53,903 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:06:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-19 16:06:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-09-19 16:06:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-19 16:06:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2018-09-19 16:06:53,913 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 67 [2018-09-19 16:06:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2018-09-19 16:06:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:06:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2018-09-19 16:06:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 16:06:53,918 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:53,918 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:06:53,918 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1969320889, now seen corresponding path program 1 times [2018-09-19 16:06:53,919 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:53,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:54,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-19 16:06:54,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:54,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:54,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 16:06:54,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:06:54,244 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:06:54,245 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:06:54,246 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 6 states. [2018-09-19 16:06:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:55,558 INFO L93 Difference]: Finished difference Result 167 states and 197 transitions. [2018-09-19 16:06:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 16:06:55,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-09-19 16:06:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:55,562 INFO L225 Difference]: With dead ends: 167 [2018-09-19 16:06:55,562 INFO L226 Difference]: Without dead ends: 109 [2018-09-19 16:06:55,563 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:06:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-19 16:06:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-19 16:06:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-19 16:06:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2018-09-19 16:06:55,573 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 71 [2018-09-19 16:06:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:55,573 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2018-09-19 16:06:55,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:06:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-09-19 16:06:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 16:06:55,575 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:55,575 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:06:55,576 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1946688635, now seen corresponding path program 1 times [2018-09-19 16:06:55,576 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:55,577 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:55,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:55,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-19 16:06:55,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:06:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-19 16:06:55,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:06:55,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-19 16:06:55,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:06:55,825 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:06:55,825 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:06:55,825 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand 6 states. [2018-09-19 16:06:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:55,950 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2018-09-19 16:06:55,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 16:06:55,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-09-19 16:06:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:55,954 INFO L225 Difference]: With dead ends: 173 [2018-09-19 16:06:55,954 INFO L226 Difference]: Without dead ends: 119 [2018-09-19 16:06:55,955 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:06:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-19 16:06:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-19 16:06:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-19 16:06:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2018-09-19 16:06:55,966 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 71 [2018-09-19 16:06:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:55,966 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2018-09-19 16:06:55,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:06:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2018-09-19 16:06:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-19 16:06:55,968 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:55,969 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:06:55,969 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1688735885, now seen corresponding path program 1 times [2018-09-19 16:06:55,970 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:55,970 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:55,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:56,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:56,654 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-19 16:06:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-19 16:06:57,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:06:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-19 16:06:59,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:06:59,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-09-19 16:06:59,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-19 16:06:59,343 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-19 16:06:59,344 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-09-19 16:06:59,344 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 22 states. [2018-09-19 16:07:06,955 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-09-19 16:07:09,810 WARN L178 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2018-09-19 16:07:10,316 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-09-19 16:07:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:13,038 INFO L93 Difference]: Finished difference Result 200 states and 236 transitions. [2018-09-19 16:07:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-19 16:07:13,040 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 83 [2018-09-19 16:07:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:13,043 INFO L225 Difference]: With dead ends: 200 [2018-09-19 16:07:13,043 INFO L226 Difference]: Without dead ends: 131 [2018-09-19 16:07:13,044 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2018-09-19 16:07:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-19 16:07:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-19 16:07:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-19 16:07:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 150 transitions. [2018-09-19 16:07:13,057 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 150 transitions. Word has length 83 [2018-09-19 16:07:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:13,057 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 150 transitions. [2018-09-19 16:07:13,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-19 16:07:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 150 transitions. [2018-09-19 16:07:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-19 16:07:13,059 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:13,059 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:07:13,059 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 532615159, now seen corresponding path program 2 times [2018-09-19 16:07:13,060 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:13,060 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:07:13,070 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 16:07:13,168 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-19 16:07:13,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 16:07:13,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-09-19 16:07:13,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:07:13,259 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:07:13,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:07:13,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:07:13,260 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:07:13,260 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:07:13,261 INFO L87 Difference]: Start difference. First operand 131 states and 150 transitions. Second operand 4 states. [2018-09-19 16:07:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:13,423 INFO L93 Difference]: Finished difference Result 184 states and 213 transitions. [2018-09-19 16:07:13,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:07:13,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-09-19 16:07:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:13,426 INFO L225 Difference]: With dead ends: 184 [2018-09-19 16:07:13,427 INFO L226 Difference]: Without dead ends: 139 [2018-09-19 16:07:13,427 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:07:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-19 16:07:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-09-19 16:07:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-19 16:07:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2018-09-19 16:07:13,440 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 83 [2018-09-19 16:07:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:13,440 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2018-09-19 16:07:13,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:07:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-09-19 16:07:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:07:13,442 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:13,442 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:07:13,442 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1660890545, now seen corresponding path program 1 times [2018-09-19 16:07:13,443 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:13,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:07:13,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-19 16:07:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:07:13,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-19 16:07:13,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:07:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-19 16:07:13,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:07:13,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-19 16:07:13,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 16:07:13,789 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 16:07:13,789 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:07:13,790 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 12 states. [2018-09-19 16:07:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:14,119 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2018-09-19 16:07:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:07:14,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-09-19 16:07:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:14,127 INFO L225 Difference]: With dead ends: 213 [2018-09-19 16:07:14,127 INFO L226 Difference]: Without dead ends: 157 [2018-09-19 16:07:14,128 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:07:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-19 16:07:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-19 16:07:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-19 16:07:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2018-09-19 16:07:14,143 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 87 [2018-09-19 16:07:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:14,144 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2018-09-19 16:07:14,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 16:07:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2018-09-19 16:07:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-19 16:07:14,145 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:14,146 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:07:14,146 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1999607871, now seen corresponding path program 2 times [2018-09-19 16:07:14,147 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-19 16:07:14,151 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-19 16:07:14,273 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-19 16:07:14,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-19 16:07:14,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:14,415 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:07:14,416 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:07:14,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-09-19 16:07:14,427 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:07:14,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:07:14,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:14,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:14,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:07:14,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-09-19 16:07:14,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-09-19 16:07:14,697 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:07:14,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-09-19 16:07:14,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:14,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:14,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:07:14,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:37 [2018-09-19 16:07:16,861 WARN L178 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:07:16,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-09-19 16:07:16,889 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:07:16,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-09-19 16:07:16,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:16,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:16,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:07:16,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:23 [2018-09-19 16:07:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-09-19 16:07:17,254 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:07:17,264 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:07:17,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:07:17,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:07:17,265 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:07:17,265 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:07:17,266 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 11 states. [2018-09-19 16:07:20,424 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 16:07:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:23,247 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-09-19 16:07:23,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:07:23,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2018-09-19 16:07:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:23,250 INFO L225 Difference]: With dead ends: 157 [2018-09-19 16:07:23,250 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:07:23,251 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:07:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:07:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:07:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:07:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:07:23,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2018-09-19 16:07:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:23,252 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:07:23,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:07:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:07:23,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:07:23,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:07:23,616 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-19 16:07:23,830 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-19 16:07:23,983 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtENTRY(lines 19 127) the Hoare annotation is: true [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtFINAL(lines 19 127) no Hoare annotation was computed. [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point L85-2(lines 85 94) no Hoare annotation was computed. [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point L44(lines 44 55) no Hoare annotation was computed. [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point L44-2(lines 44 55) no Hoare annotation was computed. [2018-09-19 16:07:23,983 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L36(lines 36 41) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L69-1(lines 69 79) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L36-2(lines 36 41) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L422 ceAbstractionStarter]: At program point L69-3(lines 69 79) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv20 32)))) (= |__ieee754_sqrt_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|)))))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))))) [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L69-4(lines 69 79) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L28-2(line 28) no Hoare annotation was computed. [2018-09-19 16:07:23,984 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 45 49) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L422 ceAbstractionStarter]: At program point L45-3(lines 45 49) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_9|) __ieee754_sqrt_~ix0~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|))) (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))))) [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L45-4(lines 45 49) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L29-3(line 29) no Hoare annotation was computed. [2018-09-19 16:07:23,985 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 88) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L120-1(lines 120 125) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L87-2(lines 87 88) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L422 ceAbstractionStarter]: At program point L120-3(lines 120 125) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv20 32)))) (= |__ieee754_sqrt_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|)))))))) [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L120-4(lines 120 125) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L104(lines 104 112) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L71(lines 71 75) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L71-2(lines 71 75) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L121-1(line 121) no Hoare annotation was computed. [2018-09-19 16:07:23,986 INFO L426 ceAbstractionStarter]: For program point L121-2(line 121) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L121-3(line 121) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtEXIT(lines 19 127) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L90-2(lines 90 91) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L82-1(lines 82 98) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L422 ceAbstractionStarter]: At program point L82-3(lines 82 98) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_10| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_10|) (_ bv20 32)))) (= |__ieee754_sqrt_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_10|) ((_ extract 62 52) |v_q#valueAsBitvector_10|) ((_ extract 51 0) |v_q#valueAsBitvector_10|)))))))) [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L82-4(lines 19 127) no Hoare annotation was computed. [2018-09-19 16:07:23,987 INFO L426 ceAbstractionStarter]: For program point L107(lines 107 112) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L58(lines 58 61) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L124-2(line 124) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L124-3(line 124) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L25-1(lines 25 30) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L58-2(lines 58 61) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L422 ceAbstractionStarter]: At program point L25-3(lines 25 30) the Hoare annotation is: (and (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|) (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L25-4(lines 19 127) no Hoare annotation was computed. [2018-09-19 16:07:23,988 INFO L426 ceAbstractionStarter]: For program point L50-1(lines 50 51) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L50-3(lines 50 51) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L422 ceAbstractionStarter]: At program point L50-4(lines 50 51) the Hoare annotation is: (let ((.cse0 (= __ieee754_sqrt_~x |__ieee754_sqrt_#in~x|))) (or (and .cse0 (= (bvadd __ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((|v_q#valueAsBitvector_11| (_ BitVec 64))) (and (not (= (bvor (bvand ((_ extract 63 32) |v_q#valueAsBitvector_11|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_11|)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_11|) ((_ extract 62 52) |v_q#valueAsBitvector_11|) ((_ extract 51 0) |v_q#valueAsBitvector_11|)) |__ieee754_sqrt_#in~x|)))) (and .cse0 (exists ((|v_q#valueAsBitvector_9| (_ BitVec 64))) (and (not (bvsle ((_ extract 63 32) |v_q#valueAsBitvector_9|) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_9|) ((_ extract 62 52) |v_q#valueAsBitvector_9|) ((_ extract 51 0) |v_q#valueAsBitvector_9|)) |__ieee754_sqrt_#in~x|)))))) [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L50-5(lines 50 51) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L108(lines 108 109) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L108-2(lines 108 109) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L100(lines 100 114) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-09-19 16:07:23,989 INFO L426 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point L117(lines 117 118) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point L117-2(lines 117 118) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L422 ceAbstractionStarter]: At program point L132-3(lines 132 136) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point L132-4(lines 132 136) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 129 139) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 129 139) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 129 139) the Hoare annotation is: true [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-19 16:07:23,990 INFO L426 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L135-2(line 135) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L133-1(line 133) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L133-2(line 133) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 132 136) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L133-3(line 133) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 16:07:23,991 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:07:23,991 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 141 159) the Hoare annotation is: true [2018-09-19 16:07:23,991 INFO L426 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 141 159) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L422 ceAbstractionStarter]: At program point L153-1(line 153) the Hoare annotation is: (and (= (_ +zero 11 53) main_~x~0) (= (_ +zero 11 53) main_~res~0) |main_#t~short11|) [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point L153-2(line 153) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L422 ceAbstractionStarter]: At program point L150(line 150) the Hoare annotation is: (= (_ +zero 11 53) main_~x~0) [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point L153-4(lines 153 156) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 141 159) no Hoare annotation was computed. [2018-09-19 16:07:23,992 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-09-19 16:07:23,998 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,000 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,001 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,002 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,010 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,011 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,012 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,014 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,015 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,016 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,018 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,019 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,020 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,021 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,022 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,023 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,024 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,025 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,026 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,028 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,029 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,030 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,032 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,033 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,034 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,035 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,036 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,037 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,038 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,039 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,040 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:07:24 BoogieIcfgContainer [2018-09-19 16:07:24,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:07:24,044 INFO L168 Benchmark]: Toolchain (without parser) took 66778.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 868.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -300.3 MB). Peak memory consumption was 568.5 MB. Max. memory is 7.1 GB. [2018-09-19 16:07:24,045 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:07:24,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:07:24,047 INFO L168 Benchmark]: Boogie Preprocessor took 71.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:07:24,047 INFO L168 Benchmark]: RCFGBuilder took 4533.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.0 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:07:24,048 INFO L168 Benchmark]: TraceAbstraction took 61682.00 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 151.0 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 440.2 MB). Peak memory consumption was 591.2 MB. Max. memory is 7.1 GB. [2018-09-19 16:07:24,052 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 484.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4533.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -751.0 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61682.00 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 151.0 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 440.2 MB). Peak memory consumption was 591.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 120]: Loop Invariant [2018-09-19 16:07:24,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,066 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,067 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,068 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,069 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,070 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,071 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,072 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] Derived loop invariant: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x)))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 45]: Loop Invariant [2018-09-19 16:07:24,073 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,074 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,075 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,076 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,077 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,078 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,079 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: ((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || ((x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: v_q#valueAsBitvector_9[63:32] == ix0 && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) - InvariantResult [Line: 82]: Loop Invariant [2018-09-19 16:07:24,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,080 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,081 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,082 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,083 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,084 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] Derived loop invariant: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x)))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0]))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 69]: Loop Invariant [2018-09-19 16:07:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,086 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,087 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,088 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,089 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_10,QUANTIFIED] [2018-09-19 16:07:24,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,090 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,091 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: (((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_10 : bv64 :: !(0bv32 == ~bvashr32(v_q#valueAsBitvector_10[63:32], 20bv32)) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_10[63:63], v_q#valueAsBitvector_10[62:52], v_q#valueAsBitvector_10[51:0])))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) - InvariantResult [Line: 50]: Loop Invariant [2018-09-19 16:07:24,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,092 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_11,QUANTIFIED] [2018-09-19 16:07:24,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] [2018-09-19 16:07:24,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_9,QUANTIFIED] Derived loop invariant: ((x == \old(x) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_q#valueAsBitvector_11 : bv64 :: !(~bvor32(~bvand32(v_q#valueAsBitvector_11[63:32], 2147483647bv32), v_q#valueAsBitvector_11[31:0]) == 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_11[63:63], v_q#valueAsBitvector_11[62:52], v_q#valueAsBitvector_11[51:0]) == \old(x))) || (x == \old(x) && (\exists v_q#valueAsBitvector_9 : bv64 :: !~bvsle32(v_q#valueAsBitvector_9[63:32], 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_9[63:63], v_q#valueAsBitvector_9[62:52], v_q#valueAsBitvector_9[51:0]) == \old(x))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 100 locations, 1 error locations. SAFE Result, 61.5s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 47.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1407 SDtfs, 1138 SDslu, 5530 SDs, 0 SdLazy, 1857 SolverSat, 133 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 33.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1137 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 39 PreInvPairs, 73 NumberOfFragments, 365 HoareAnnotationTreeSize, 39 FomulaSimplifications, 2171 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 844 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1068 ConstructedInterpolants, 251 QuantifiedInterpolants, 531784 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1572 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 308/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...