java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/filter2_set.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:32:54,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:32:54,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:32:54,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:32:54,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:32:54,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:32:54,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:32:54,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:32:54,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:32:54,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:32:54,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:32:54,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:32:54,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:32:54,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:32:54,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:32:54,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:32:54,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:32:54,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:32:54,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:32:54,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:32:54,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:32:54,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:32:54,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:32:54,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:32:54,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:32:54,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:32:54,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:32:54,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:32:54,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:32:54,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:32:54,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:32:54,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:32:54,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:32:54,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:32:54,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:32:54,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:32:54,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:32:54,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:32:54,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:32:54,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:32:54,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:32:54,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:32:54,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:32:54,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:32:54,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:32:54,467 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:32:54,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:32:54,468 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:32:54,468 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:32:54,468 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:32:54,469 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:32:54,469 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:32:54,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:32:54,470 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:32:54,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:32:54,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:32:54,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:32:54,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:32:54,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:32:54,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:32:54,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:32:54,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:32:54,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:32:54,472 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:32:54,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:32:54,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:32:54,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:32:54,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:32:54,473 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:32:54,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:32:54,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:32:54,473 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:32:54,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:32:54,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:32:54,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:32:54,530 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:32:54,530 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:32:54,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter2_set.c [2019-09-10 01:32:54,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1c135a9/a6f86cabc1c945d9992f20c7f3462a7f/FLAGcc168d286 [2019-09-10 01:32:55,042 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:32:55,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter2_set.c [2019-09-10 01:32:55,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1c135a9/a6f86cabc1c945d9992f20c7f3462a7f/FLAGcc168d286 [2019-09-10 01:32:55,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af1c135a9/a6f86cabc1c945d9992f20c7f3462a7f [2019-09-10 01:32:55,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:32:55,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:32:55,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:32:55,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:32:55,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:32:55,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b533bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55, skipping insertion in model container [2019-09-10 01:32:55,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,479 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:32:55,498 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:32:55,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:32:55,712 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:32:55,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:32:55,856 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:32:55,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55 WrapperNode [2019-09-10 01:32:55,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:32:55,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:32:55,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:32:55,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:32:55,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... [2019-09-10 01:32:55,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:32:55,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:32:55,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:32:55,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:32:55,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:32:55,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:32:55,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:32:55,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-10 01:32:55,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:32:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:32:55,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:32:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:32:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:32:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:32:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:32:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:32:56,146 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:32:56,146 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 01:32:56,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:32:56 BoogieIcfgContainer [2019-09-10 01:32:56,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:32:56,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:32:56,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:32:56,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:32:56,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:32:55" (1/3) ... [2019-09-10 01:32:56,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4124e2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:32:56, skipping insertion in model container [2019-09-10 01:32:56,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:32:55" (2/3) ... [2019-09-10 01:32:56,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4124e2f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:32:56, skipping insertion in model container [2019-09-10 01:32:56,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:32:56" (3/3) ... [2019-09-10 01:32:56,156 INFO L109 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2019-09-10 01:32:56,166 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:32:56,174 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:32:56,191 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:32:56,218 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:32:56,218 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:32:56,219 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:32:56,219 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:32:56,219 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:32:56,219 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:32:56,219 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:32:56,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:32:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-09-10 01:32:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-10 01:32:56,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:32:56,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:32:56,248 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:32:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:32:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1875203651, now seen corresponding path program 1 times [2019-09-10 01:32:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:32:56,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:56,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:56,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:32:56,340 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:32:56,340 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:32:56,341 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:32:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:56,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:32:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:32:56,393 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:32:56,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:32:56,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:32:56,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:32:56,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:56,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:32:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:32:56,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-10 01:32:56,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:32:56,694 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~A3~0 Real) (main_~A1~0 Real) (main_~B2~0 Real) (main_~A2~0 Real) (main_~E0~0 Real) (main_~E1~0 Real) (main_~B1~0 Real) (main_~E~0 Real)) (and (<= 0.0 main_~E0~0) (<= main_~B1~0 (/ 141.0 100.0)) (<= 0.0 (+ main_~A2~0 (/ 131.0 100.0))) (<= main_~A1~0 (/ 71.0 100.0)) (<= (/ 109.0 100.0) main_~A3~0) (<= main_~A3~0 (/ 111.0 100.0)) (<= main_~E~0 1.0) (<= 0.0 main_~E1~0) (<= main_~E0~0 1.0) (<= (/ 139.0 100.0) main_~B1~0) (= c_main_~S~0 (let ((.cse0 (to_real 0))) (+ (* .cse0 main_~B2~0) (+ (* .cse0 main_~B1~0) (+ (+ (* main_~E~0 main_~A1~0) (- (* main_~A2~0 main_~E0~0))) (* main_~A3~0 main_~E1~0)))))) (<= (/ 69.0 100.0) main_~A1~0) (<= main_~E1~0 1.0) (<= (+ main_~A2~0 (/ 129.0 100.0)) 0.0) (<= 0.0 main_~E~0))) is different from true [2019-09-10 01:32:56,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:32:56,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:32:56,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:56,853 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((main_~B2~0 Real) (v_main_~E~0_7 Real)) (or (< v_main_~E~0_7 0.0) (<= (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* v_main_~E~0_7 c_main_~A1~0)) (* c_main_~A3~0 c_main_~E0~0))) (* main_~B2~0 c_main_~S0~0)) 100.0) (< 1.0 v_main_~E~0_7))) (forall ((main_~B2~0 Real) (v_main_~E~0_7 Real)) (or (< v_main_~E~0_7 0.0) (<= 0.0 (+ 100.0 (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* v_main_~E~0_7 c_main_~A1~0)) (* c_main_~A3~0 c_main_~E0~0))) (* main_~B2~0 c_main_~S0~0)))) (< 1.0 v_main_~E~0_7)))) is different from true [2019-09-10 01:32:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:32:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:32:56,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-10 01:32:56,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:32:56,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:32:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:32:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2019-09-10 01:32:56,913 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 6 states. [2019-09-10 01:32:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:32:56,977 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-09-10 01:32:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:32:56,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-09-10 01:32:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:32:56,991 INFO L225 Difference]: With dead ends: 28 [2019-09-10 01:32:56,992 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:32:56,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2019-09-10 01:32:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:32:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-10 01:32:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:32:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-10 01:32:57,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2019-09-10 01:32:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:32:57,029 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-10 01:32:57,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:32:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-10 01:32:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:32:57,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:32:57,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:32:57,031 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:32:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:32:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1632080392, now seen corresponding path program 1 times [2019-09-10 01:32:57,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:32:57,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:57,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:57,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:32:57,048 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:32:57,048 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:32:57,049 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:32:57,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:57,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:32:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:32:57,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2019-09-10 01:32:57,099 INFO L207 CegarAbsIntRunner]: [0], [4], [12], [15], [21], [24], [26], [29], [31], [32], [33], [34], [36], [37] [2019-09-10 01:32:57,138 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:32:57,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:32:57,214 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:32:57,215 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:32:57,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:32:57,997 INFO L272 AbstractInterpreter]: Visited 14 different actions 69 times. Merged at 3 different actions 19 times. Widened at 1 different actions 3 times. Performed 794 root evaluator evaluations with a maximum evaluation depth of 6. Performed 794 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2019-09-10 01:32:58,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:32:58,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:32:58,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:32:58,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:32:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:58,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:32:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:32:58,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-10 01:32:58,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:32:58,281 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~A3~0 Real) (main_~A1~0 Real) (main_~B2~0 Real) (main_~E0~0 Real) (main_~A2~0 Real) (main_~E1~0 Real) (main_~B1~0 Real) (v_subst_2 Real) (main_~E~0 Real)) (and (<= 0.0 main_~E0~0) (<= main_~B1~0 (/ 141.0 100.0)) (<= 0.0 (+ main_~A2~0 (/ 131.0 100.0))) (<= main_~A1~0 (/ 71.0 100.0)) (<= (/ 109.0 100.0) main_~A3~0) (<= main_~A3~0 (/ 111.0 100.0)) (<= v_subst_2 1.0) (<= main_~E~0 1.0) (<= 0.0 main_~E1~0) (= (let ((.cse1 (to_real 0))) (let ((.cse0 (* .cse1 main_~B2~0))) (+ (+ (* (+ .cse0 (+ (* .cse1 main_~B1~0) (+ (* main_~A3~0 v_subst_2) (+ (* main_~A1~0 main_~E0~0) (- (* main_~A2~0 main_~E1~0)))))) main_~B1~0) (+ (+ (* main_~E~0 main_~A1~0) (- (* main_~A2~0 main_~E0~0))) (* main_~A3~0 main_~E1~0))) .cse0))) c_main_~S~0) (<= main_~E0~0 1.0) (<= (/ 139.0 100.0) main_~B1~0) (<= 0.0 v_subst_2) (<= (/ 69.0 100.0) main_~A1~0) (<= main_~E1~0 1.0) (<= (+ main_~A2~0 (/ 129.0 100.0)) 0.0) (<= 0.0 main_~E~0))) is different from true [2019-09-10 01:32:58,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2019-09-10 01:32:58,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:32:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:58,384 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_11 Real)) (or (<= 0.0 (+ (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_11)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0)) (< 1.0 v_main_~E~0_11) (< v_main_~E~0_11 0.0))) (forall ((v_main_~E~0_11 Real)) (or (< 1.0 v_main_~E~0_11) (<= (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_11)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0) (< v_main_~E~0_11 0.0)))) is different from true [2019-09-10 01:32:58,400 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_11 Real)) (or (<= 0.0 (+ (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_11)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0)) (< 1.0 v_main_~E~0_11) (< v_main_~E~0_11 0.0))) (forall ((v_prenex_1 Real)) (or (<= (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_1)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) 100.0) (< v_prenex_1 0.0) (< 1.0 v_prenex_1)))) is different from true [2019-09-10 01:32:58,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:58,425 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_12 Real) (v_prenex_1 Real) (main_~B2~0 Real)) (or (<= (+ (* c_main_~S~0 main_~B2~0) (+ (+ (+ (- (* c_main_~A2~0 v_main_~E~0_12)) (* c_main_~A1~0 v_prenex_1)) (* c_main_~E~0 c_main_~A3~0)) (* (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_12)) (* c_main_~A3~0 c_main_~E0~0))) (* main_~B2~0 c_main_~S0~0)) c_main_~B1~0))) 100.0) (< v_main_~E~0_12 0.0) (< 1.0 v_main_~E~0_12) (< v_prenex_1 0.0) (< 1.0 v_prenex_1))) (forall ((v_main_~E~0_12 Real) (v_main_~E~0_11 Real) (main_~B2~0 Real)) (or (< 1.0 v_main_~E~0_11) (< v_main_~E~0_12 0.0) (< 1.0 v_main_~E~0_12) (<= 0.0 (+ 100.0 (+ (* c_main_~S~0 main_~B2~0) (+ (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_12)) (* c_main_~A1~0 v_main_~E~0_11))) (* (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_12)) (* c_main_~A3~0 c_main_~E0~0))) (* main_~B2~0 c_main_~S0~0)) c_main_~B1~0))))) (< v_main_~E~0_11 0.0)))) is different from true [2019-09-10 01:32:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-10 01:32:58,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:32:58,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-10 01:32:58,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:32:58,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 01:32:58,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 01:32:58,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=55, Unknown=6, NotChecked=68, Total=156 [2019-09-10 01:32:58,448 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-09-10 01:32:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:32:58,741 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-10 01:32:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:32:58,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-09-10 01:32:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:32:58,743 INFO L225 Difference]: With dead ends: 29 [2019-09-10 01:32:58,744 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 01:32:58,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=94, Unknown=12, NotChecked=92, Total=240 [2019-09-10 01:32:58,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 01:32:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-09-10 01:32:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 01:32:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-10 01:32:58,751 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2019-09-10 01:32:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:32:58,752 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-10 01:32:58,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 01:32:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-10 01:32:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:32:58,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:32:58,754 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:32:58,754 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:32:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:32:58,755 INFO L82 PathProgramCache]: Analyzing trace with hash 282820957, now seen corresponding path program 2 times [2019-09-10 01:32:58,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:32:58,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:58,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:58,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:58,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:32:58,772 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:32:58,772 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:32:58,773 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:32:58,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:32:58,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:32:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:32:58,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:32:58,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:32:58,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:32:58,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:32:58,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:32:58,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:32:58,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:32:58,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:32:58,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-10 01:32:58,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:32:59,223 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~A3~0 Real) (main_~A1~0 Real) (main_~B2~0 Real) (main_~A2~0 Real) (main_~E0~0 Real) (main_~E1~0 Real) (main_~B1~0 Real) (main_~E~0 Real) (v_subst_4 Real) (v_subst_6 Real)) (and (= c_main_~S~0 (let ((.cse2 (to_real 0))) (let ((.cse0 (* .cse2 main_~B2~0))) (let ((.cse1 (+ .cse0 (+ (* .cse2 main_~B1~0) (+ (* main_~A3~0 v_subst_4) (+ (* main_~A1~0 main_~E1~0) (- (* main_~A2~0 v_subst_6)))))))) (+ (+ (* main_~B1~0 (+ .cse0 (+ (+ (* main_~A3~0 v_subst_6) (+ (* main_~A1~0 main_~E0~0) (- (* main_~A2~0 main_~E1~0)))) (* .cse1 main_~B1~0)))) (+ (+ (* main_~E~0 main_~A1~0) (- (* main_~A2~0 main_~E0~0))) (* main_~A3~0 main_~E1~0))) (* .cse1 main_~B2~0)))))) (<= 0.0 main_~E0~0) (<= main_~B1~0 (/ 141.0 100.0)) (<= 0.0 (+ main_~A2~0 (/ 131.0 100.0))) (<= main_~A1~0 (/ 71.0 100.0)) (<= v_subst_4 1.0) (<= (/ 109.0 100.0) main_~A3~0) (<= main_~A3~0 (/ 111.0 100.0)) (<= main_~E~0 1.0) (<= 0.0 main_~E1~0) (<= 0.0 (+ main_~B2~0 (/ 71.0 100.0))) (<= 0.0 v_subst_4) (<= main_~E0~0 1.0) (<= v_subst_6 1.0) (<= (+ main_~B2~0 (/ 69.0 100.0)) 0.0) (<= (/ 139.0 100.0) main_~B1~0) (<= (/ 69.0 100.0) main_~A1~0) (<= main_~E1~0 1.0) (<= 0.0 v_subst_6) (<= (+ main_~A2~0 (/ 129.0 100.0)) 0.0) (<= 0.0 main_~E~0))) is different from true [2019-09-10 01:32:59,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 5 times theorem prover too weak. 4 trivial. 2 not checked. [2019-09-10 01:32:59,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:32:59,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:59,320 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_17 Real)) (or (< 1.0 v_main_~E~0_17) (<= (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_17)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) 100.0) (< v_main_~E~0_17 0.0))) (forall ((v_main_~E~0_17 Real)) (or (< 1.0 v_main_~E~0_17) (<= 0.0 (+ 100.0 (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_17)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)))) (< v_main_~E~0_17 0.0)))) is different from true [2019-09-10 01:32:59,325 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_17 Real)) (or (< 1.0 v_main_~E~0_17) (<= (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_17)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) 100.0) (< v_main_~E~0_17 0.0))) (forall ((v_prenex_2 Real)) (or (< 1.0 v_prenex_2) (<= 0.0 (+ (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_2)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0)) (< v_prenex_2 0.0)))) is different from true [2019-09-10 01:32:59,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:59,344 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Real) (v_main_~E~0_18 Real)) (or (< 1.0 v_main_~E~0_18) (<= 0.0 (+ 100.0 (+ (+ (* (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_18)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (* c_main_~A1~0 v_prenex_2) (- (* c_main_~A2~0 v_main_~E~0_18))))) (* c_main_~S~0 c_main_~B2~0)))) (< 1.0 v_prenex_2) (< v_main_~E~0_18 0.0) (< v_prenex_2 0.0))) (forall ((v_main_~E~0_17 Real) (v_main_~E~0_18 Real)) (or (< 1.0 v_main_~E~0_18) (< 1.0 v_main_~E~0_17) (< v_main_~E~0_18 0.0) (<= (+ (+ (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_18)) (* c_main_~A1~0 v_main_~E~0_17))) (* (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_18)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0)) 100.0) (< v_main_~E~0_17 0.0)))) is different from true [2019-09-10 01:32:59,353 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Real) (v_main_~E~0_18 Real)) (or (< 1.0 v_main_~E~0_18) (<= 0.0 (+ 100.0 (+ (+ (* (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_18)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (* c_main_~A1~0 v_prenex_2) (- (* c_main_~A2~0 v_main_~E~0_18))))) (* c_main_~S~0 c_main_~B2~0)))) (< 1.0 v_prenex_2) (< v_main_~E~0_18 0.0) (< v_prenex_2 0.0))) (forall ((v_prenex_3 Real) (v_main_~E~0_17 Real)) (or (< 1.0 v_main_~E~0_17) (< 1.0 v_prenex_3) (< v_prenex_3 0.0) (<= (+ (+ (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_prenex_3)) (* c_main_~A1~0 v_main_~E~0_17))) (* c_main_~B1~0 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_3)) (* c_main_~A3~0 c_main_~E0~0)))))) (* c_main_~S~0 c_main_~B2~0)) 100.0) (< v_main_~E~0_17 0.0)))) is different from true [2019-09-10 01:32:59,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:32:59,377 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Real) (v_main_~E~0_18 Real) (v_main_~E~0_19 Real)) (or (< 1.0 v_main_~E~0_18) (<= 0.0 (+ (let ((.cse0 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_19)) (* c_main_~A3~0 c_main_~E0~0)))))) (+ (* .cse0 c_main_~B2~0) (+ (+ (+ (* c_main_~A1~0 v_prenex_2) (- (* c_main_~A2~0 v_main_~E~0_18))) (* c_main_~A3~0 v_main_~E~0_19)) (* (+ (+ (* .cse0 c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_19)) (* c_main_~A1~0 v_main_~E~0_18)))) (* c_main_~S~0 c_main_~B2~0)) c_main_~B1~0)))) 100.0)) (< 1.0 v_main_~E~0_19) (< 1.0 v_prenex_2) (< v_main_~E~0_18 0.0) (< v_prenex_2 0.0) (< v_main_~E~0_19 0.0))) (forall ((v_prenex_3 Real) (v_main_~E~0_17 Real) (v_main_~E~0_19 Real)) (or (< 1.0 v_main_~E~0_17) (< 1.0 v_prenex_3) (< 1.0 v_main_~E~0_19) (<= (let ((.cse1 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_19)) (* c_main_~A3~0 c_main_~E0~0)))))) (+ (* .cse1 c_main_~B2~0) (+ (* c_main_~B1~0 (+ (+ (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_19)) (* c_main_~A1~0 v_prenex_3))) (* .cse1 c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0))) (+ (+ (- (* c_main_~A2~0 v_prenex_3)) (* c_main_~A1~0 v_main_~E~0_17)) (* c_main_~A3~0 v_main_~E~0_19))))) 100.0) (< v_prenex_3 0.0) (< v_main_~E~0_17 0.0) (< v_main_~E~0_19 0.0)))) is different from true [2019-09-10 01:32:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2019-09-10 01:32:59,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:32:59,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-10 01:32:59,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:32:59,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 01:32:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 01:32:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=68, Unknown=12, NotChecked=126, Total=240 [2019-09-10 01:32:59,411 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-09-10 01:32:59,606 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2019-09-10 01:33:00,050 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-10 01:33:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:33:00,301 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-10 01:33:00,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:33:00,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-09-10 01:33:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:33:00,303 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:33:00,303 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:33:00,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=54, Invalid=124, Unknown=28, NotChecked=174, Total=380 [2019-09-10 01:33:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:33:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-10 01:33:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:33:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-09-10 01:33:00,311 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2019-09-10 01:33:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:33:00,311 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-09-10 01:33:00,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 01:33:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-09-10 01:33:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:33:00,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:33:00,313 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:33:00,314 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:33:00,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:33:00,314 INFO L82 PathProgramCache]: Analyzing trace with hash 864272984, now seen corresponding path program 3 times [2019-09-10 01:33:00,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:33:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:33:00,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:33:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:33:00,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:33:00,347 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:33:00,347 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:33:00,348 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:33:00,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:33:00,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:33:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:33:00,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:33:00,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:33:00,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:33:00,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:33:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:33:00,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:33:01,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:33:01,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:33:01,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-10 01:33:01,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:33:01,887 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_subst_8 Real) (main_~A3~0 Real) (main_~A1~0 Real) (main_~B2~0 Real) (main_~A2~0 Real) (v_subst_12 Real) (main_~E0~0 Real) (main_~E1~0 Real) (main_~B1~0 Real) (main_~E~0 Real) (v_subst_10 Real)) (and (= c_main_~S~0 (let ((.cse3 (to_real 0))) (let ((.cse2 (* .cse3 main_~B2~0))) (let ((.cse0 (+ (+ (* .cse3 main_~B1~0) (+ (+ (- (* v_subst_10 main_~A2~0)) (* v_subst_12 main_~A1~0)) (* main_~A3~0 v_subst_8))) .cse2))) (let ((.cse1 (+ .cse2 (+ (* main_~B1~0 .cse0) (+ (+ (- (* v_subst_12 main_~A2~0)) (* main_~A1~0 main_~E1~0)) (* v_subst_10 main_~A3~0)))))) (+ (+ (* (+ (* main_~B2~0 .cse0) (+ (+ (+ (* main_~A1~0 main_~E0~0) (- (* main_~A2~0 main_~E1~0))) (* v_subst_12 main_~A3~0)) (* .cse1 main_~B1~0))) main_~B1~0) (+ (+ (* main_~E~0 main_~A1~0) (- (* main_~A2~0 main_~E0~0))) (* main_~A3~0 main_~E1~0))) (* .cse1 main_~B2~0))))))) (<= 0.0 v_subst_8) (<= 0.0 main_~E0~0) (<= main_~B1~0 (/ 141.0 100.0)) (<= 0.0 (+ main_~A2~0 (/ 131.0 100.0))) (<= main_~A1~0 (/ 71.0 100.0)) (<= v_subst_10 1.0) (<= (/ 109.0 100.0) main_~A3~0) (<= main_~A3~0 (/ 111.0 100.0)) (<= main_~E~0 1.0) (<= 0.0 main_~E1~0) (<= v_subst_8 1.0) (<= 0.0 (+ main_~B2~0 (/ 71.0 100.0))) (<= main_~E0~0 1.0) (<= (+ main_~B2~0 (/ 69.0 100.0)) 0.0) (<= (/ 139.0 100.0) main_~B1~0) (<= v_subst_12 1.0) (<= 0.0 v_subst_10) (<= (/ 69.0 100.0) main_~A1~0) (<= main_~E1~0 1.0) (<= (+ main_~A2~0 (/ 129.0 100.0)) 0.0) (<= 0.0 main_~E~0) (<= 0.0 v_subst_12))) is different from true [2019-09-10 01:33:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 4 refuted. 12 times theorem prover too weak. 6 trivial. 3 not checked. [2019-09-10 01:33:01,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:33:01,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:01,989 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_25 Real)) (or (< v_main_~E~0_25 0.0) (<= 0.0 (+ (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0)) (< 1.0 v_main_~E~0_25))) (forall ((v_main_~E~0_25 Real)) (or (< v_main_~E~0_25 0.0) (<= (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0) (< 1.0 v_main_~E~0_25)))) is different from true [2019-09-10 01:33:01,993 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_25 Real)) (or (< v_main_~E~0_25 0.0) (<= 0.0 (+ (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~A3~0 c_main_~E0~0)))) 100.0)) (< 1.0 v_main_~E~0_25))) (forall ((v_prenex_4 Real)) (or (<= (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_4)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)) 100.0) (< 1.0 v_prenex_4) (< v_prenex_4 0.0)))) is different from true [2019-09-10 01:33:02,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,008 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (or (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (<= (+ (+ (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_26)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4)))) (* c_main_~S~0 c_main_~B2~0)) 100.0) (< v_main_~E~0_26 0.0))) (forall ((v_main_~E~0_25 Real) (v_main_~E~0_26 Real)) (or (< v_main_~E~0_25 0.0) (< 1.0 v_main_~E~0_26) (< v_main_~E~0_26 0.0) (< 1.0 v_main_~E~0_25) (<= 0.0 (+ (+ (+ (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_26)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_main_~E~0_25)))) (* c_main_~S~0 c_main_~B2~0)) 100.0))))) is different from true [2019-09-10 01:33:02,016 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (or (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (<= (+ (+ (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_26)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4)))) (* c_main_~S~0 c_main_~B2~0)) 100.0) (< v_main_~E~0_26 0.0))) (forall ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (or (< v_main_~E~0_25 0.0) (<= 0.0 (+ (+ (+ (+ (+ (- (* c_main_~A2~0 v_prenex_5)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~E~0 c_main_~A3~0)) (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_5)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0)) 100.0)) (< v_prenex_5 0.0) (< 1.0 v_prenex_5) (< 1.0 v_main_~E~0_25)))) is different from true [2019-09-10 01:33:02,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,045 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ c_main_~S~0 100.0) 0.0)) (.cse1 (< 100.0 c_main_~S~0))) (and (or .cse0 (forall ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (or (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (<= (+ (+ (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_26)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4)))) (* c_main_~S~0 c_main_~B2~0)) 100.0) (< v_main_~E~0_26 0.0))) .cse1) (or .cse0 .cse1 (forall ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (or (< v_main_~E~0_25 0.0) (<= 0.0 (+ (+ (+ (+ (+ (- (* c_main_~A2~0 v_prenex_5)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~E~0 c_main_~A3~0)) (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_5)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0)) 100.0)) (< v_prenex_5 0.0) (< 1.0 v_prenex_5) (< 1.0 v_main_~E~0_25)))))) is different from true [2019-09-10 01:33:02,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 01:33:02,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 01:33:02,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 01:33:02,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 01:33:02,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:02,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 162 [2019-09-10 01:33:27,352 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 44717 conjuctions. This might take some time... [2019-09-10 01:33:27,655 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 7 conjuctions. [2019-09-10 01:33:27,657 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-09-10 01:33:27,769 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0)))))) (.cse5 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (.cse4 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (.cse1 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0)))))) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (or .cse0 .cse1 .cse2) (or .cse2 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (< (+ v_main_~S~0_BEFORE_CALL_15 100.0) 0.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (< 100.0 v_main_~S~0_BEFORE_CALL_15) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (or .cse0 .cse3) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6))))) .cse2) (or .cse0 .cse4 .cse2) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26)))))) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (or .cse0 .cse2 .cse5) (or .cse0 .cse2 .cse3) (or (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (< (+ v_main_~S~0_BEFORE_CALL_15 100.0) 0.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (< 100.0 v_main_~S~0_BEFORE_CALL_15) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))))) .cse2) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26)))))) (or .cse0 .cse5) (or .cse0 .cse4) (or .cse0 .cse1) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))))) .cse2))) is different from true [2019-09-10 01:33:28,059 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2019-09-10 01:33:35,315 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 162873 conjuctions. This might take some time... [2019-09-10 01:33:37,492 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 26 conjuctions. [2019-09-10 01:33:37,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-09-10 01:33:37,533 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or .cse0 (forall ((v_prenex_14 Real) (v_prenex_13 Real) (v_prenex_12 Real) (v_prenex_11 Real) (v_prenex_18 Real) (v_prenex_17 Real) (v_prenex_16 Real) (v_prenex_15 Real) (v_prenex_10 Real)) (or (exists ((v_prenex_22 Real) (v_prenex_19 Real)) (and (<= 0.0 v_prenex_19) (<= 0.0 v_prenex_22) (<= v_prenex_22 1.0) (not (<= (+ (+ (+ (+ (- (* v_prenex_22 v_prenex_15)) (* v_prenex_19 v_prenex_12)) (* v_prenex_17 v_prenex_13)) (* (+ (+ (* v_prenex_18 v_prenex_14) (+ (+ (* v_prenex_22 v_prenex_12) (- (* v_prenex_17 v_prenex_15))) (* v_prenex_13 v_prenex_11))) (* v_prenex_16 v_prenex_10)) v_prenex_14)) (* v_prenex_18 v_prenex_16)) 100.0)) (<= v_prenex_19 1.0))) (< 100.0 v_prenex_18) (exists ((v_prenex_21 Real) (v_prenex_20 Real)) (and (<= 0.0 v_prenex_21) (<= 0.0 v_prenex_20) (<= v_prenex_21 1.0) (<= v_prenex_20 1.0) (not (<= 0.0 (+ (+ (+ (* v_prenex_14 (+ (+ (* v_prenex_18 v_prenex_14) (+ (+ (* v_prenex_20 v_prenex_12) (- (* v_prenex_17 v_prenex_15))) (* v_prenex_13 v_prenex_11))) (* v_prenex_16 v_prenex_10))) (+ (* v_prenex_17 v_prenex_13) (+ (- (* v_prenex_20 v_prenex_15)) (* v_prenex_21 v_prenex_12)))) (* v_prenex_18 v_prenex_16)) 100.0))))) (forall ((v_prenex_24 Real) (v_prenex_23 Real)) (or (<= (+ (* v_prenex_18 v_prenex_16) (+ (+ (* v_prenex_17 v_prenex_13) (+ (* v_prenex_23 v_prenex_12) (- (* v_prenex_24 v_prenex_15)))) (* v_prenex_14 (+ (+ (+ (+ (- (* v_prenex_17 v_prenex_15)) (* v_prenex_24 v_prenex_12)) (* v_prenex_13 v_prenex_11)) (* v_prenex_18 v_prenex_14)) (* v_prenex_16 v_prenex_10))))) 100.0) (< 1.0 v_prenex_23) (< 1.0 v_prenex_24) (< v_prenex_24 0.0) (< v_prenex_23 0.0))) (< (+ v_prenex_18 100.0) 0.0)))) (or (forall ((v_prenex_69 Real) (v_prenex_68 Real) (v_prenex_72 Real) (v_prenex_71 Real) (v_prenex_70 Real) (v_prenex_76 Real) (v_prenex_75 Real) (v_prenex_74 Real) (v_prenex_73 Real)) (or (exists ((v_prenex_79 Real) (v_prenex_78 Real)) (and (<= v_prenex_78 1.0) (<= v_prenex_79 1.0) (<= 0.0 v_prenex_78) (not (<= 0.0 (+ 100.0 (+ (* v_prenex_76 v_prenex_74) (+ (+ (* v_prenex_73 v_prenex_71) (+ (* v_prenex_69 v_prenex_79) (- (* v_prenex_78 v_prenex_75)))) (* (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_78)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))) v_prenex_72)))))) (<= 0.0 v_prenex_79))) (exists ((v_prenex_77 Real) (v_prenex_80 Real)) (and (<= v_prenex_77 1.0) (not (<= (+ (+ (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (* v_prenex_68 v_prenex_71) (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_80))) (* v_prenex_76 v_prenex_72)))) (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_80 v_prenex_75)) (* v_prenex_69 v_prenex_77)))) (* v_prenex_76 v_prenex_74)) 100.0)) (<= 0.0 v_prenex_80) (<= 0.0 v_prenex_77) (<= v_prenex_80 1.0))) (< (+ v_prenex_76 100.0) 0.0) (forall ((v_prenex_82 Real) (v_prenex_81 Real)) (or (< 1.0 v_prenex_81) (< v_prenex_81 0.0) (< v_prenex_82 0.0) (<= 0.0 (+ 100.0 (+ (+ (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_81 v_prenex_75)) (* v_prenex_69 v_prenex_82))) (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_81)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))))) (* v_prenex_76 v_prenex_74)))) (< 1.0 v_prenex_82))) (< 100.0 v_prenex_76))) .cse0))) is different from true [2019-09-10 01:33:37,562 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 51 [2019-09-10 01:33:45,921 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 211417 conjuctions. This might take some time... [2019-09-10 01:33:49,204 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 27 conjuctions. [2019-09-10 01:33:49,211 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 26 [2019-09-10 01:33:49,436 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-09-10 01:33:49,456 WARN L860 $PredicateComparison]: unable to prove that (or (= |c___VERIFIER_assert_#in~cond| 0) (forall ((v_prenex_69 Real) (v_prenex_68 Real) (v_prenex_72 Real) (v_prenex_71 Real) (v_prenex_70 Real) (v_prenex_76 Real) (v_prenex_75 Real) (v_prenex_74 Real) (v_prenex_73 Real)) (or (exists ((v_prenex_79 Real) (v_prenex_78 Real)) (and (<= v_prenex_78 1.0) (<= v_prenex_79 1.0) (<= 0.0 v_prenex_78) (not (<= 0.0 (+ 100.0 (+ (* v_prenex_76 v_prenex_74) (+ (+ (* v_prenex_73 v_prenex_71) (+ (* v_prenex_69 v_prenex_79) (- (* v_prenex_78 v_prenex_75)))) (* (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_78)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))) v_prenex_72)))))) (<= 0.0 v_prenex_79))) (exists ((v_prenex_77 Real) (v_prenex_80 Real)) (and (<= v_prenex_77 1.0) (not (<= (+ (+ (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (* v_prenex_68 v_prenex_71) (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_80))) (* v_prenex_76 v_prenex_72)))) (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_80 v_prenex_75)) (* v_prenex_69 v_prenex_77)))) (* v_prenex_76 v_prenex_74)) 100.0)) (<= 0.0 v_prenex_80) (<= 0.0 v_prenex_77) (<= v_prenex_80 1.0))) (< (+ v_prenex_76 100.0) 0.0) (forall ((v_prenex_82 Real) (v_prenex_81 Real)) (or (< 1.0 v_prenex_81) (< v_prenex_81 0.0) (< v_prenex_82 0.0) (<= 0.0 (+ 100.0 (+ (+ (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_81 v_prenex_75)) (* v_prenex_69 v_prenex_82))) (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_81)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))))) (* v_prenex_76 v_prenex_74)))) (< 1.0 v_prenex_82))) (< 100.0 v_prenex_76))) (not (= |c___VERIFIER_assert_#in~cond| 1))) is different from true [2019-09-10 01:33:49,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:49,471 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_main_~E~0_27 Real) (v_prenex_5 Real) (v_main_~E~0_25 Real)) (let ((.cse0 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_27)) (* c_main_~A3~0 c_main_~E0~0)))))) (or (< 100.0 .cse0) (< v_main_~E~0_25 0.0) (< (+ .cse0 100.0) 0.0) (< v_prenex_5 0.0) (<= 0.0 (+ (+ (* .cse0 c_main_~B2~0) (+ (* c_main_~B1~0 (+ (+ (+ (+ (- (* c_main_~A2~0 v_main_~E~0_27)) (* c_main_~A1~0 v_prenex_5)) (* c_main_~E~0 c_main_~A3~0)) (* .cse0 c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0))) (+ (+ (- (* c_main_~A2~0 v_prenex_5)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~A3~0 v_main_~E~0_27)))) 100.0)) (< 1.0 v_main_~E~0_27) (< 1.0 v_prenex_5) (< v_main_~E~0_27 0.0) (< 1.0 v_main_~E~0_25)))) (forall ((v_main_~E~0_27 Real) (v_prenex_4 Real) (v_main_~E~0_26 Real)) (let ((.cse1 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_27)) (* c_main_~A3~0 c_main_~E0~0)))))) (or (< 100.0 .cse1) (< (+ .cse1 100.0) 0.0) (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (< 1.0 v_main_~E~0_27) (<= (+ (* .cse1 c_main_~B2~0) (+ (+ (* c_main_~A3~0 v_main_~E~0_27) (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4))) (* (+ (+ (+ (+ (- (* c_main_~A2~0 v_main_~E~0_27)) (* c_main_~A1~0 v_main_~E~0_26)) (* c_main_~E~0 c_main_~A3~0)) (* .cse1 c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0)) c_main_~B1~0))) 100.0) (< v_main_~E~0_26 0.0) (< v_main_~E~0_27 0.0))))) is different from true [2019-09-10 01:33:49,481 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Real) (v_main_~E~0_26 Real) (v_prenex_186 Real)) (let ((.cse0 (+ (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* v_prenex_186 c_main_~A1~0)) (* c_main_~A3~0 c_main_~E0~0))) (* c_main_~B2~0 c_main_~S0~0)))) (or (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (< 100.0 .cse0) (< v_main_~E~0_26 0.0) (< v_prenex_186 0.0) (< (+ 100.0 .cse0) 0.0) (< 1.0 v_prenex_186) (<= (+ (+ (* (+ (+ (+ (* c_main_~E~0 c_main_~A3~0) (+ (* c_main_~A1~0 v_main_~E~0_26) (- (* v_prenex_186 c_main_~A2~0)))) (* .cse0 c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0)) c_main_~B1~0) (+ (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4)) (* v_prenex_186 c_main_~A3~0))) (* .cse0 c_main_~B2~0)) 100.0)))) (forall ((v_main_~E~0_27 Real) (v_prenex_5 Real) (v_main_~E~0_25 Real)) (let ((.cse1 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_27)) (* c_main_~A3~0 c_main_~E0~0)))))) (or (< 100.0 .cse1) (< v_main_~E~0_25 0.0) (< (+ .cse1 100.0) 0.0) (< v_prenex_5 0.0) (<= 0.0 (+ (+ (* .cse1 c_main_~B2~0) (+ (* c_main_~B1~0 (+ (+ (+ (+ (- (* c_main_~A2~0 v_main_~E~0_27)) (* c_main_~A1~0 v_prenex_5)) (* c_main_~E~0 c_main_~A3~0)) (* .cse1 c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0))) (+ (+ (- (* c_main_~A2~0 v_prenex_5)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~A3~0 v_main_~E~0_27)))) 100.0)) (< 1.0 v_main_~E~0_27) (< 1.0 v_prenex_5) (< v_main_~E~0_27 0.0) (< 1.0 v_main_~E~0_25))))) is different from true [2019-09-10 01:33:49,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:33:49,510 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Real) (v_main_~E~0_28 Real) (v_main_~E~0_26 Real) (v_prenex_186 Real)) (let ((.cse1 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_28)) (* c_main_~A3~0 c_main_~E0~0)))))) (let ((.cse0 (+ (+ (* .cse1 c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_28)) (* v_prenex_186 c_main_~A1~0)))) (* c_main_~S~0 c_main_~B2~0)))) (or (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (< v_main_~E~0_26 0.0) (< v_prenex_186 0.0) (< 100.0 .cse0) (< v_main_~E~0_28 0.0) (< (+ .cse0 100.0) 0.0) (< 1.0 v_prenex_186) (<= (+ (+ (+ (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4)) (* v_prenex_186 c_main_~A3~0)) (* (+ (* .cse1 c_main_~B2~0) (+ (* .cse0 c_main_~B1~0) (+ (+ (* c_main_~A1~0 v_main_~E~0_26) (- (* v_prenex_186 c_main_~A2~0))) (* c_main_~A3~0 v_main_~E~0_28)))) c_main_~B1~0)) (* .cse0 c_main_~B2~0)) 100.0) (< 1.0 v_main_~E~0_28))))) (forall ((v_main_~E~0_27 Real) (v_main_~E~0_28 Real) (v_prenex_5 Real) (v_main_~E~0_25 Real)) (let ((.cse3 (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_28)) (* c_main_~A3~0 c_main_~E0~0)))))) (let ((.cse2 (+ (* c_main_~S~0 c_main_~B2~0) (+ (* .cse3 c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_28)) (* c_main_~A1~0 v_main_~E~0_27))))))) (or (< (+ .cse2 100.0) 0.0) (< 100.0 .cse2) (< v_main_~E~0_25 0.0) (< v_prenex_5 0.0) (< 1.0 v_main_~E~0_27) (<= 0.0 (+ 100.0 (+ (* .cse2 c_main_~B2~0) (+ (+ (+ (- (* c_main_~A2~0 v_prenex_5)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~A3~0 v_main_~E~0_27)) (* (+ (* .cse3 c_main_~B2~0) (+ (* .cse2 c_main_~B1~0) (+ (+ (- (* c_main_~A2~0 v_main_~E~0_27)) (* c_main_~A1~0 v_prenex_5)) (* c_main_~A3~0 v_main_~E~0_28)))) c_main_~B1~0))))) (< 1.0 v_prenex_5) (< v_main_~E~0_27 0.0) (< v_main_~E~0_28 0.0) (< 1.0 v_main_~E~0_25) (< 1.0 v_main_~E~0_28)))))) is different from true [2019-09-10 01:33:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 1 refuted. 4 times theorem prover too weak. 4 trivial. 16 not checked. [2019-09-10 01:33:49,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:33:49,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 25 [2019-09-10 01:33:49,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:33:49,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 01:33:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 01:33:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=121, Unknown=30, NotChecked=396, Total=600 [2019-09-10 01:33:49,559 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 25 states. [2019-09-10 01:34:12,913 WARN L188 SmtUtils]: Spent 21.16 s on a formula simplification. DAG size of input: 142 DAG size of output: 57 [2019-09-10 01:34:12,969 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| 1)) (.cse1 (= 0 c___VERIFIER_assert_~cond))) (and .cse0 (or (forall ((v_prenex_69 Real) (v_prenex_68 Real) (v_prenex_72 Real) (v_prenex_71 Real) (v_prenex_70 Real) (v_prenex_76 Real) (v_prenex_75 Real) (v_prenex_74 Real) (v_prenex_73 Real)) (or (exists ((v_prenex_79 Real) (v_prenex_78 Real)) (and (<= v_prenex_78 1.0) (<= v_prenex_79 1.0) (<= 0.0 v_prenex_78) (not (<= 0.0 (+ 100.0 (+ (* v_prenex_76 v_prenex_74) (+ (+ (* v_prenex_73 v_prenex_71) (+ (* v_prenex_69 v_prenex_79) (- (* v_prenex_78 v_prenex_75)))) (* (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_78)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))) v_prenex_72)))))) (<= 0.0 v_prenex_79))) (exists ((v_prenex_77 Real) (v_prenex_80 Real)) (and (<= v_prenex_77 1.0) (not (<= (+ (+ (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (* v_prenex_68 v_prenex_71) (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_80))) (* v_prenex_76 v_prenex_72)))) (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_80 v_prenex_75)) (* v_prenex_69 v_prenex_77)))) (* v_prenex_76 v_prenex_74)) 100.0)) (<= 0.0 v_prenex_80) (<= 0.0 v_prenex_77) (<= v_prenex_80 1.0))) (< (+ v_prenex_76 100.0) 0.0) (forall ((v_prenex_82 Real) (v_prenex_81 Real)) (or (< 1.0 v_prenex_81) (< v_prenex_81 0.0) (< v_prenex_82 0.0) (<= 0.0 (+ 100.0 (+ (+ (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_81 v_prenex_75)) (* v_prenex_69 v_prenex_82))) (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_81)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))))) (* v_prenex_76 v_prenex_74)))) (< 1.0 v_prenex_82))) (< 100.0 v_prenex_76))) (not .cse0) .cse1) (or (not (= |c___VERIFIER_assert_#in~cond| 0)) .cse1) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from false [2019-09-10 01:34:13,028 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< (+ c_main_~S~0 100.0) 0.0)) (.cse1 (< 100.0 c_main_~S~0))) (and (<= 0.0 c_main_~E0~0) (<= c_main_~B1~0 (/ 141.0 100.0)) (<= 0.0 (+ c_main_~A2~0 (/ 131.0 100.0))) (<= c_main_~A1~0 (/ 71.0 100.0)) (or .cse0 (forall ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (or (< 1.0 v_prenex_4) (< 1.0 v_main_~E~0_26) (< v_prenex_4 0.0) (<= (+ (+ (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_main_~E~0_26)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0) (+ (* c_main_~E~0 c_main_~A3~0) (+ (- (* c_main_~A2~0 v_main_~E~0_26)) (* c_main_~A1~0 v_prenex_4)))) (* c_main_~S~0 c_main_~B2~0)) 100.0) (< v_main_~E~0_26 0.0))) .cse1) (<= (/ 109.0 100.0) c_main_~A3~0) (<= c_main_~A3~0 (/ 111.0 100.0)) (<= c_main_~E~0 1.0) (<= 0.0 (+ c_main_~B2~0 (/ 71.0 100.0))) (<= c_main_~E0~0 1.0) (<= (+ c_main_~B2~0 (/ 69.0 100.0)) 0.0) (<= (/ 139.0 100.0) c_main_~B1~0) (<= (/ 69.0 100.0) c_main_~A1~0) (or .cse0 .cse1 (forall ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (or (< v_main_~E~0_25 0.0) (<= 0.0 (+ (+ (+ (+ (+ (- (* c_main_~A2~0 v_prenex_5)) (* c_main_~A1~0 v_main_~E~0_25)) (* c_main_~E~0 c_main_~A3~0)) (* (+ (* c_main_~B2~0 c_main_~S0~0) (+ (* c_main_~S~0 c_main_~B1~0) (+ (+ (- (* c_main_~E~0 c_main_~A2~0)) (* c_main_~A1~0 v_prenex_5)) (* c_main_~A3~0 c_main_~E0~0)))) c_main_~B1~0)) (* c_main_~S~0 c_main_~B2~0)) 100.0)) (< v_prenex_5 0.0) (< 1.0 v_prenex_5) (< 1.0 v_main_~E~0_25)))) (<= (+ c_main_~A2~0 (/ 129.0 100.0)) 0.0) (<= 0.0 c_main_~E~0) (exists ((v_subst_8 Real) (main_~E1~0 Real)) (let ((.cse3 (to_real 0))) (let ((.cse2 (* .cse3 c_main_~B2~0))) (and (= (+ .cse2 (+ (* .cse3 c_main_~B1~0) (+ (+ (* c_main_~A1~0 c_main_~E0~0) (- (* c_main_~A2~0 main_~E1~0))) (* c_main_~A3~0 v_subst_8)))) c_main_~S0~0) (<= 0.0 main_~E1~0) (<= v_subst_8 1.0) (<= 0.0 v_subst_8) (<= main_~E1~0 1.0) (= (+ (+ (* c_main_~B1~0 c_main_~S0~0) (+ (+ (* c_main_~E~0 c_main_~A1~0) (- (* c_main_~A2~0 c_main_~E0~0))) (* c_main_~A3~0 main_~E1~0))) .cse2) c_main_~S~0))))))) is different from false [2019-09-10 01:34:13,102 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse1 (= 0 c___VERIFIER_assert_~cond)) (.cse3 (forall ((v_prenex_69 Real) (v_prenex_68 Real) (v_prenex_72 Real) (v_prenex_71 Real) (v_prenex_70 Real) (v_prenex_76 Real) (v_prenex_75 Real) (v_prenex_74 Real) (v_prenex_73 Real)) (or (exists ((v_prenex_79 Real) (v_prenex_78 Real)) (and (<= v_prenex_78 1.0) (<= v_prenex_79 1.0) (<= 0.0 v_prenex_78) (not (<= 0.0 (+ 100.0 (+ (* v_prenex_76 v_prenex_74) (+ (+ (* v_prenex_73 v_prenex_71) (+ (* v_prenex_69 v_prenex_79) (- (* v_prenex_78 v_prenex_75)))) (* (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_78)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))) v_prenex_72)))))) (<= 0.0 v_prenex_79))) (exists ((v_prenex_77 Real) (v_prenex_80 Real)) (and (<= v_prenex_77 1.0) (not (<= (+ (+ (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (* v_prenex_68 v_prenex_71) (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_80))) (* v_prenex_76 v_prenex_72)))) (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_80 v_prenex_75)) (* v_prenex_69 v_prenex_77)))) (* v_prenex_76 v_prenex_74)) 100.0)) (<= 0.0 v_prenex_80) (<= 0.0 v_prenex_77) (<= v_prenex_80 1.0))) (< (+ v_prenex_76 100.0) 0.0) (forall ((v_prenex_82 Real) (v_prenex_81 Real)) (or (< 1.0 v_prenex_81) (< v_prenex_81 0.0) (< v_prenex_82 0.0) (<= 0.0 (+ 100.0 (+ (+ (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_81 v_prenex_75)) (* v_prenex_69 v_prenex_82))) (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_81)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))))) (* v_prenex_76 v_prenex_74)))) (< 1.0 v_prenex_82))) (< 100.0 v_prenex_76)))) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and .cse0 (not .cse1) (or .cse2 (forall ((v_prenex_14 Real) (v_prenex_13 Real) (v_prenex_12 Real) (v_prenex_11 Real) (v_prenex_18 Real) (v_prenex_17 Real) (v_prenex_16 Real) (v_prenex_15 Real) (v_prenex_10 Real)) (or (exists ((v_prenex_22 Real) (v_prenex_19 Real)) (and (<= 0.0 v_prenex_19) (<= 0.0 v_prenex_22) (<= v_prenex_22 1.0) (not (<= (+ (+ (+ (+ (- (* v_prenex_22 v_prenex_15)) (* v_prenex_19 v_prenex_12)) (* v_prenex_17 v_prenex_13)) (* (+ (+ (* v_prenex_18 v_prenex_14) (+ (+ (* v_prenex_22 v_prenex_12) (- (* v_prenex_17 v_prenex_15))) (* v_prenex_13 v_prenex_11))) (* v_prenex_16 v_prenex_10)) v_prenex_14)) (* v_prenex_18 v_prenex_16)) 100.0)) (<= v_prenex_19 1.0))) (< 100.0 v_prenex_18) (exists ((v_prenex_21 Real) (v_prenex_20 Real)) (and (<= 0.0 v_prenex_21) (<= 0.0 v_prenex_20) (<= v_prenex_21 1.0) (<= v_prenex_20 1.0) (not (<= 0.0 (+ (+ (+ (* v_prenex_14 (+ (+ (* v_prenex_18 v_prenex_14) (+ (+ (* v_prenex_20 v_prenex_12) (- (* v_prenex_17 v_prenex_15))) (* v_prenex_13 v_prenex_11))) (* v_prenex_16 v_prenex_10))) (+ (* v_prenex_17 v_prenex_13) (+ (- (* v_prenex_20 v_prenex_15)) (* v_prenex_21 v_prenex_12)))) (* v_prenex_18 v_prenex_16)) 100.0))))) (forall ((v_prenex_24 Real) (v_prenex_23 Real)) (or (<= (+ (* v_prenex_18 v_prenex_16) (+ (+ (* v_prenex_17 v_prenex_13) (+ (* v_prenex_23 v_prenex_12) (- (* v_prenex_24 v_prenex_15)))) (* v_prenex_14 (+ (+ (+ (+ (- (* v_prenex_17 v_prenex_15)) (* v_prenex_24 v_prenex_12)) (* v_prenex_13 v_prenex_11)) (* v_prenex_18 v_prenex_14)) (* v_prenex_16 v_prenex_10))))) 100.0) (< 1.0 v_prenex_23) (< 1.0 v_prenex_24) (< v_prenex_24 0.0) (< v_prenex_23 0.0))) (< (+ v_prenex_18 100.0) 0.0)))) (or .cse3 .cse2 .cse1) (or .cse0 .cse1) (or .cse3 .cse2) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from true [2019-09-10 01:34:13,141 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0)))))) (.cse5 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (.cse4 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (.cse1 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0)))))) (.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse2 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) .cse0 (or .cse0 .cse1 .cse2) (or .cse2 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (< (+ v_main_~S~0_BEFORE_CALL_15 100.0) 0.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (< 100.0 v_main_~S~0_BEFORE_CALL_15) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (or .cse0 .cse3) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6))))) .cse2) (or .cse0 .cse4 .cse2) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26)))))) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (<= 0.0 (+ v_main_~S~0_BEFORE_CALL_15 100.0)) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))) (forall ((v_prenex_6 Real) (v_prenex_9 Real)) (or (<= (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_9 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_6))) (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_9)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0) (< 1.0 v_prenex_9) (< v_prenex_9 0.0) (< v_prenex_6 0.0) (< 1.0 v_prenex_6)))))) (or .cse0 .cse2 .cse5) (or .cse0 .cse2 .cse3) (or (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (< (+ v_main_~S~0_BEFORE_CALL_15 100.0) 0.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (< 100.0 v_main_~S~0_BEFORE_CALL_15) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))))) .cse2) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (<= v_main_~S~0_BEFORE_CALL_15 100.0) (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26)))))) (or .cse0 .cse5) (or .cse0 .cse4) (or .cse0 .cse1) (or .cse0 (forall ((v_main_~S0~0_BEFORE_CALL_11 Real) (v_main_~E0~0_BEFORE_CALL_11 Real) (v_main_~A1~0_BEFORE_CALL_11 Real) (v_main_~A2~0_BEFORE_CALL_11 Real) (v_main_~A3~0_BEFORE_CALL_11 Real) (v_main_~B2~0_BEFORE_CALL_11 Real) (v_main_~E~0_BEFORE_CALL_11 Real) (v_main_~S~0_BEFORE_CALL_15 Real) (v_main_~B1~0_BEFORE_CALL_11 Real)) (or (exists ((v_prenex_5 Real) (v_main_~E~0_25 Real)) (and (<= v_prenex_5 1.0) (<= v_main_~E~0_25 1.0) (<= 0.0 v_main_~E~0_25) (<= 0.0 v_prenex_5) (not (<= 0.0 (+ 100.0 (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_5) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)))))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_25) (- (* v_prenex_5 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11))))))) (forall ((v_prenex_7 Real) (v_prenex_8 Real)) (or (<= 0.0 (+ (+ (+ (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (- (* v_prenex_7 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_8))) (* v_main_~B1~0_BEFORE_CALL_11 (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11) (+ (+ (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11)) (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_7)) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (< v_prenex_8 0.0) (< 1.0 v_prenex_8) (< 1.0 v_prenex_7) (< v_prenex_7 0.0))) (exists ((v_prenex_4 Real) (v_main_~E~0_26 Real)) (and (<= v_prenex_4 1.0) (<= v_main_~E~0_26 1.0) (<= 0.0 v_prenex_4) (not (<= (+ (+ (* (+ (* v_main_~B2~0_BEFORE_CALL_11 v_main_~S0~0_BEFORE_CALL_11) (+ (+ (+ (* v_main_~A1~0_BEFORE_CALL_11 v_main_~E~0_26) (- (* v_main_~E~0_BEFORE_CALL_11 v_main_~A2~0_BEFORE_CALL_11))) (* v_main_~E0~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11)) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B1~0_BEFORE_CALL_11))) v_main_~B1~0_BEFORE_CALL_11) (+ (* v_main_~E~0_BEFORE_CALL_11 v_main_~A3~0_BEFORE_CALL_11) (+ (* v_main_~A1~0_BEFORE_CALL_11 v_prenex_4) (- (* v_main_~E~0_26 v_main_~A2~0_BEFORE_CALL_11))))) (* v_main_~S~0_BEFORE_CALL_15 v_main_~B2~0_BEFORE_CALL_11)) 100.0)) (<= 0.0 v_main_~E~0_26))))) .cse2))) is different from true [2019-09-10 01:34:14,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse1 (= 0 c___VERIFIER_assert_~cond))) (and .cse0 (not .cse1) (or (forall ((v_prenex_69 Real) (v_prenex_68 Real) (v_prenex_72 Real) (v_prenex_71 Real) (v_prenex_70 Real) (v_prenex_76 Real) (v_prenex_75 Real) (v_prenex_74 Real) (v_prenex_73 Real)) (or (exists ((v_prenex_79 Real) (v_prenex_78 Real)) (and (<= v_prenex_78 1.0) (<= v_prenex_79 1.0) (<= 0.0 v_prenex_78) (not (<= 0.0 (+ 100.0 (+ (* v_prenex_76 v_prenex_74) (+ (+ (* v_prenex_73 v_prenex_71) (+ (* v_prenex_69 v_prenex_79) (- (* v_prenex_78 v_prenex_75)))) (* (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_78)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))) v_prenex_72)))))) (<= 0.0 v_prenex_79))) (exists ((v_prenex_77 Real) (v_prenex_80 Real)) (and (<= v_prenex_77 1.0) (not (<= (+ (+ (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (* v_prenex_68 v_prenex_71) (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_80))) (* v_prenex_76 v_prenex_72)))) (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_80 v_prenex_75)) (* v_prenex_69 v_prenex_77)))) (* v_prenex_76 v_prenex_74)) 100.0)) (<= 0.0 v_prenex_80) (<= 0.0 v_prenex_77) (<= v_prenex_80 1.0))) (< (+ v_prenex_76 100.0) 0.0) (forall ((v_prenex_82 Real) (v_prenex_81 Real)) (or (< 1.0 v_prenex_81) (< v_prenex_81 0.0) (< v_prenex_82 0.0) (<= 0.0 (+ 100.0 (+ (+ (+ (* v_prenex_73 v_prenex_71) (+ (- (* v_prenex_81 v_prenex_75)) (* v_prenex_69 v_prenex_82))) (* v_prenex_72 (+ (* v_prenex_74 v_prenex_70) (+ (+ (+ (- (* v_prenex_75 v_prenex_73)) (* v_prenex_69 v_prenex_81)) (* v_prenex_68 v_prenex_71)) (* v_prenex_76 v_prenex_72))))) (* v_prenex_76 v_prenex_74)))) (< 1.0 v_prenex_82))) (< 100.0 v_prenex_76))) (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse1) (or .cse0 .cse1) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond))) is different from true [2019-09-10 01:34:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:14,316 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-09-10 01:34:14,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 01:34:14,316 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2019-09-10 01:34:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:14,319 INFO L225 Difference]: With dead ends: 42 [2019-09-10 01:34:14,319 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 01:34:14,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=83, Invalid=207, Unknown=50, NotChecked=782, Total=1122 [2019-09-10 01:34:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 01:34:14,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-10 01:34:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 01:34:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-09-10 01:34:14,326 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 31 [2019-09-10 01:34:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:14,327 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-09-10 01:34:14,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 01:34:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-09-10 01:34:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 01:34:14,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:14,328 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:34:14,328 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1759150333, now seen corresponding path program 4 times [2019-09-10 01:34:14,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:14,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:14,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:34:14,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:14,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:14,342 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:14,342 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:14,342 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:14,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:14,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-10 01:34:16,393 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-09-10 01:34:16,393 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:34:16,419 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-09-10 01:34:16,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:34:16 BoogieIcfgContainer [2019-09-10 01:34:16,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:34:16,422 INFO L168 Benchmark]: Toolchain (without parser) took 80961.13 ms. Allocated memory was 141.0 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 88.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-10 01:34:16,424 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:34:16,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.82 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 87.9 MB in the beginning and 179.8 MB in the end (delta: -91.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:16,426 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 201.3 MB. Free memory was 179.8 MB in the beginning and 177.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:16,428 INFO L168 Benchmark]: RCFGBuilder took 246.73 ms. Allocated memory is still 201.3 MB. Free memory was 177.7 MB in the beginning and 165.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:16,429 INFO L168 Benchmark]: TraceAbstraction took 80271.56 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 165.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-10 01:34:16,432 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 107.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 394.82 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 87.9 MB in the beginning and 179.8 MB in the end (delta: -91.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 201.3 MB. Free memory was 179.8 MB in the beginning and 177.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 246.73 ms. Allocated memory is still 201.3 MB. Free memory was 177.7 MB in the beginning and 165.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80271.56 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 165.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L17] double E, E0, E1, S0, S1, S; [L18] double A1, A2, A3, B1, B2; [L19] int i; [L21] A1 = __VERIFIER_nondet_double() [L22] A2 = __VERIFIER_nondet_double() [L23] A3 = __VERIFIER_nondet_double() [L24] B1 = __VERIFIER_nondet_double() [L25] B2 = __VERIFIER_nondet_double() [L33] E = __VERIFIER_nondet_double() [L34] E0 = __VERIFIER_nondet_double() [L38] S0 = 0 [L39] S = 0 [L41] i = 0 [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L12] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(S >= -100. && S <= 100.) [L41] i++ [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L12] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(S >= -100. && S <= 100.) [L41] i++ [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L12] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(S >= -100. && S <= 100.) [L41] i++ [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L12] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(S >= -100. && S <= 100.) [L41] i++ [L41] COND TRUE i <= 1000000 [L42] E1 = E0 [L43] E0 = E [L45] E = __VERIFIER_nondet_double() [L48] S1 = S0 [L49] S0 = S [L50] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L52] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L12] COND TRUE !(cond) [L12] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNKNOWN Result, 80.2s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 38 SDslu, 286 SDs, 0 SdLazy, 144 SolverSat, 18 SolverUnsat, 80 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 104 SyntacticMatches, 12 SemanticMatches, 73 ConstructedPredicates, 29 IntricatePredicates, 4 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 26.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 49.2s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 156 ConstructedInterpolants, 48 QuantifiedInterpolants, 232866 SizeOfPredicates, 63 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 46/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...