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/bitvector/s3_srvr_1_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:25,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:25,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:25,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:25,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:25,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:25,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:25,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:25,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:25,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:25,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:25,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:25,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:25,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:25,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:25,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:25,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:25,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:25,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:25,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:25,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:25,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:25,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:25,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:25,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:25,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:25,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:25,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:25,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:25,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:25,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:25,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:25,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:25,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:25,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:25,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:25,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:25,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:25,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:25,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:25,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:25,419 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-09 05:44:25,447 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:25,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:25,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:25,449 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:25,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:25,450 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:25,450 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:25,450 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:25,450 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:25,451 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:25,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:25,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:25,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:25,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:25,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:25,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:25,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:25,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:25,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:25,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:25,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:25,455 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:25,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:25,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:25,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:25,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:25,457 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:25,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:25,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:25,457 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:25,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:25,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:25,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:25,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:25,509 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:25,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_1_alt.BV.c.cil.c [2019-09-09 05:44:25,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bff58f1c/b68c24c9f11743bc8e51ac668a849a58/FLAG0cad08c68 [2019-09-09 05:44:26,137 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:26,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1_alt.BV.c.cil.c [2019-09-09 05:44:26,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bff58f1c/b68c24c9f11743bc8e51ac668a849a58/FLAG0cad08c68 [2019-09-09 05:44:26,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bff58f1c/b68c24c9f11743bc8e51ac668a849a58 [2019-09-09 05:44:26,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:26,455 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:26,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:26,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:26,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:26,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c29d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26, skipping insertion in model container [2019-09-09 05:44:26,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,475 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:26,545 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:26,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:26,907 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:27,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:27,148 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:27,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27 WrapperNode [2019-09-09 05:44:27,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:27,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:27,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:27,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:27,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (1/1) ... [2019-09-09 05:44:27,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:27,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:27,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:27,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:27,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (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-09 05:44:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:27,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:44:27,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-09 05:44:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:44:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-09 05:44:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:44:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:44:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:27,531 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:44:28,191 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:44:28,192 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:44:28,195 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:28,195 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:44:28,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:28 BoogieIcfgContainer [2019-09-09 05:44:28,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:28,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:28,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:28,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:28,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:26" (1/3) ... [2019-09-09 05:44:28,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc0d9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:28, skipping insertion in model container [2019-09-09 05:44:28,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:27" (2/3) ... [2019-09-09 05:44:28,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc0d9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:28, skipping insertion in model container [2019-09-09 05:44:28,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:28" (3/3) ... [2019-09-09 05:44:28,206 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1_alt.BV.c.cil.c [2019-09-09 05:44:28,216 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:28,225 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:28,242 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:28,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:28,269 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:28,269 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:28,269 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:28,269 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:28,269 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:28,270 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:28,270 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-09-09 05:44:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:44:28,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:28,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:28,303 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash -948982516, now seen corresponding path program 1 times [2019-09-09 05:44:28,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:28,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:28,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:28,594 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-09 05:44:28,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:28,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:28,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:28,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:28,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:28,622 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 5 states. [2019-09-09 05:44:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:29,089 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2019-09-09 05:44:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:29,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:44:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:29,107 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:44:29,107 INFO L226 Difference]: Without dead ends: 179 [2019-09-09 05:44:29,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-09 05:44:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2019-09-09 05:44:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:44:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 279 transitions. [2019-09-09 05:44:29,197 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 279 transitions. Word has length 49 [2019-09-09 05:44:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:29,199 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 279 transitions. [2019-09-09 05:44:29,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 279 transitions. [2019-09-09 05:44:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:44:29,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:29,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:29,210 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 639336974, now seen corresponding path program 1 times [2019-09-09 05:44:29,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:29,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:29,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:29,413 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-09 05:44:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:29,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:29,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:29,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:29,418 INFO L87 Difference]: Start difference. First operand 173 states and 279 transitions. Second operand 5 states. [2019-09-09 05:44:29,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:29,779 INFO L93 Difference]: Finished difference Result 180 states and 286 transitions. [2019-09-09 05:44:29,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:29,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:44:29,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:29,787 INFO L225 Difference]: With dead ends: 180 [2019-09-09 05:44:29,787 INFO L226 Difference]: Without dead ends: 178 [2019-09-09 05:44:29,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-09 05:44:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2019-09-09 05:44:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-09 05:44:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 277 transitions. [2019-09-09 05:44:29,813 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 277 transitions. Word has length 50 [2019-09-09 05:44:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:29,814 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 277 transitions. [2019-09-09 05:44:29,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 277 transitions. [2019-09-09 05:44:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:44:29,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:29,821 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:29,823 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1713661290, now seen corresponding path program 1 times [2019-09-09 05:44:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:29,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:29,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:29,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:29,968 INFO L87 Difference]: Start difference. First operand 172 states and 277 transitions. Second operand 5 states. [2019-09-09 05:44:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:30,263 INFO L93 Difference]: Finished difference Result 203 states and 334 transitions. [2019-09-09 05:44:30,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:30,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-09 05:44:30,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:30,266 INFO L225 Difference]: With dead ends: 203 [2019-09-09 05:44:30,266 INFO L226 Difference]: Without dead ends: 203 [2019-09-09 05:44:30,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-09 05:44:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-09-09 05:44:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-09 05:44:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 334 transitions. [2019-09-09 05:44:30,282 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 334 transitions. Word has length 78 [2019-09-09 05:44:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:30,284 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 334 transitions. [2019-09-09 05:44:30,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 334 transitions. [2019-09-09 05:44:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:44:30,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:30,288 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:30,289 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:30,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1660004957, now seen corresponding path program 1 times [2019-09-09 05:44:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:30,330 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:30,330 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:30,330 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) [2019-09-09 05:44:30,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:30,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:30,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-09 05:44:30,394 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [93], [98], [103], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [201], [203], [208], [211], [489], [494], [497], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:44:30,450 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:30,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:30,656 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:30,658 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 92 root evaluator evaluations with a maximum evaluation depth of 8. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 84 variables. [2019-09-09 05:44:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:30,663 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:30,853 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 86.49% of their original sizes. [2019-09-09 05:44:30,854 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:44:30,918 INFO L420 sIntCurrentIteration]: We unified 88 AI predicates to 88 [2019-09-09 05:44:30,918 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:44:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:44:30,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:30,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:44:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:44:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:44:30,920 INFO L87 Difference]: Start difference. First operand 203 states and 334 transitions. Second operand 9 states. [2019-09-09 05:44:31,924 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:31,998 INFO L93 Difference]: Finished difference Result 216 states and 347 transitions. [2019-09-09 05:44:31,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:44:31,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-09 05:44:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:32,000 INFO L225 Difference]: With dead ends: 216 [2019-09-09 05:44:32,000 INFO L226 Difference]: Without dead ends: 216 [2019-09-09 05:44:32,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:44:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-09 05:44:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-09-09 05:44:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-09 05:44:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 347 transitions. [2019-09-09 05:44:32,009 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 347 transitions. Word has length 89 [2019-09-09 05:44:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:32,010 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 347 transitions. [2019-09-09 05:44:32,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:44:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 347 transitions. [2019-09-09 05:44:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:44:32,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:32,012 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:32,012 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1855692930, now seen corresponding path program 1 times [2019-09-09 05:44:32,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-09 05:44:32,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:32,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:32,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:32,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:32,065 INFO L87 Difference]: Start difference. First operand 216 states and 347 transitions. Second operand 3 states. [2019-09-09 05:44:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:32,207 INFO L93 Difference]: Finished difference Result 241 states and 379 transitions. [2019-09-09 05:44:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:32,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-09 05:44:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:32,210 INFO L225 Difference]: With dead ends: 241 [2019-09-09 05:44:32,210 INFO L226 Difference]: Without dead ends: 241 [2019-09-09 05:44:32,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-09 05:44:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2019-09-09 05:44:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-09-09 05:44:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 373 transitions. [2019-09-09 05:44:32,223 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 373 transitions. Word has length 105 [2019-09-09 05:44:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:32,223 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 373 transitions. [2019-09-09 05:44:32,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 373 transitions. [2019-09-09 05:44:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:44:32,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:32,226 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:32,227 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:32,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash 320501393, now seen corresponding path program 1 times [2019-09-09 05:44:32,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:32,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:32,262 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:32,263 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:32,263 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:44:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:32,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-09 05:44:32,318 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [305], [309], [489], [494], [497], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:44:32,334 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:32,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:32,486 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:32,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:32,667 INFO L272 AbstractInterpreter]: Visited 66 different actions 290 times. Merged at 54 different actions 211 times. Widened at 3 different actions 4 times. Performed 731 root evaluator evaluations with a maximum evaluation depth of 8. Performed 731 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 10 fixpoints after 6 different actions. Largest state had 86 variables. [2019-09-09 05:44:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,668 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:32,840 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 94.83% of their original sizes. [2019-09-09 05:44:32,840 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:44:34,419 INFO L420 sIntCurrentIteration]: We unified 125 AI predicates to 125 [2019-09-09 05:44:34,419 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:44:34,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-09 05:44:34,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:34,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-09 05:44:34,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-09 05:44:34,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-09-09 05:44:34,422 INFO L87 Difference]: Start difference. First operand 237 states and 373 transitions. Second operand 27 states. [2019-09-09 05:45:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,108 INFO L93 Difference]: Finished difference Result 979 states and 1490 transitions. [2019-09-09 05:45:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-09 05:45:04,108 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 126 [2019-09-09 05:45:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,115 INFO L225 Difference]: With dead ends: 979 [2019-09-09 05:45:04,115 INFO L226 Difference]: Without dead ends: 973 [2019-09-09 05:45:04,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=527, Invalid=1825, Unknown=0, NotChecked=0, Total=2352 [2019-09-09 05:45:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-09-09 05:45:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 683. [2019-09-09 05:45:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-09 05:45:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1067 transitions. [2019-09-09 05:45:04,139 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1067 transitions. Word has length 126 [2019-09-09 05:45:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:04,140 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 1067 transitions. [2019-09-09 05:45:04,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-09 05:45:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1067 transitions. [2019-09-09 05:45:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:45:04,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:04,143 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:04,144 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2008633021, now seen corresponding path program 1 times [2019-09-09 05:45:04,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-09 05:45:04,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:04,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:04,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:04,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,233 INFO L87 Difference]: Start difference. First operand 683 states and 1067 transitions. Second operand 3 states. [2019-09-09 05:45:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,374 INFO L93 Difference]: Finished difference Result 758 states and 1158 transitions. [2019-09-09 05:45:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:04,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-09 05:45:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,381 INFO L225 Difference]: With dead ends: 758 [2019-09-09 05:45:04,381 INFO L226 Difference]: Without dead ends: 758 [2019-09-09 05:45:04,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-09-09 05:45:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 732. [2019-09-09 05:45:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-09 05:45:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1127 transitions. [2019-09-09 05:45:04,400 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1127 transitions. Word has length 164 [2019-09-09 05:45:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:04,400 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 1127 transitions. [2019-09-09 05:45:04,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1127 transitions. [2019-09-09 05:45:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:45:04,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:04,404 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:04,404 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash 776306595, now seen corresponding path program 1 times [2019-09-09 05:45:04,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:04,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:45:04,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:04,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:04,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:04,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,471 INFO L87 Difference]: Start difference. First operand 732 states and 1127 transitions. Second operand 3 states. [2019-09-09 05:45:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,649 INFO L93 Difference]: Finished difference Result 801 states and 1188 transitions. [2019-09-09 05:45:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:04,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-09 05:45:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,654 INFO L225 Difference]: With dead ends: 801 [2019-09-09 05:45:04,654 INFO L226 Difference]: Without dead ends: 801 [2019-09-09 05:45:04,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-09 05:45:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 772. [2019-09-09 05:45:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-09-09 05:45:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1149 transitions. [2019-09-09 05:45:04,674 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1149 transitions. Word has length 165 [2019-09-09 05:45:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:04,675 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 1149 transitions. [2019-09-09 05:45:04,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1149 transitions. [2019-09-09 05:45:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-09 05:45:04,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:04,679 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:04,679 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1157219774, now seen corresponding path program 1 times [2019-09-09 05:45:04,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:04,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:04,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:04,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-09 05:45:04,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:04,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:04,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:04,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:04,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,770 INFO L87 Difference]: Start difference. First operand 772 states and 1149 transitions. Second operand 3 states. [2019-09-09 05:45:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:04,980 INFO L93 Difference]: Finished difference Result 807 states and 1169 transitions. [2019-09-09 05:45:04,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:04,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-09 05:45:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:04,985 INFO L225 Difference]: With dead ends: 807 [2019-09-09 05:45:04,985 INFO L226 Difference]: Without dead ends: 805 [2019-09-09 05:45:04,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-09-09 05:45:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2019-09-09 05:45:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-09-09 05:45:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1154 transitions. [2019-09-09 05:45:05,007 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1154 transitions. Word has length 178 [2019-09-09 05:45:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:05,008 INFO L475 AbstractCegarLoop]: Abstraction has 794 states and 1154 transitions. [2019-09-09 05:45:05,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1154 transitions. [2019-09-09 05:45:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-09 05:45:05,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:05,012 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:05,012 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1271500523, now seen corresponding path program 1 times [2019-09-09 05:45:05,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-09 05:45:05,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:05,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:05,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:05,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:05,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:05,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:05,123 INFO L87 Difference]: Start difference. First operand 794 states and 1154 transitions. Second operand 3 states. [2019-09-09 05:45:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:05,279 INFO L93 Difference]: Finished difference Result 868 states and 1254 transitions. [2019-09-09 05:45:05,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:05,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-09 05:45:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:05,283 INFO L225 Difference]: With dead ends: 868 [2019-09-09 05:45:05,284 INFO L226 Difference]: Without dead ends: 868 [2019-09-09 05:45:05,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-09 05:45:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 844. [2019-09-09 05:45:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-09 05:45:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1214 transitions. [2019-09-09 05:45:05,303 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1214 transitions. Word has length 184 [2019-09-09 05:45:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:05,303 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1214 transitions. [2019-09-09 05:45:05,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1214 transitions. [2019-09-09 05:45:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:45:05,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:05,309 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:05,309 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1242312534, now seen corresponding path program 1 times [2019-09-09 05:45:05,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:05,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:05,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:05,324 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:05,325 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:05,325 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) [2019-09-09 05:45:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:05,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:45:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:05,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2019-09-09 05:45:05,390 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [305], [309], [469], [472], [480], [483], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:05,404 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:05,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:05,487 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:05,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:05,899 INFO L272 AbstractInterpreter]: Visited 74 different actions 982 times. Merged at 58 different actions 828 times. Widened at 9 different actions 85 times. Performed 2370 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 78 fixpoints after 12 different actions. Largest state had 87 variables. [2019-09-09 05:45:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:05,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:05,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:05,900 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-09 05:45:05,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:05,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:05,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:45:05,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-09 05:45:06,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-09 05:45:06,127 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-09-09 05:45:06,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:06,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:06,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:06,129 INFO L87 Difference]: Start difference. First operand 844 states and 1214 transitions. Second operand 3 states. [2019-09-09 05:45:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:06,305 INFO L93 Difference]: Finished difference Result 957 states and 1339 transitions. [2019-09-09 05:45:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:06,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-09 05:45:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:06,311 INFO L225 Difference]: With dead ends: 957 [2019-09-09 05:45:06,311 INFO L226 Difference]: Without dead ends: 839 [2019-09-09 05:45:06,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:45:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-09-09 05:45:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2019-09-09 05:45:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-09 05:45:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1199 transitions. [2019-09-09 05:45:06,337 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1199 transitions. Word has length 204 [2019-09-09 05:45:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:06,337 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1199 transitions. [2019-09-09 05:45:06,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1199 transitions. [2019-09-09 05:45:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-09 05:45:06,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:06,342 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:06,342 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1485896812, now seen corresponding path program 1 times [2019-09-09 05:45:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:06,360 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:06,361 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:06,361 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) [2019-09-09 05:45:06,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:45:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2019-09-09 05:45:06,429 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [118], [123], [128], [133], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [305], [309], [469], [472], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:06,437 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:06,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:06,526 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:06,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:06,633 INFO L272 AbstractInterpreter]: Visited 74 different actions 392 times. Merged at 57 different actions 291 times. Widened at 5 different actions 8 times. Performed 966 root evaluator evaluations with a maximum evaluation depth of 8. Performed 966 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 26 fixpoints after 12 different actions. Largest state had 87 variables. [2019-09-09 05:45:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:06,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:06,634 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-09 05:45:06,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:06,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:06,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-09 05:45:06,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-09 05:45:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:45:06,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:06,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:06,869 INFO L87 Difference]: Start difference. First operand 839 states and 1199 transitions. Second operand 3 states. [2019-09-09 05:45:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:06,894 INFO L93 Difference]: Finished difference Result 1421 states and 2044 transitions. [2019-09-09 05:45:06,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:06,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-09 05:45:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:06,899 INFO L225 Difference]: With dead ends: 1421 [2019-09-09 05:45:06,899 INFO L226 Difference]: Without dead ends: 954 [2019-09-09 05:45:06,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-09 05:45:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 950. [2019-09-09 05:45:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-09 05:45:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1358 transitions. [2019-09-09 05:45:06,922 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1358 transitions. Word has length 204 [2019-09-09 05:45:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:06,922 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1358 transitions. [2019-09-09 05:45:06,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1358 transitions. [2019-09-09 05:45:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-09 05:45:06,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:06,926 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:06,926 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:06,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash -886579779, now seen corresponding path program 1 times [2019-09-09 05:45:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:06,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-09 05:45:07,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:07,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:07,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:07,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:07,020 INFO L87 Difference]: Start difference. First operand 950 states and 1358 transitions. Second operand 3 states. [2019-09-09 05:45:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:07,188 INFO L93 Difference]: Finished difference Result 1052 states and 1490 transitions. [2019-09-09 05:45:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:07,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-09 05:45:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:07,194 INFO L225 Difference]: With dead ends: 1052 [2019-09-09 05:45:07,194 INFO L226 Difference]: Without dead ends: 1052 [2019-09-09 05:45:07,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-09-09 05:45:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1031. [2019-09-09 05:45:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-09-09 05:45:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1454 transitions. [2019-09-09 05:45:07,218 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1454 transitions. Word has length 210 [2019-09-09 05:45:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:07,218 INFO L475 AbstractCegarLoop]: Abstraction has 1031 states and 1454 transitions. [2019-09-09 05:45:07,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1454 transitions. [2019-09-09 05:45:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-09 05:45:07,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:07,222 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:07,223 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash -251384119, now seen corresponding path program 1 times [2019-09-09 05:45:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:07,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:07,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:07,253 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:07,253 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:07,253 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-09 05:45:07,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:07,277 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-09 05:45:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:07,317 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2019-09-09 05:45:07,318 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [413], [469], [472], [480], [485], [487], [489], [494], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:07,320 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:07,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:07,389 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:07,468 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:07,469 INFO L272 AbstractInterpreter]: Visited 72 different actions 385 times. Merged at 58 different actions 277 times. Widened at 6 different actions 11 times. Performed 891 root evaluator evaluations with a maximum evaluation depth of 8. Performed 891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 19 fixpoints after 5 different actions. Largest state had 88 variables. [2019-09-09 05:45:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:07,469 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:07,685 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 86.27% of their original sizes. [2019-09-09 05:45:07,686 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:12,249 INFO L420 sIntCurrentIteration]: We unified 232 AI predicates to 232 [2019-09-09 05:45:12,250 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:12,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:12,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2019-09-09 05:45:12,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:12,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-09 05:45:12,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-09 05:45:12,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2019-09-09 05:45:12,253 INFO L87 Difference]: Start difference. First operand 1031 states and 1454 transitions. Second operand 44 states. [2019-09-09 05:45:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:29,504 INFO L93 Difference]: Finished difference Result 1507 states and 2065 transitions. [2019-09-09 05:45:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-09 05:45:29,504 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 233 [2019-09-09 05:45:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:29,512 INFO L225 Difference]: With dead ends: 1507 [2019-09-09 05:45:29,513 INFO L226 Difference]: Without dead ends: 1491 [2019-09-09 05:45:29,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 174 SyntacticMatches, 16 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1072, Invalid=3484, Unknown=0, NotChecked=0, Total=4556 [2019-09-09 05:45:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-09-09 05:45:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1287. [2019-09-09 05:45:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-09-09 05:45:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1798 transitions. [2019-09-09 05:45:29,538 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1798 transitions. Word has length 233 [2019-09-09 05:45:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:29,539 INFO L475 AbstractCegarLoop]: Abstraction has 1287 states and 1798 transitions. [2019-09-09 05:45:29,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-09 05:45:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1798 transitions. [2019-09-09 05:45:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-09 05:45:29,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:29,544 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:29,544 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash 84274853, now seen corresponding path program 1 times [2019-09-09 05:45:29,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:29,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:29,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:29,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:29,561 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:29,562 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:29,562 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:45:29,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:29,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:45:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:29,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2019-09-09 05:45:29,631 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [13], [16], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [413], [469], [472], [480], [485], [487], [489], [494], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:29,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:29,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:29,702 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:29,852 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:29,852 INFO L272 AbstractInterpreter]: Visited 73 different actions 440 times. Merged at 58 different actions 324 times. Widened at 8 different actions 15 times. Performed 985 root evaluator evaluations with a maximum evaluation depth of 8. Performed 985 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 22 fixpoints after 8 different actions. Largest state had 88 variables. [2019-09-09 05:45:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:29,853 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:30,035 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 86.9% of their original sizes. [2019-09-09 05:45:30,036 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:33,686 INFO L420 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2019-09-09 05:45:33,686 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:33,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-09-09 05:45:33,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:33,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-09 05:45:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-09 05:45:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2019-09-09 05:45:33,688 INFO L87 Difference]: Start difference. First operand 1287 states and 1798 transitions. Second operand 39 states. [2019-09-09 05:45:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:52,869 INFO L93 Difference]: Finished difference Result 2066 states and 2780 transitions. [2019-09-09 05:45:52,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-09 05:45:52,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 234 [2019-09-09 05:45:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:52,878 INFO L225 Difference]: With dead ends: 2066 [2019-09-09 05:45:52,878 INFO L226 Difference]: Without dead ends: 2052 [2019-09-09 05:45:52,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 187 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=676, Invalid=2516, Unknown=0, NotChecked=0, Total=3192 [2019-09-09 05:45:52,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2019-09-09 05:45:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1623. [2019-09-09 05:45:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2019-09-09 05:45:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2233 transitions. [2019-09-09 05:45:52,910 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2233 transitions. Word has length 234 [2019-09-09 05:45:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:52,911 INFO L475 AbstractCegarLoop]: Abstraction has 1623 states and 2233 transitions. [2019-09-09 05:45:52,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-09 05:45:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2233 transitions. [2019-09-09 05:45:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-09 05:45:52,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:52,916 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:52,917 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash 635679001, now seen corresponding path program 1 times [2019-09-09 05:45:52,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:52,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:52,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:52,933 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:45:52,933 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:45:52,933 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-09 05:45:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:52,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:45:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:52,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2019-09-09 05:45:52,995 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [469], [472], [480], [485], [487], [489], [494], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:52,996 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:52,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:53,043 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:53,179 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:45:53,180 INFO L272 AbstractInterpreter]: Visited 76 different actions 470 times. Merged at 62 different actions 348 times. Widened at 8 different actions 15 times. Performed 1024 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 26 fixpoints after 15 different actions. Largest state had 89 variables. [2019-09-09 05:45:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:53,180 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:45:53,309 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 87.59% of their original sizes. [2019-09-09 05:45:53,309 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:45:56,810 INFO L420 sIntCurrentIteration]: We unified 236 AI predicates to 236 [2019-09-09 05:45:56,811 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:45:56,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:56,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2019-09-09 05:45:56,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:56,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-09 05:45:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-09 05:45:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2019-09-09 05:45:56,813 INFO L87 Difference]: Start difference. First operand 1623 states and 2233 transitions. Second operand 42 states. [2019-09-09 05:46:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:18,717 INFO L93 Difference]: Finished difference Result 2737 states and 3644 transitions. [2019-09-09 05:46:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-09 05:46:18,717 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 237 [2019-09-09 05:46:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:18,727 INFO L225 Difference]: With dead ends: 2737 [2019-09-09 05:46:18,727 INFO L226 Difference]: Without dead ends: 2711 [2019-09-09 05:46:18,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1513, Invalid=4649, Unknown=0, NotChecked=0, Total=6162 [2019-09-09 05:46:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2019-09-09 05:46:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2145. [2019-09-09 05:46:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-09-09 05:46:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2928 transitions. [2019-09-09 05:46:18,766 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2928 transitions. Word has length 237 [2019-09-09 05:46:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:18,767 INFO L475 AbstractCegarLoop]: Abstraction has 2145 states and 2928 transitions. [2019-09-09 05:46:18,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-09 05:46:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2928 transitions. [2019-09-09 05:46:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-09 05:46:18,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:18,772 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:18,773 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -78304049, now seen corresponding path program 1 times [2019-09-09 05:46:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:18,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:18,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:18,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:18,790 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:46:18,790 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:46:18,790 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:46:18,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:18,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:46:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:18,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2019-09-09 05:46:18,858 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [469], [472], [480], [485], [487], [489], [494], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:46:18,861 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:46:18,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:46:18,905 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:46:19,038 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:46:19,040 INFO L272 AbstractInterpreter]: Visited 89 different actions 428 times. Merged at 66 different actions 298 times. Widened at 7 different actions 13 times. Performed 973 root evaluator evaluations with a maximum evaluation depth of 8. Performed 973 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 22 fixpoints after 8 different actions. Largest state had 90 variables. [2019-09-09 05:46:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:19,040 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:46:19,281 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 87.93% of their original sizes. [2019-09-09 05:46:19,282 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:46:25,594 INFO L420 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2019-09-09 05:46:25,594 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:46:25,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:25,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2019-09-09 05:46:25,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:25,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-09 05:46:25,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-09 05:46:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1801, Unknown=0, NotChecked=0, Total=2352 [2019-09-09 05:46:25,597 INFO L87 Difference]: Start difference. First operand 2145 states and 2928 transitions. Second operand 49 states. [2019-09-09 05:47:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:49,630 INFO L93 Difference]: Finished difference Result 3983 states and 5445 transitions. [2019-09-09 05:47:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-09 05:47:49,631 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 266 [2019-09-09 05:47:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:49,647 INFO L225 Difference]: With dead ends: 3983 [2019-09-09 05:47:49,647 INFO L226 Difference]: Without dead ends: 3981 [2019-09-09 05:47:49,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 165 SyntacticMatches, 53 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4537 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3438, Invalid=8994, Unknown=0, NotChecked=0, Total=12432 [2019-09-09 05:47:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2019-09-09 05:47:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3350. [2019-09-09 05:47:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2019-09-09 05:47:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4620 transitions. [2019-09-09 05:47:49,707 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4620 transitions. Word has length 266 [2019-09-09 05:47:49,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:49,708 INFO L475 AbstractCegarLoop]: Abstraction has 3350 states and 4620 transitions. [2019-09-09 05:47:49,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-09 05:47:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4620 transitions. [2019-09-09 05:47:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-09 05:47:49,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:49,716 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:49,717 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:49,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1207257382, now seen corresponding path program 1 times [2019-09-09 05:47:49,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:49,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:49,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:49,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:49,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:49,735 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:47:49,735 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:47:49,735 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:47:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:49,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:47:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:49,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 307 with the following transitions: [2019-09-09 05:47:49,800 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [469], [472], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:47:49,802 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:49,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:49,850 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:50,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:50,566 INFO L272 AbstractInterpreter]: Visited 94 different actions 2068 times. Merged at 76 different actions 1730 times. Widened at 19 different actions 278 times. Performed 4862 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4862 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 213 fixpoints after 24 different actions. Largest state had 90 variables. [2019-09-09 05:47:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:50,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:50,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:50,566 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:50,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:50,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:47:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:50,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:47:50,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:47:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 616 proven. 26 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-09-09 05:47:50,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:47:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 616 proven. 26 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-09-09 05:47:50,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:47:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-09 05:47:50,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:47:50,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:47:50,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:47:50,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:47:50,817 INFO L87 Difference]: Start difference. First operand 3350 states and 4620 transitions. Second operand 6 states. [2019-09-09 05:47:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:51,390 INFO L93 Difference]: Finished difference Result 4141 states and 5781 transitions. [2019-09-09 05:47:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:47:51,390 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-09-09 05:47:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:51,404 INFO L225 Difference]: With dead ends: 4141 [2019-09-09 05:47:51,405 INFO L226 Difference]: Without dead ends: 4020 [2019-09-09 05:47:51,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:47:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2019-09-09 05:47:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3798. [2019-09-09 05:47:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3798 states. [2019-09-09 05:47:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 5309 transitions. [2019-09-09 05:47:51,461 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 5309 transitions. Word has length 306 [2019-09-09 05:47:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:51,461 INFO L475 AbstractCegarLoop]: Abstraction has 3798 states and 5309 transitions. [2019-09-09 05:47:51,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:47:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 5309 transitions. [2019-09-09 05:47:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-09 05:47:51,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:51,470 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:51,470 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1850247752, now seen corresponding path program 1 times [2019-09-09 05:47:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:51,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:51,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:51,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-09 05:47:51,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:51,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:51,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:51,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:51,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:51,626 INFO L87 Difference]: Start difference. First operand 3798 states and 5309 transitions. Second operand 3 states. [2019-09-09 05:47:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:51,781 INFO L93 Difference]: Finished difference Result 4014 states and 5555 transitions. [2019-09-09 05:47:51,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:51,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-09-09 05:47:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:51,798 INFO L225 Difference]: With dead ends: 4014 [2019-09-09 05:47:51,799 INFO L226 Difference]: Without dead ends: 4014 [2019-09-09 05:47:51,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2019-09-09 05:47:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 4002. [2019-09-09 05:47:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4002 states. [2019-09-09 05:47:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5543 transitions. [2019-09-09 05:47:51,856 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 5543 transitions. Word has length 375 [2019-09-09 05:47:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:51,856 INFO L475 AbstractCegarLoop]: Abstraction has 4002 states and 5543 transitions. [2019-09-09 05:47:51,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 5543 transitions. [2019-09-09 05:47:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-09-09 05:47:51,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:51,867 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:51,867 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1316513070, now seen corresponding path program 1 times [2019-09-09 05:47:51,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:51,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:51,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:51,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:51,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 969 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2019-09-09 05:47:52,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:47:52,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:47:52,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:47:52,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:47:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:47:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:52,066 INFO L87 Difference]: Start difference. First operand 4002 states and 5543 transitions. Second operand 3 states. [2019-09-09 05:47:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:47:52,230 INFO L93 Difference]: Finished difference Result 4230 states and 5801 transitions. [2019-09-09 05:47:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:47:52,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2019-09-09 05:47:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:47:52,242 INFO L225 Difference]: With dead ends: 4230 [2019-09-09 05:47:52,242 INFO L226 Difference]: Without dead ends: 4230 [2019-09-09 05:47:52,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:47:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2019-09-09 05:47:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4218. [2019-09-09 05:47:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4218 states. [2019-09-09 05:47:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4218 states to 4218 states and 5789 transitions. [2019-09-09 05:47:52,300 INFO L78 Accepts]: Start accepts. Automaton has 4218 states and 5789 transitions. Word has length 406 [2019-09-09 05:47:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:47:52,300 INFO L475 AbstractCegarLoop]: Abstraction has 4218 states and 5789 transitions. [2019-09-09 05:47:52,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:47:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4218 states and 5789 transitions. [2019-09-09 05:47:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-09 05:47:52,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:47:52,308 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:47:52,308 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:47:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1986402269, now seen corresponding path program 1 times [2019-09-09 05:47:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:47:52,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:52,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:52,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:47:52,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:47:52,328 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:47:52,328 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:47:52,328 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:47:52,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:52,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:47:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:52,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 440 with the following transitions: [2019-09-09 05:47:52,420 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:47:52,423 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:47:52,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:47:52,475 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:47:53,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:47:53,557 INFO L272 AbstractInterpreter]: Visited 106 different actions 2134 times. Merged at 86 different actions 1720 times. Widened at 21 different actions 275 times. Performed 5270 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5270 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 259 fixpoints after 30 different actions. Largest state had 94 variables. [2019-09-09 05:47:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:47:53,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:47:53,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:47:53,558 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:47:53,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:47:53,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:47:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:47:53,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-09 05:47:53,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:48:08,237 WARN L188 SmtUtils]: Spent 14.53 s on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-09 05:48:08,359 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-09 05:48:08,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:08,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:10,623 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2019-09-09 05:48:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 980 proven. 166 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-09-09 05:48:11,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:48:11,727 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-09 05:48:11,978 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-09 05:48:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:48:14,054 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse1 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse0 ssl3_accept_~ag_Z~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse1 ssl3_accept_~ag_Z~0))) (not (= (div .cse0 ssl3_accept_~ag_Z~0) 8641)) (< .cse1 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse3 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse2 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse3 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse2 ssl3_accept_~ag_Z~0) 0)) (not (= 8672 (div .cse3 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8640)) (not (= 8671 (div .cse5 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse5) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse5 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse7 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse6 ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse6 ssl3_accept_~ag_Z~0) 0)) (not (= 8672 (div .cse7 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse7 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse9 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse8 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse9 ssl3_accept_~ag_Z~0))) (not (= (mod .cse8 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse9 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse10 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse11 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse10 ssl3_accept_~ag_Z~0) 8640)) (not (= 8671 (div .cse11 ssl3_accept_~ag_Z~0))) (not (= (mod .cse10 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse11) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse11 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse13 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse12 ssl3_accept_~ag_Z~0) 8640)) (not (= (mod .cse12 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse13 ssl3_accept_~ag_Z~0))) (<= 0 .cse13) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse13 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse14 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse15 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse14 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse15 ssl3_accept_~ag_Z~0))) (not (= (mod .cse14 ssl3_accept_~ag_Z~0) 0)) (not (= 8672 (div .cse15 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse16 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8672 (div .cse16 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse16 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse18 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse17 ssl3_accept_~ag_Z~0) 8640)) (not (= (mod .cse17 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse18 ssl3_accept_~ag_Z~0))) (<= 0 .cse18) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse18 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse20 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse19 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse19 ssl3_accept_~ag_Z~0) 8639)) (not (= 8673 (div .cse20 ssl3_accept_~ag_Z~0))) (<= 0 .cse20) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse20 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse21 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse22 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse21 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse22 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse21 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse22 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse23 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse23 ssl3_accept_~ag_Z~0))) (<= 0 .cse23) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse23 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse24 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse25 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse24 ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse24 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse25 ssl3_accept_~ag_Z~0))) (< .cse25 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse26 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (not (= 8671 (div .cse26 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse26) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse26 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse28 (* 8672 ssl3_accept_~ag_Y~0)) (.cse27 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (= (mod .cse27 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse28 ssl3_accept_~ag_Z~0))) (<= 0 .cse28) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (= 0 (mod .cse28 ssl3_accept_~ag_Z~0)) (not (= (div .cse27 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse29 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse29 ssl3_accept_~ag_Z~0))) (<= 0 .cse29) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse29 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse30 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse30 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse30 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse32 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse31 ssl3_accept_~ag_Z~0) 0) (not (= 8671 (div .cse32 ssl3_accept_~ag_Z~0))) (not (= (div .cse31 ssl3_accept_~ag_Z~0) 8639)) (<= 0 .cse32) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse32 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse34 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse33 ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse33 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse34 ssl3_accept_~ag_Z~0))) (<= 0 .cse34) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse34 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse36 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse35 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse36 ssl3_accept_~ag_Z~0))) (not (= (div .cse35 ssl3_accept_~ag_Z~0) 8639)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse36 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse37 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse37 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8672 (div .cse37 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse38 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse38 ssl3_accept_~ag_Z~0))) (< .cse38 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse39 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse40 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse39 ssl3_accept_~ag_Z~0) 8640)) (not (= (mod .cse39 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse40 ssl3_accept_~ag_Z~0))) (< .cse40 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse42 (* 8672 ssl3_accept_~ag_Y~0)) (.cse41 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (= (mod .cse41 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse42 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse42 ssl3_accept_~ag_Z~0))) (not (= (div .cse41 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse44 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse43 ssl3_accept_~ag_Z~0) 8640)) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse43 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse44 ssl3_accept_~ag_Z~0))) (<= 0 .cse44) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse44 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse45 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse46 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse45 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse45 ssl3_accept_~ag_Z~0) 8639)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse46 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse46 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse48 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse47 ssl3_accept_~ag_Z~0) 8640)) (not (= (mod .cse47 ssl3_accept_~ag_Z~0) 0)) (not (= 8672 (div .cse48 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse48 0))))) is different from false [2019-09-09 05:48:16,109 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse1 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse0 ssl3_accept_~ag_Z~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse1 ssl3_accept_~ag_Z~0))) (not (= (div .cse0 ssl3_accept_~ag_Z~0) 8641)) (< .cse1 0)))) (forall ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 v_prenex_49)) (.cse3 (* 8672 v_prenex_49))) (or (< .cse2 0) (< v_prenex_50 0) (not (= (div .cse2 v_prenex_50) 8640)) (<= 0 .cse3) (not (= (mod .cse2 v_prenex_50) 0)) (not (= 8673 (div .cse3 v_prenex_50))) (= 0 (mod .cse3 v_prenex_50)) (<= 0 v_prenex_50)))) (forall ((v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse5 (* c_ssl3_accept_~ag_X~0 v_prenex_26)) (.cse4 (* 8672 v_prenex_26))) (or (< .cse4 0) (<= 0 v_prenex_25) (not (= (mod .cse5 v_prenex_25) 0)) (not (= (div .cse5 v_prenex_25) 8640)) (< .cse5 0) (not (= 8672 (div .cse4 v_prenex_25)))))) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_12)) (.cse7 (* 8672 v_prenex_12))) (or (not (= (div .cse6 v_prenex_11) 8640)) (not (= (mod .cse6 v_prenex_11) 0)) (<= 0 v_prenex_11) (= 0 (mod .cse7 v_prenex_11)) (<= 0 .cse7) (not (= 8673 (div .cse7 v_prenex_11))) (< v_prenex_11 0)))) (forall ((v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_36)) (.cse9 (* 8672 v_prenex_36))) (or (not (< .cse8 0)) (not (= (div .cse8 v_prenex_35) 8639)) (<= 0 .cse9) (not (= 8671 (div .cse9 v_prenex_35))) (< v_prenex_35 0) (= (mod .cse8 v_prenex_35) 0) (= 0 (mod .cse9 v_prenex_35))))) (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse11 (* 8672 v_prenex_20)) (.cse10 (* c_ssl3_accept_~ag_X~0 v_prenex_20))) (or (<= 0 v_prenex_19) (not (= (div .cse10 v_prenex_19) 8639)) (= 0 (mod .cse11 v_prenex_19)) (<= 0 .cse11) (not (< .cse10 0)) (not (= 8673 (div .cse11 v_prenex_19))) (< v_prenex_19 0) (= (mod .cse10 v_prenex_19) 0)))) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 v_prenex_18)) (.cse13 (* 8672 v_prenex_18))) (or (not (= (mod .cse12 v_prenex_17) 0)) (not (= (div .cse12 v_prenex_17) 8640)) (<= 0 v_prenex_17) (= 0 (mod .cse13 v_prenex_17)) (not (= 8673 (div .cse13 v_prenex_17))) (<= 0 .cse13)))) (forall ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse14 (* c_ssl3_accept_~ag_X~0 v_prenex_47)) (.cse15 (* 8672 v_prenex_47))) (or (not (< .cse14 0)) (<= 0 v_prenex_48) (not (= (div .cse14 v_prenex_48) 8641)) (not (= 0 (mod .cse15 v_prenex_48))) (= (mod .cse14 v_prenex_48) 0) (not (= 8672 (div .cse15 v_prenex_48)))))) (forall ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 v_prenex_38)) (.cse16 (* 8672 v_prenex_38))) (or (= 0 (mod .cse16 v_prenex_37)) (not (= (div .cse17 v_prenex_37) 8640)) (not (= 8673 (div .cse16 v_prenex_37))) (<= 0 v_prenex_37) (< .cse17 0) (not (= (mod .cse17 v_prenex_37) 0)) (<= 0 .cse16)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse19 (* 8672 v_prenex_6)) (.cse18 (* c_ssl3_accept_~ag_X~0 v_prenex_6))) (or (not (= (div .cse18 v_prenex_5) 8640)) (< .cse19 0) (< v_prenex_5 0) (not (= (mod .cse18 v_prenex_5) 0)) (not (= 8672 (div .cse19 v_prenex_5))) (< .cse18 0)))) (forall ((v_prenex_44 Int) (v_prenex_43 Int)) (let ((.cse21 (* 8672 v_prenex_44)) (.cse20 (* c_ssl3_accept_~ag_X~0 v_prenex_44))) (or (not (= (div .cse20 v_prenex_43) 8640)) (not (= 8672 (div .cse21 v_prenex_43))) (< .cse21 0) (< .cse20 0) (<= 0 v_prenex_43)))) (forall ((v_prenex_39 Int) (v_prenex_40 Int)) (let ((.cse22 (* 8672 v_prenex_40)) (.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_40))) (or (not (= 8672 (div .cse22 v_prenex_39))) (< v_prenex_39 0) (not (< .cse23 0)) (not (= 0 (mod .cse22 v_prenex_39))) (not (= (div .cse23 v_prenex_39) 8639)) (= (mod .cse23 v_prenex_39) 0)))) (forall ((v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_22)) (.cse25 (* 8672 v_prenex_22))) (or (< .cse24 0) (not (= 8672 (div .cse25 v_prenex_21))) (not (= (div .cse24 v_prenex_21) 8640)) (not (= (mod .cse24 v_prenex_21) 0)) (<= 0 v_prenex_21) (not (= 0 (mod .cse25 v_prenex_21)))))) (forall ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse27 (* 8672 v_prenex_51)) (.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_51))) (or (= (mod .cse26 v_prenex_52) 0) (< .cse27 0) (< v_prenex_52 0) (not (= 8672 (div .cse27 v_prenex_52))) (not (< .cse26 0)) (not (= (div .cse26 v_prenex_52) 8639))))) (forall ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_34)) (.cse29 (* 8672 v_prenex_34))) (or (not (= (div .cse28 v_prenex_33) 8640)) (<= 0 v_prenex_33) (< .cse28 0) (not (= 8672 (div .cse29 v_prenex_33))) (not (= 0 (mod .cse29 v_prenex_33)))))) (forall ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_53)) (.cse30 (* 8672 v_prenex_53))) (or (< .cse30 0) (not (= (mod .cse31 v_prenex_54) 0)) (not (= (div .cse31 v_prenex_54) 8640)) (not (= 8672 (div .cse30 v_prenex_54))) (< v_prenex_54 0)))) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse32 (* c_ssl3_accept_~ag_X~0 v_prenex_32)) (.cse33 (* 8672 v_prenex_32))) (or (< .cse32 0) (not (= (div .cse32 v_prenex_31) 8640)) (not (= 8673 (div .cse33 v_prenex_31))) (<= 0 .cse33) (<= 0 v_prenex_31) (= 0 (mod .cse33 v_prenex_31))))) (forall ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_8)) (.cse35 (* 8672 v_prenex_8))) (or (<= 0 v_prenex_7) (not (= (mod .cse34 v_prenex_7) 0)) (not (= (div .cse34 v_prenex_7) 8640)) (not (= 8672 (div .cse35 v_prenex_7))) (not (= 0 (mod .cse35 v_prenex_7)))))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse36 (* 8672 v_prenex_2)) (.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_2))) (or (not (= 0 (mod .cse36 v_prenex_1))) (not (= 8672 (div .cse36 v_prenex_1))) (< v_prenex_1 0) (< .cse37 0) (not (= (div .cse37 v_prenex_1) 8640)) (not (= (mod .cse37 v_prenex_1) 0))))) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse38 (* 8672 v_prenex_24)) (.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_24))) (or (<= 0 v_prenex_23) (< v_prenex_23 0) (<= 0 .cse38) (not (= (div .cse39 v_prenex_23) 8640)) (not (= 8673 (div .cse38 v_prenex_23))) (= 0 (mod .cse38 v_prenex_23)) (< .cse39 0)))) (forall ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_10)) (.cse41 (* 8672 v_prenex_10))) (or (not (= (mod .cse40 v_prenex_9) 0)) (<= 0 .cse41) (not (= (div .cse40 v_prenex_9) 8640)) (< v_prenex_9 0) (not (= 8671 (div .cse41 v_prenex_9))) (= 0 (mod .cse41 v_prenex_9))))) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (let ((.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_46)) (.cse43 (* 8672 v_prenex_46))) (or (not (= (div .cse42 v_prenex_45) 8640)) (<= 0 v_prenex_45) (not (= (mod .cse42 v_prenex_45) 0)) (< .cse43 0) (not (= 8672 (div .cse43 v_prenex_45)))))) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse44 (* 8672 v_prenex_30)) (.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_30))) (or (= 0 (mod .cse44 v_prenex_29)) (not (= 8673 (div .cse44 v_prenex_29))) (<= 0 .cse44) (<= 0 v_prenex_29) (not (< .cse45 0)) (not (= (div .cse45 v_prenex_29) 8641)) (= (mod .cse45 v_prenex_29) 0)))) (forall ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_42)) (.cse47 (* 8672 v_prenex_42))) (or (< v_prenex_41 0) (not (= (div .cse46 v_prenex_41) 8640)) (not (= 8672 (div .cse47 v_prenex_41))) (< .cse46 0) (not (= 0 (mod .cse47 v_prenex_41)))))) (forall ((v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse48 (* 8672 v_prenex_14)) (.cse49 (* c_ssl3_accept_~ag_X~0 v_prenex_14))) (or (not (= 8672 (div .cse48 v_prenex_13))) (not (= (mod .cse49 v_prenex_13) 0)) (< v_prenex_13 0) (not (= 0 (mod .cse48 v_prenex_13))) (not (= (div .cse49 v_prenex_13) 8640))))) (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse51 (* 8672 v_prenex_16)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_16))) (or (< .cse50 0) (not (= 8672 (div .cse51 v_prenex_15))) (< .cse51 0) (not (= (div .cse50 v_prenex_15) 8640)) (< v_prenex_15 0)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_4)) (.cse52 (* 8672 v_prenex_4))) (or (not (= 8671 (div .cse52 v_prenex_3))) (< .cse53 0) (= 0 (mod .cse52 v_prenex_3)) (not (= (div .cse53 v_prenex_3) 8640)) (< v_prenex_3 0) (not (= (mod .cse53 v_prenex_3) 0)) (<= 0 .cse52)))) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (let ((.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_28)) (.cse54 (* 8672 v_prenex_28))) (or (not (= 8671 (div .cse54 v_prenex_27))) (not (= (div .cse55 v_prenex_27) 8640)) (= 0 (mod .cse54 v_prenex_27)) (< v_prenex_27 0) (< .cse55 0) (<= 0 .cse54))))) is different from false [2019-09-09 05:48:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 936 proven. 102 refuted. 0 times theorem prover too weak. 857 trivial. 108 not checked. [2019-09-09 05:48:20,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:48:20,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-09 05:48:20,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:48:20,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:48:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:48:20,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2019-09-09 05:48:20,475 INFO L87 Difference]: Start difference. First operand 4218 states and 5789 transitions. Second operand 13 states. [2019-09-09 05:48:22,658 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-09 05:48:28,661 WARN L188 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 553 DAG size of output: 38 [2019-09-09 05:48:40,764 WARN L188 SmtUtils]: Spent 11.20 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-09 05:48:45,183 WARN L188 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-09 05:48:54,418 WARN L188 SmtUtils]: Spent 6.64 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-09 05:48:58,474 WARN L188 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-09 05:49:00,929 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-09 05:49:01,335 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-09 05:49:05,831 WARN L188 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 549 DAG size of output: 32 [2019-09-09 05:49:06,013 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse57 (* 8672 c_ssl3_accept_~ag_Y~0)) (.cse64 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse5 (div .cse64 c_ssl3_accept_~ag_Z~0)) (.cse8 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse4 (= (mod .cse64 c_ssl3_accept_~ag_Z~0) 0)) (.cse7 (<= 0 c_ssl3_accept_~ag_Z~0)) (.cse6 (< c_ssl3_accept_~ag_Z~0 0)) (.cse59 (= 0 (mod .cse57 c_ssl3_accept_~ag_Z~0))) (.cse58 (div .cse57 c_ssl3_accept_~ag_Z~0))) (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse1 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse0 ssl3_accept_~ag_Z~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse1 ssl3_accept_~ag_Z~0))) (not (= (div .cse0 ssl3_accept_~ag_Z~0) 8641)) (< .cse1 0)))) (forall ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 v_prenex_49)) (.cse3 (* 8672 v_prenex_49))) (or (< .cse2 0) (< v_prenex_50 0) (not (= (div .cse2 v_prenex_50) 8640)) (<= 0 .cse3) (not (= (mod .cse2 v_prenex_50) 0)) (not (= 8673 (div .cse3 v_prenex_50))) (= 0 (mod .cse3 v_prenex_50)) (<= 0 v_prenex_50)))) (or .cse4 (and (or (not (= .cse5 8671)) .cse6) (or .cse7 (not (= .cse5 8673)))) (not .cse8)) (forall ((v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse10 (* c_ssl3_accept_~ag_X~0 v_prenex_26)) (.cse9 (* 8672 v_prenex_26))) (or (< .cse9 0) (<= 0 v_prenex_25) (not (= (mod .cse10 v_prenex_25) 0)) (not (= (div .cse10 v_prenex_25) 8640)) (< .cse10 0) (not (= 8672 (div .cse9 v_prenex_25)))))) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (let ((.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_12)) (.cse12 (* 8672 v_prenex_12))) (or (not (= (div .cse11 v_prenex_11) 8640)) (not (= (mod .cse11 v_prenex_11) 0)) (<= 0 v_prenex_11) (= 0 (mod .cse12 v_prenex_11)) (<= 0 .cse12) (not (= 8673 (div .cse12 v_prenex_11))) (< v_prenex_11 0)))) (forall ((v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_36)) (.cse14 (* 8672 v_prenex_36))) (or (not (< .cse13 0)) (not (= (div .cse13 v_prenex_35) 8639)) (<= 0 .cse14) (not (= 8671 (div .cse14 v_prenex_35))) (< v_prenex_35 0) (= (mod .cse13 v_prenex_35) 0) (= 0 (mod .cse14 v_prenex_35))))) (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse16 (* 8672 v_prenex_20)) (.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_20))) (or (<= 0 v_prenex_19) (not (= (div .cse15 v_prenex_19) 8639)) (= 0 (mod .cse16 v_prenex_19)) (<= 0 .cse16) (not (< .cse15 0)) (not (= 8673 (div .cse16 v_prenex_19))) (< v_prenex_19 0) (= (mod .cse15 v_prenex_19) 0)))) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 v_prenex_18)) (.cse18 (* 8672 v_prenex_18))) (or (not (= (mod .cse17 v_prenex_17) 0)) (not (= (div .cse17 v_prenex_17) 8640)) (<= 0 v_prenex_17) (= 0 (mod .cse18 v_prenex_17)) (not (= 8673 (div .cse18 v_prenex_17))) (<= 0 .cse18)))) (forall ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_47)) (.cse20 (* 8672 v_prenex_47))) (or (not (< .cse19 0)) (<= 0 v_prenex_48) (not (= (div .cse19 v_prenex_48) 8641)) (not (= 0 (mod .cse20 v_prenex_48))) (= (mod .cse19 v_prenex_48) 0) (not (= 8672 (div .cse20 v_prenex_48)))))) (forall ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_38)) (.cse21 (* 8672 v_prenex_38))) (or (= 0 (mod .cse21 v_prenex_37)) (not (= (div .cse22 v_prenex_37) 8640)) (not (= 8673 (div .cse21 v_prenex_37))) (<= 0 v_prenex_37) (< .cse22 0) (not (= (mod .cse22 v_prenex_37) 0)) (<= 0 .cse21)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse24 (* 8672 v_prenex_6)) (.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_6))) (or (not (= (div .cse23 v_prenex_5) 8640)) (< .cse24 0) (< v_prenex_5 0) (not (= (mod .cse23 v_prenex_5) 0)) (not (= 8672 (div .cse24 v_prenex_5))) (< .cse23 0)))) (forall ((v_prenex_44 Int) (v_prenex_43 Int)) (let ((.cse26 (* 8672 v_prenex_44)) (.cse25 (* c_ssl3_accept_~ag_X~0 v_prenex_44))) (or (not (= (div .cse25 v_prenex_43) 8640)) (not (= 8672 (div .cse26 v_prenex_43))) (< .cse26 0) (< .cse25 0) (<= 0 v_prenex_43)))) (forall ((v_prenex_39 Int) (v_prenex_40 Int)) (let ((.cse27 (* 8672 v_prenex_40)) (.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_40))) (or (not (= 8672 (div .cse27 v_prenex_39))) (< v_prenex_39 0) (not (< .cse28 0)) (not (= 0 (mod .cse27 v_prenex_39))) (not (= (div .cse28 v_prenex_39) 8639)) (= (mod .cse28 v_prenex_39) 0)))) (forall ((v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse29 (* c_ssl3_accept_~ag_X~0 v_prenex_22)) (.cse30 (* 8672 v_prenex_22))) (or (< .cse29 0) (not (= 8672 (div .cse30 v_prenex_21))) (not (= (div .cse29 v_prenex_21) 8640)) (not (= (mod .cse29 v_prenex_21) 0)) (<= 0 v_prenex_21) (not (= 0 (mod .cse30 v_prenex_21)))))) (forall ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse32 (* 8672 v_prenex_51)) (.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_51))) (or (= (mod .cse31 v_prenex_52) 0) (< .cse32 0) (< v_prenex_52 0) (not (= 8672 (div .cse32 v_prenex_52))) (not (< .cse31 0)) (not (= (div .cse31 v_prenex_52) 8639))))) (forall ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_34)) (.cse34 (* 8672 v_prenex_34))) (or (not (= (div .cse33 v_prenex_33) 8640)) (<= 0 v_prenex_33) (< .cse33 0) (not (= 8672 (div .cse34 v_prenex_33))) (not (= 0 (mod .cse34 v_prenex_33)))))) (not (= c_ssl3_accept_~s__state~0 8672)) (forall ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse36 (* c_ssl3_accept_~ag_X~0 v_prenex_53)) (.cse35 (* 8672 v_prenex_53))) (or (< .cse35 0) (not (= (mod .cse36 v_prenex_54) 0)) (not (= (div .cse36 v_prenex_54) 8640)) (not (= 8672 (div .cse35 v_prenex_54))) (< v_prenex_54 0)))) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_32)) (.cse38 (* 8672 v_prenex_32))) (or (< .cse37 0) (not (= (div .cse37 v_prenex_31) 8640)) (not (= 8673 (div .cse38 v_prenex_31))) (<= 0 .cse38) (<= 0 v_prenex_31) (= 0 (mod .cse38 v_prenex_31))))) (forall ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_8)) (.cse40 (* 8672 v_prenex_8))) (or (<= 0 v_prenex_7) (not (= (mod .cse39 v_prenex_7) 0)) (not (= (div .cse39 v_prenex_7) 8640)) (not (= 8672 (div .cse40 v_prenex_7))) (not (= 0 (mod .cse40 v_prenex_7)))))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse41 (* 8672 v_prenex_2)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_2))) (or (not (= 0 (mod .cse41 v_prenex_1))) (not (= 8672 (div .cse41 v_prenex_1))) (< v_prenex_1 0) (< .cse42 0) (not (= (div .cse42 v_prenex_1) 8640)) (not (= (mod .cse42 v_prenex_1) 0))))) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse43 (* 8672 v_prenex_24)) (.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_24))) (or (<= 0 v_prenex_23) (< v_prenex_23 0) (<= 0 .cse43) (not (= (div .cse44 v_prenex_23) 8640)) (not (= 8673 (div .cse43 v_prenex_23))) (= 0 (mod .cse43 v_prenex_23)) (< .cse44 0)))) (or (not (= .cse5 8672)) (and .cse8 (not .cse4))) (forall ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_10)) (.cse46 (* 8672 v_prenex_10))) (or (not (= (mod .cse45 v_prenex_9) 0)) (<= 0 .cse46) (not (= (div .cse45 v_prenex_9) 8640)) (< v_prenex_9 0) (not (= 8671 (div .cse46 v_prenex_9))) (= 0 (mod .cse46 v_prenex_9))))) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 v_prenex_46)) (.cse48 (* 8672 v_prenex_46))) (or (not (= (div .cse47 v_prenex_45) 8640)) (<= 0 v_prenex_45) (not (= (mod .cse47 v_prenex_45) 0)) (< .cse48 0) (not (= 8672 (div .cse48 v_prenex_45)))))) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse49 (* 8672 v_prenex_30)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_30))) (or (= 0 (mod .cse49 v_prenex_29)) (not (= 8673 (div .cse49 v_prenex_29))) (<= 0 .cse49) (<= 0 v_prenex_29) (not (< .cse50 0)) (not (= (div .cse50 v_prenex_29) 8641)) (= (mod .cse50 v_prenex_29) 0)))) (forall ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse51 (* c_ssl3_accept_~ag_X~0 v_prenex_42)) (.cse52 (* 8672 v_prenex_42))) (or (< v_prenex_41 0) (not (= (div .cse51 v_prenex_41) 8640)) (not (= 8672 (div .cse52 v_prenex_41))) (< .cse51 0) (not (= 0 (mod .cse52 v_prenex_41)))))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse53 (* 8672 v_prenex_14)) (.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_14))) (or (not (= 8672 (div .cse53 v_prenex_13))) (not (= (mod .cse54 v_prenex_13) 0)) (< v_prenex_13 0) (not (= 0 (mod .cse53 v_prenex_13))) (not (= (div .cse54 v_prenex_13) 8640))))) (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse56 (* 8672 v_prenex_16)) (.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_16))) (or (< .cse55 0) (not (= 8672 (div .cse56 v_prenex_15))) (< .cse56 0) (not (= (div .cse55 v_prenex_15) 8640)) (< v_prenex_15 0)))) (or (<= 0 .cse57) (and (or (not (= 8673 .cse58)) .cse7) (or (not (= 8671 .cse58)) .cse6)) .cse59) (or (and (not .cse59) (< .cse57 0)) (not (= 8672 .cse58))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse61 (* c_ssl3_accept_~ag_X~0 v_prenex_4)) (.cse60 (* 8672 v_prenex_4))) (or (not (= 8671 (div .cse60 v_prenex_3))) (< .cse61 0) (= 0 (mod .cse60 v_prenex_3)) (not (= (div .cse61 v_prenex_3) 8640)) (< v_prenex_3 0) (not (= (mod .cse61 v_prenex_3) 0)) (<= 0 .cse60)))) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (let ((.cse63 (* c_ssl3_accept_~ag_X~0 v_prenex_28)) (.cse62 (* 8672 v_prenex_28))) (or (not (= 8671 (div .cse62 v_prenex_27))) (not (= (div .cse63 v_prenex_27) 8640)) (= 0 (mod .cse62 v_prenex_27)) (< v_prenex_27 0) (< .cse63 0) (<= 0 .cse62))))))) is different from false [2019-09-09 05:49:06,257 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse59 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse5 (div .cse59 c_ssl3_accept_~ag_Z~0)) (.cse6 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse4 (= (mod .cse59 c_ssl3_accept_~ag_Z~0) 0))) (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse1 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse0 ssl3_accept_~ag_Z~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse1 ssl3_accept_~ag_Z~0))) (not (= (div .cse0 ssl3_accept_~ag_Z~0) 8641)) (< .cse1 0)))) (forall ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 v_prenex_49)) (.cse3 (* 8672 v_prenex_49))) (or (< .cse2 0) (< v_prenex_50 0) (not (= (div .cse2 v_prenex_50) 8640)) (<= 0 .cse3) (not (= (mod .cse2 v_prenex_50) 0)) (not (= 8673 (div .cse3 v_prenex_50))) (= 0 (mod .cse3 v_prenex_50)) (<= 0 v_prenex_50)))) (or .cse4 (and (or (not (= .cse5 8671)) (< c_ssl3_accept_~ag_Z~0 0)) (or (<= 0 c_ssl3_accept_~ag_Z~0) (not (= .cse5 8673)))) (not .cse6)) (forall ((v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_26)) (.cse7 (* 8672 v_prenex_26))) (or (< .cse7 0) (<= 0 v_prenex_25) (not (= (mod .cse8 v_prenex_25) 0)) (not (= (div .cse8 v_prenex_25) 8640)) (< .cse8 0) (not (= 8672 (div .cse7 v_prenex_25)))))) (forall ((v_prenex_12 Int) (v_prenex_11 Int)) (let ((.cse9 (* c_ssl3_accept_~ag_X~0 v_prenex_12)) (.cse10 (* 8672 v_prenex_12))) (or (not (= (div .cse9 v_prenex_11) 8640)) (not (= (mod .cse9 v_prenex_11) 0)) (<= 0 v_prenex_11) (= 0 (mod .cse10 v_prenex_11)) (<= 0 .cse10) (not (= 8673 (div .cse10 v_prenex_11))) (< v_prenex_11 0)))) (forall ((v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_36)) (.cse12 (* 8672 v_prenex_36))) (or (not (< .cse11 0)) (not (= (div .cse11 v_prenex_35) 8639)) (<= 0 .cse12) (not (= 8671 (div .cse12 v_prenex_35))) (< v_prenex_35 0) (= (mod .cse11 v_prenex_35) 0) (= 0 (mod .cse12 v_prenex_35))))) (forall ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse14 (* 8672 v_prenex_20)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_20))) (or (<= 0 v_prenex_19) (not (= (div .cse13 v_prenex_19) 8639)) (= 0 (mod .cse14 v_prenex_19)) (<= 0 .cse14) (not (< .cse13 0)) (not (= 8673 (div .cse14 v_prenex_19))) (< v_prenex_19 0) (= (mod .cse13 v_prenex_19) 0)))) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_18)) (.cse16 (* 8672 v_prenex_18))) (or (not (= (mod .cse15 v_prenex_17) 0)) (not (= (div .cse15 v_prenex_17) 8640)) (<= 0 v_prenex_17) (= 0 (mod .cse16 v_prenex_17)) (not (= 8673 (div .cse16 v_prenex_17))) (<= 0 .cse16)))) (forall ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 v_prenex_47)) (.cse18 (* 8672 v_prenex_47))) (or (not (< .cse17 0)) (<= 0 v_prenex_48) (not (= (div .cse17 v_prenex_48) 8641)) (not (= 0 (mod .cse18 v_prenex_48))) (= (mod .cse17 v_prenex_48) 0) (not (= 8672 (div .cse18 v_prenex_48)))))) (forall ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse20 (* c_ssl3_accept_~ag_X~0 v_prenex_38)) (.cse19 (* 8672 v_prenex_38))) (or (= 0 (mod .cse19 v_prenex_37)) (not (= (div .cse20 v_prenex_37) 8640)) (not (= 8673 (div .cse19 v_prenex_37))) (<= 0 v_prenex_37) (< .cse20 0) (not (= (mod .cse20 v_prenex_37) 0)) (<= 0 .cse19)))) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse22 (* 8672 v_prenex_6)) (.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_6))) (or (not (= (div .cse21 v_prenex_5) 8640)) (< .cse22 0) (< v_prenex_5 0) (not (= (mod .cse21 v_prenex_5) 0)) (not (= 8672 (div .cse22 v_prenex_5))) (< .cse21 0)))) (forall ((v_prenex_44 Int) (v_prenex_43 Int)) (let ((.cse24 (* 8672 v_prenex_44)) (.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_44))) (or (not (= (div .cse23 v_prenex_43) 8640)) (not (= 8672 (div .cse24 v_prenex_43))) (< .cse24 0) (< .cse23 0) (<= 0 v_prenex_43)))) (forall ((v_prenex_39 Int) (v_prenex_40 Int)) (let ((.cse25 (* 8672 v_prenex_40)) (.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_40))) (or (not (= 8672 (div .cse25 v_prenex_39))) (< v_prenex_39 0) (not (< .cse26 0)) (not (= 0 (mod .cse25 v_prenex_39))) (not (= (div .cse26 v_prenex_39) 8639)) (= (mod .cse26 v_prenex_39) 0)))) (forall ((v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse27 (* c_ssl3_accept_~ag_X~0 v_prenex_22)) (.cse28 (* 8672 v_prenex_22))) (or (< .cse27 0) (not (= 8672 (div .cse28 v_prenex_21))) (not (= (div .cse27 v_prenex_21) 8640)) (not (= (mod .cse27 v_prenex_21) 0)) (<= 0 v_prenex_21) (not (= 0 (mod .cse28 v_prenex_21)))))) (forall ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse30 (* 8672 v_prenex_51)) (.cse29 (* c_ssl3_accept_~ag_X~0 v_prenex_51))) (or (= (mod .cse29 v_prenex_52) 0) (< .cse30 0) (< v_prenex_52 0) (not (= 8672 (div .cse30 v_prenex_52))) (not (< .cse29 0)) (not (= (div .cse29 v_prenex_52) 8639))))) (forall ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_34)) (.cse32 (* 8672 v_prenex_34))) (or (not (= (div .cse31 v_prenex_33) 8640)) (<= 0 v_prenex_33) (< .cse31 0) (not (= 8672 (div .cse32 v_prenex_33))) (not (= 0 (mod .cse32 v_prenex_33)))))) (forall ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_53)) (.cse33 (* 8672 v_prenex_53))) (or (< .cse33 0) (not (= (mod .cse34 v_prenex_54) 0)) (not (= (div .cse34 v_prenex_54) 8640)) (not (= 8672 (div .cse33 v_prenex_54))) (< v_prenex_54 0)))) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_32)) (.cse36 (* 8672 v_prenex_32))) (or (< .cse35 0) (not (= (div .cse35 v_prenex_31) 8640)) (not (= 8673 (div .cse36 v_prenex_31))) (<= 0 .cse36) (<= 0 v_prenex_31) (= 0 (mod .cse36 v_prenex_31))))) (forall ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_8)) (.cse38 (* 8672 v_prenex_8))) (or (<= 0 v_prenex_7) (not (= (mod .cse37 v_prenex_7) 0)) (not (= (div .cse37 v_prenex_7) 8640)) (not (= 8672 (div .cse38 v_prenex_7))) (not (= 0 (mod .cse38 v_prenex_7)))))) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (let ((.cse39 (* 8672 v_prenex_2)) (.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_2))) (or (not (= 0 (mod .cse39 v_prenex_1))) (not (= 8672 (div .cse39 v_prenex_1))) (< v_prenex_1 0) (< .cse40 0) (not (= (div .cse40 v_prenex_1) 8640)) (not (= (mod .cse40 v_prenex_1) 0))))) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse41 (* 8672 v_prenex_24)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_24))) (or (<= 0 v_prenex_23) (< v_prenex_23 0) (<= 0 .cse41) (not (= (div .cse42 v_prenex_23) 8640)) (not (= 8673 (div .cse41 v_prenex_23))) (= 0 (mod .cse41 v_prenex_23)) (< .cse42 0)))) (or (not (= .cse5 8672)) (and .cse6 (not .cse4))) (forall ((v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_10)) (.cse44 (* 8672 v_prenex_10))) (or (not (= (mod .cse43 v_prenex_9) 0)) (<= 0 .cse44) (not (= (div .cse43 v_prenex_9) 8640)) (< v_prenex_9 0) (not (= 8671 (div .cse44 v_prenex_9))) (= 0 (mod .cse44 v_prenex_9))))) (forall ((v_prenex_45 Int) (v_prenex_46 Int)) (let ((.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_46)) (.cse46 (* 8672 v_prenex_46))) (or (not (= (div .cse45 v_prenex_45) 8640)) (<= 0 v_prenex_45) (not (= (mod .cse45 v_prenex_45) 0)) (< .cse46 0) (not (= 8672 (div .cse46 v_prenex_45)))))) (forall ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse47 (* 8672 v_prenex_30)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_30))) (or (= 0 (mod .cse47 v_prenex_29)) (not (= 8673 (div .cse47 v_prenex_29))) (<= 0 .cse47) (<= 0 v_prenex_29) (not (< .cse48 0)) (not (= (div .cse48 v_prenex_29) 8641)) (= (mod .cse48 v_prenex_29) 0)))) (forall ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse49 (* c_ssl3_accept_~ag_X~0 v_prenex_42)) (.cse50 (* 8672 v_prenex_42))) (or (< v_prenex_41 0) (not (= (div .cse49 v_prenex_41) 8640)) (not (= 8672 (div .cse50 v_prenex_41))) (< .cse49 0) (not (= 0 (mod .cse50 v_prenex_41)))))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse51 (* 8672 v_prenex_14)) (.cse52 (* c_ssl3_accept_~ag_X~0 v_prenex_14))) (or (not (= 8672 (div .cse51 v_prenex_13))) (not (= (mod .cse52 v_prenex_13) 0)) (< v_prenex_13 0) (not (= 0 (mod .cse51 v_prenex_13))) (not (= (div .cse52 v_prenex_13) 8640))))) (forall ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse54 (* 8672 v_prenex_16)) (.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_16))) (or (< .cse53 0) (not (= 8672 (div .cse54 v_prenex_15))) (< .cse54 0) (not (= (div .cse53 v_prenex_15) 8640)) (< v_prenex_15 0)))) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse56 (* c_ssl3_accept_~ag_X~0 v_prenex_4)) (.cse55 (* 8672 v_prenex_4))) (or (not (= 8671 (div .cse55 v_prenex_3))) (< .cse56 0) (= 0 (mod .cse55 v_prenex_3)) (not (= (div .cse56 v_prenex_3) 8640)) (< v_prenex_3 0) (not (= (mod .cse56 v_prenex_3) 0)) (<= 0 .cse55)))) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (let ((.cse58 (* c_ssl3_accept_~ag_X~0 v_prenex_28)) (.cse57 (* 8672 v_prenex_28))) (or (not (= 8671 (div .cse57 v_prenex_27))) (not (= (div .cse58 v_prenex_27) 8640)) (= 0 (mod .cse57 v_prenex_27)) (< v_prenex_27 0) (< .cse58 0) (<= 0 .cse57))))))) is different from false [2019-09-09 05:49:11,483 WARN L188 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:49:19,070 WARN L188 SmtUtils]: Spent 3.36 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-09 05:49:22,255 WARN L188 SmtUtils]: Spent 3.06 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:49:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:22,587 INFO L93 Difference]: Finished difference Result 15414 states and 20932 transitions. [2019-09-09 05:49:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-09 05:49:22,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 439 [2019-09-09 05:49:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:22,616 INFO L225 Difference]: With dead ends: 15414 [2019-09-09 05:49:22,616 INFO L226 Difference]: Without dead ends: 13912 [2019-09-09 05:49:22,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 884 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 69.7s TimeCoverageRelationStatistics Valid=215, Invalid=551, Unknown=6, NotChecked=220, Total=992 [2019-09-09 05:49:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13912 states. [2019-09-09 05:49:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13912 to 7757. [2019-09-09 05:49:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7757 states. [2019-09-09 05:49:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7757 states to 7757 states and 10746 transitions. [2019-09-09 05:49:22,758 INFO L78 Accepts]: Start accepts. Automaton has 7757 states and 10746 transitions. Word has length 439 [2019-09-09 05:49:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:22,759 INFO L475 AbstractCegarLoop]: Abstraction has 7757 states and 10746 transitions. [2019-09-09 05:49:22,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:49:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7757 states and 10746 transitions. [2019-09-09 05:49:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-09-09 05:49:22,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:22,769 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:22,769 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:22,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1515166793, now seen corresponding path program 1 times [2019-09-09 05:49:22,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:22,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:22,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:22,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:22,793 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:49:22,794 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:49:22,794 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:49:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:22,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:49:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:22,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 442 with the following transitions: [2019-09-09 05:49:22,877 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [196], [198], [201], [203], [208], [213], [216], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:49:22,884 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:22,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:22,922 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:23,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:23,641 INFO L272 AbstractInterpreter]: Visited 108 different actions 2349 times. Merged at 90 different actions 1887 times. Widened at 22 different actions 311 times. Performed 5832 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 311 fixpoints after 32 different actions. Largest state had 94 variables. [2019-09-09 05:49:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:23,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:23,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:23,642 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:23,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:23,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-09 05:49:23,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:40,410 WARN L188 SmtUtils]: Spent 16.60 s on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-09 05:49:40,598 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-09 05:49:40,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:40,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 978 proven. 171 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-09-09 05:49:41,300 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:43,518 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-09-09 05:49:43,789 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-09-09 05:49:48,024 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-09 05:49:48,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:48,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:49:50,083 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0)) (.cse1 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse0 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse1 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse0 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse1 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse3 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse2 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse3 ssl3_accept_~ag_Z~0))) (not (= (div .cse2 ssl3_accept_~ag_Z~0) 8642)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< .cse3 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8641)) (< .cse5 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse7 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse6 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse6 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse7 ssl3_accept_~ag_Z~0))) (not (= 8673 (div .cse7 ssl3_accept_~ag_Z~0))) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse9 (* 8672 ssl3_accept_~ag_Y~0)) (.cse8 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse8 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse9) (not (= 8672 (div .cse9 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse9 ssl3_accept_~ag_Z~0)) (not (= (div .cse8 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse10 (* 8672 ssl3_accept_~ag_Y~0)) (.cse11 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse10 ssl3_accept_~ag_Z~0))) (not (= (mod .cse11 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse10 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse11 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse12 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse12 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse12 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse13 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse14 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse13 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse13 ssl3_accept_~ag_Z~0) 8640)) (<= 0 .cse14) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse14 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse14 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse15 (* 8672 ssl3_accept_~ag_Y~0)) (.cse16 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse15 ssl3_accept_~ag_Z~0))) (not (= (mod .cse16 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse15) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse15 ssl3_accept_~ag_Z~0)) (not (= (div .cse16 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse17 (* 8672 ssl3_accept_~ag_Y~0)) (.cse18 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse17 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse18 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse17) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse17 ssl3_accept_~ag_Z~0)) (not (= (div .cse18 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse19 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse19 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)) (< .cse19 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse20 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse20 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)) (< .cse20 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse21 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse22 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse21 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse22 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse21 ssl3_accept_~ag_Z~0) 8641)) (< .cse22 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse23 (* 8672 ssl3_accept_~ag_Y~0)) (.cse24 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse23 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse24 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse23 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse24 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse25 (* 8672 ssl3_accept_~ag_Y~0)) (.cse26 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse25 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse26 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse25) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse25 ssl3_accept_~ag_Z~0)) (not (= (div .cse26 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse27 (* 8672 ssl3_accept_~ag_Y~0)) (.cse28 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse27 ssl3_accept_~ag_Z~0))) (not (= (mod .cse28 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse27) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse27 ssl3_accept_~ag_Z~0)) (not (= (div .cse28 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse29 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse30 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse29 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse30 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse29 ssl3_accept_~ag_Z~0) 8641)) (< .cse30 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse31 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse31 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse31) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse31 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse32 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse33 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse32 ssl3_accept_~ag_Z~0) 0) (not (= 8674 (div .cse33 ssl3_accept_~ag_Z~0))) (not (= (div .cse32 ssl3_accept_~ag_Z~0) 8642)) (<= 0 .cse33) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (= 0 (mod .cse33 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse34 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse34) (not (= 8672 (div .cse34 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse34 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse36 (* 8672 ssl3_accept_~ag_Y~0)) (.cse35 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (= (mod .cse35 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse36 ssl3_accept_~ag_Z~0))) (not (= 8673 (div .cse36 ssl3_accept_~ag_Z~0))) (not (= (div .cse35 ssl3_accept_~ag_Z~0) 8642)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse37 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse37 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse37) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse37 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse39 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse38 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse39 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse38 ssl3_accept_~ag_Z~0) 8641)) (< .cse39 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse41 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse40 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse40 ssl3_accept_~ag_Z~0) 8640)) (not (= 8674 (div .cse41 ssl3_accept_~ag_Z~0))) (<= 0 .cse41) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse41 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse42 (* 8672 ssl3_accept_~ag_Y~0)) (.cse43 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse42 ssl3_accept_~ag_Z~0))) (not (= (mod .cse43 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse42 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse43 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse45 (* 8672 ssl3_accept_~ag_Y~0)) (.cse44 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse44 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse45) (not (= 8672 (div .cse45 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse45 ssl3_accept_~ag_Z~0)) (not (= (div .cse44 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse47 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse46 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse46 ssl3_accept_~ag_Z~0) 8640)) (not (= 8673 (div .cse47 ssl3_accept_~ag_Z~0))) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (< .cse47 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse48 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse48 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse48 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)))))) is different from false [2019-09-09 05:49:52,094 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0)) (.cse1 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse0 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse1 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse0 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse1 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse3 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse2 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse3 ssl3_accept_~ag_Z~0))) (not (= (div .cse2 ssl3_accept_~ag_Z~0) 8642)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< .cse3 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8641)) (< .cse5 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse7 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse6 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse6 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse7 ssl3_accept_~ag_Z~0))) (not (= 8673 (div .cse7 ssl3_accept_~ag_Z~0))) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse9 (* 8672 ssl3_accept_~ag_Y~0)) (.cse8 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse8 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse9) (not (= 8672 (div .cse9 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse9 ssl3_accept_~ag_Z~0)) (not (= (div .cse8 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse10 (* 8672 ssl3_accept_~ag_Y~0)) (.cse11 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse10 ssl3_accept_~ag_Z~0))) (not (= (mod .cse11 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse10 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse11 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse12 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse12 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse12 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse13 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse14 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse13 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse13 ssl3_accept_~ag_Z~0) 8640)) (<= 0 .cse14) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse14 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse14 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse15 (* 8672 ssl3_accept_~ag_Y~0)) (.cse16 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse15 ssl3_accept_~ag_Z~0))) (not (= (mod .cse16 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse15) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse15 ssl3_accept_~ag_Z~0)) (not (= (div .cse16 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse17 (* 8672 ssl3_accept_~ag_Y~0)) (.cse18 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse17 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse18 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse17) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse17 ssl3_accept_~ag_Z~0)) (not (= (div .cse18 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse19 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse19 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)) (< .cse19 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse20 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse20 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)) (< .cse20 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse21 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse22 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse21 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse22 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse21 ssl3_accept_~ag_Z~0) 8641)) (< .cse22 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse23 (* 8672 ssl3_accept_~ag_Y~0)) (.cse24 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse23 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse24 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse23 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse24 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse25 (* 8672 ssl3_accept_~ag_Y~0)) (.cse26 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse25 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse26 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse25) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse25 ssl3_accept_~ag_Z~0)) (not (= (div .cse26 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse27 (* 8672 ssl3_accept_~ag_Y~0)) (.cse28 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse27 ssl3_accept_~ag_Z~0))) (not (= (mod .cse28 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse27) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse27 ssl3_accept_~ag_Z~0)) (not (= (div .cse28 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse29 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse30 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse29 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse30 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse29 ssl3_accept_~ag_Z~0) 8641)) (< .cse30 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse31 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse31 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse31) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse31 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse32 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse33 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse32 ssl3_accept_~ag_Z~0) 0) (not (= 8674 (div .cse33 ssl3_accept_~ag_Z~0))) (not (= (div .cse32 ssl3_accept_~ag_Z~0) 8642)) (<= 0 .cse33) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (= 0 (mod .cse33 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse34 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse34) (not (= 8672 (div .cse34 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse34 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse36 (* 8672 ssl3_accept_~ag_Y~0)) (.cse35 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (= (mod .cse35 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse36 ssl3_accept_~ag_Z~0))) (not (= 8673 (div .cse36 ssl3_accept_~ag_Z~0))) (not (= (div .cse35 ssl3_accept_~ag_Z~0) 8642)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse37 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse37 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse37) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse37 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse39 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse38 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse39 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse38 ssl3_accept_~ag_Z~0) 8641)) (< .cse39 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse41 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse40 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse40 ssl3_accept_~ag_Z~0) 8640)) (not (= 8674 (div .cse41 ssl3_accept_~ag_Z~0))) (<= 0 .cse41) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse41 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse42 (* 8672 ssl3_accept_~ag_Y~0)) (.cse43 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse42 ssl3_accept_~ag_Z~0))) (not (= (mod .cse43 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse42 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse43 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse45 (* 8672 ssl3_accept_~ag_Y~0)) (.cse44 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse44 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse45) (not (= 8672 (div .cse45 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse45 ssl3_accept_~ag_Z~0)) (not (= (div .cse44 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse47 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse46 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse46 ssl3_accept_~ag_Z~0) 8640)) (not (= 8673 (div .cse47 ssl3_accept_~ag_Z~0))) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (< .cse47 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse48 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse48 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse48 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)))))) is different from true [2019-09-09 05:49:54,133 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_92)) (.cse0 (* 8672 v_prenex_92))) (or (<= 0 .cse0) (< .cse1 0) (not (= 8672 (div .cse0 v_prenex_91))) (not (= (div .cse1 v_prenex_91) 8641)) (= 0 (mod .cse0 v_prenex_91)) (< v_prenex_91 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* 8672 ssl3_accept_~ag_Y~0)) (.cse3 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse2 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse3 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse2 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse3 ssl3_accept_~ag_Z~0) 8641))))) (forall ((v_prenex_74 Int) (v_prenex_73 Int)) (let ((.cse4 (* 8672 v_prenex_74)) (.cse5 (* c_ssl3_accept_~ag_X~0 v_prenex_74))) (or (not (= 8673 (div .cse4 v_prenex_73))) (< .cse4 0) (< .cse5 0) (not (= (div .cse5 v_prenex_73) 8641)) (<= 0 v_prenex_73)))) (forall ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_62)) (.cse7 (* 8672 v_prenex_62))) (or (< v_prenex_61 0) (not (= (mod .cse6 v_prenex_61) 0)) (< .cse6 0) (not (= (div .cse6 v_prenex_61) 8641)) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_61)) (not (= 8672 (div .cse7 v_prenex_61)))))) (forall ((v_prenex_84 Int) (v_prenex_83 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_84)) (.cse9 (* 8672 v_prenex_84))) (or (not (= (div .cse8 v_prenex_83) 8641)) (not (= (mod .cse8 v_prenex_83) 0)) (< v_prenex_83 0) (= 0 (mod .cse9 v_prenex_83)) (<= 0 v_prenex_83) (<= 0 .cse9) (not (= 8674 (div .cse9 v_prenex_83)))))) (forall ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse10 (* 8672 v_prenex_64)) (.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_64))) (or (< v_prenex_63 0) (not (= 8673 (div .cse10 v_prenex_63))) (not (= (mod .cse11 v_prenex_63) 0)) (not (= 0 (mod .cse10 v_prenex_63))) (not (= (div .cse11 v_prenex_63) 8641))))) (forall ((v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse12 (* 8672 v_prenex_98)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_98))) (or (not (= 8673 (div .cse12 v_prenex_97))) (not (= (div .cse13 v_prenex_97) 8641)) (< v_prenex_97 0) (< .cse12 0) (not (= (mod .cse13 v_prenex_97) 0))))) (forall ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse15 (* 8672 v_prenex_56)) (.cse14 (* c_ssl3_accept_~ag_X~0 v_prenex_56))) (or (not (= (div .cse14 v_prenex_55) 8642)) (= (mod .cse14 v_prenex_55) 0) (< .cse15 0) (<= 0 v_prenex_55) (not (= 8673 (div .cse15 v_prenex_55))) (not (< .cse14 0))))) (forall ((v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 v_prenex_88)) (.cse16 (* 8672 v_prenex_88))) (or (= 0 (mod .cse16 v_prenex_87)) (not (= (div .cse17 v_prenex_87) 8641)) (<= 0 v_prenex_87) (< v_prenex_87 0) (<= 0 .cse16) (< .cse17 0) (not (= 8674 (div .cse16 v_prenex_87)))))) (forall ((v_prenex_99 Int) (v_prenex_100 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_100)) (.cse18 (* 8672 v_prenex_100))) (or (<= 0 .cse18) (not (< .cse19 0)) (= (mod .cse19 v_prenex_99) 0) (= 0 (mod .cse18 v_prenex_99)) (<= 0 v_prenex_99) (not (= (div .cse19 v_prenex_99) 8640)) (not (= 8674 (div .cse18 v_prenex_99))) (< v_prenex_99 0)))) (forall ((v_prenex_105 Int) (v_prenex_106 Int)) (let ((.cse21 (* 8672 v_prenex_105)) (.cse20 (* c_ssl3_accept_~ag_X~0 v_prenex_105))) (or (< v_prenex_106 0) (= (mod .cse20 v_prenex_106) 0) (< .cse21 0) (not (= 8673 (div .cse21 v_prenex_106))) (not (= (div .cse20 v_prenex_106) 8640)) (not (< .cse20 0))))) (forall ((v_prenex_101 Int) (v_prenex_102 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_101)) (.cse23 (* 8672 v_prenex_101))) (or (not (= (mod .cse22 v_prenex_102) 0)) (not (= 8673 (div .cse23 v_prenex_102))) (not (= (div .cse22 v_prenex_102) 8641)) (not (= 0 (mod .cse23 v_prenex_102))) (<= 0 v_prenex_102)))) (forall ((v_prenex_90 Int) (v_prenex_89 Int)) (let ((.cse24 (* 8672 v_prenex_90)) (.cse25 (* c_ssl3_accept_~ag_X~0 v_prenex_90))) (or (not (= 8674 (div .cse24 v_prenex_89))) (= (mod .cse25 v_prenex_89) 0) (= 0 (mod .cse24 v_prenex_89)) (<= 0 v_prenex_89) (<= 0 .cse24) (not (= (div .cse25 v_prenex_89) 8642)) (not (< .cse25 0))))) (forall ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse27 (* 8672 v_prenex_96)) (.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_96))) (or (< .cse26 0) (= 0 (mod .cse27 v_prenex_95)) (<= 0 v_prenex_95) (<= 0 .cse27) (not (= 8674 (div .cse27 v_prenex_95))) (not (= (div .cse26 v_prenex_95) 8641))))) (forall ((v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse28 (* 8672 v_prenex_103)) (.cse29 (* c_ssl3_accept_~ag_X~0 v_prenex_103))) (or (<= 0 .cse28) (not (= (div .cse29 v_prenex_104) 8641)) (< v_prenex_104 0) (not (= 8672 (div .cse28 v_prenex_104))) (= 0 (mod .cse28 v_prenex_104)) (not (= (mod .cse29 v_prenex_104) 0))))) (forall ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_68)) (.cse30 (* 8672 v_prenex_68))) (or (not (= 8672 (div .cse30 v_prenex_67))) (= (mod .cse31 v_prenex_67) 0) (not (< .cse31 0)) (< v_prenex_67 0) (= 0 (mod .cse30 v_prenex_67)) (not (= (div .cse31 v_prenex_67) 8640)) (<= 0 .cse30)))) (forall ((v_prenex_107 Int) (v_prenex_108 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_107)) (.cse32 (* 8672 v_prenex_107))) (or (not (= 8673 (div .cse32 v_prenex_108))) (not (= (div .cse33 v_prenex_108) 8641)) (<= 0 v_prenex_108) (< .cse33 0) (not (= 0 (mod .cse32 v_prenex_108)))))) (forall ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse34 (* 8672 v_prenex_58)) (.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_58))) (or (< .cse34 0) (< .cse35 0) (not (= 8673 (div .cse34 v_prenex_57))) (not (= (mod .cse35 v_prenex_57) 0)) (< v_prenex_57 0) (not (= (div .cse35 v_prenex_57) 8641))))) (forall ((v_prenex_78 Int) (v_prenex_77 Int)) (let ((.cse36 (* 8672 v_prenex_78)) (.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_78))) (or (not (= 8673 (div .cse36 v_prenex_77))) (<= 0 v_prenex_77) (not (= (div .cse37 v_prenex_77) 8641)) (< .cse36 0) (not (= (mod .cse37 v_prenex_77) 0))))) (forall ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 v_prenex_66)) (.cse39 (* 8672 v_prenex_66))) (or (< .cse38 0) (< v_prenex_65 0) (not (= 8673 (div .cse39 v_prenex_65))) (not (= (div .cse38 v_prenex_65) 8641)) (not (= 0 (mod .cse39 v_prenex_65)))))) (forall ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse41 (* 8672 v_prenex_80)) (.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_80))) (or (not (= (div .cse40 v_prenex_79) 8641)) (<= 0 v_prenex_79) (not (= 0 (mod .cse41 v_prenex_79))) (not (= (mod .cse40 v_prenex_79) 0)) (not (= 8673 (div .cse41 v_prenex_79))) (< .cse40 0)))) (forall ((v_prenex_69 Int) (v_prenex_70 Int)) (let ((.cse43 (* 8672 v_prenex_70)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_70))) (or (not (= (mod .cse42 v_prenex_69) 0)) (<= 0 .cse43) (<= 0 v_prenex_69) (not (= 8674 (div .cse43 v_prenex_69))) (= 0 (mod .cse43 v_prenex_69)) (not (= (div .cse42 v_prenex_69) 8641))))) (forall ((v_prenex_85 Int) (v_prenex_86 Int)) (let ((.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_86)) (.cse44 (* 8672 v_prenex_86))) (or (<= 0 v_prenex_85) (< .cse44 0) (not (= (mod .cse45 v_prenex_85) 0)) (not (= (div .cse45 v_prenex_85) 8641)) (< .cse45 0) (not (= 8673 (div .cse44 v_prenex_85)))))) (forall ((v_prenex_76 Int) (v_prenex_75 Int)) (let ((.cse46 (* 8672 v_prenex_76)) (.cse47 (* c_ssl3_accept_~ag_X~0 v_prenex_76))) (or (< .cse46 0) (not (= 8673 (div .cse46 v_prenex_75))) (< .cse47 0) (not (= (div .cse47 v_prenex_75) 8641)) (< v_prenex_75 0)))) (forall ((v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse49 (* 8672 v_prenex_94)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_94))) (or (not (< .cse48 0)) (not (= 0 (mod .cse49 v_prenex_93))) (not (= (div .cse48 v_prenex_93) 8642)) (<= 0 v_prenex_93) (not (= 8673 (div .cse49 v_prenex_93))) (= (mod .cse48 v_prenex_93) 0)))) (forall ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_60)) (.cse51 (* 8672 v_prenex_60))) (or (= (mod .cse50 v_prenex_59) 0) (not (< .cse50 0)) (not (= (div .cse50 v_prenex_59) 8640)) (not (= 0 (mod .cse51 v_prenex_59))) (< v_prenex_59 0) (not (= 8673 (div .cse51 v_prenex_59)))))) (forall ((v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse52 (* 8672 v_prenex_72)) (.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_72))) (or (= 0 (mod .cse52 v_prenex_71)) (not (= (mod .cse53 v_prenex_71) 0)) (< .cse53 0) (not (= 8674 (div .cse52 v_prenex_71))) (<= 0 .cse52) (<= 0 v_prenex_71) (not (= (div .cse53 v_prenex_71) 8641)) (< v_prenex_71 0)))) (forall ((v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse55 (* 8672 v_prenex_82)) (.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_82))) (or (<= 0 v_prenex_81) (not (= (mod .cse54 v_prenex_81) 0)) (not (= (div .cse54 v_prenex_81) 8641)) (not (= 8674 (div .cse55 v_prenex_81))) (<= 0 .cse55) (= 0 (mod .cse55 v_prenex_81)) (< .cse54 0))))) is different from false [2019-09-09 05:49:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 936 proven. 104 refuted. 0 times theorem prover too weak. 857 trivial. 109 not checked. [2019-09-09 05:49:58,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:49:58,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-09 05:49:58,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:58,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:49:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:49:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=81, Unknown=4, NotChecked=38, Total=156 [2019-09-09 05:49:58,431 INFO L87 Difference]: Start difference. First operand 7757 states and 10746 transitions. Second operand 13 states. [2019-09-09 05:50:04,132 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0)) (.cse1 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse0 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse1 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse0 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse1 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse3 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse2 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse3 ssl3_accept_~ag_Z~0))) (not (= (div .cse2 ssl3_accept_~ag_Z~0) 8642)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< .cse3 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8641)) (< .cse5 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse7 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse6 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse6 ssl3_accept_~ag_Z~0) 8640)) (not (= 0 (mod .cse7 ssl3_accept_~ag_Z~0))) (not (= 8673 (div .cse7 ssl3_accept_~ag_Z~0))) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse9 (* 8672 ssl3_accept_~ag_Y~0)) (.cse8 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse8 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse9) (not (= 8672 (div .cse9 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse9 ssl3_accept_~ag_Z~0)) (not (= (div .cse8 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse10 (* 8672 ssl3_accept_~ag_Y~0)) (.cse11 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse10 ssl3_accept_~ag_Z~0))) (not (= (mod .cse11 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse10 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse11 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse12 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse12 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse12 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse13 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse14 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse13 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse13 ssl3_accept_~ag_Z~0) 8640)) (<= 0 .cse14) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse14 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse14 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse15 (* 8672 ssl3_accept_~ag_Y~0)) (.cse16 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse15 ssl3_accept_~ag_Z~0))) (not (= (mod .cse16 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse15) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse15 ssl3_accept_~ag_Z~0)) (not (= (div .cse16 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse17 (* 8672 ssl3_accept_~ag_Y~0)) (.cse18 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse17 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse18 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse17) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse17 ssl3_accept_~ag_Z~0)) (not (= (div .cse18 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse19 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse19 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)) (< .cse19 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse20 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse20 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)) (< .cse20 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse21 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse22 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse21 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse22 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse21 ssl3_accept_~ag_Z~0) 8641)) (< .cse22 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse23 (* 8672 ssl3_accept_~ag_Y~0)) (.cse24 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse23 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse24 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse23 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse24 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse25 (* 8672 ssl3_accept_~ag_Y~0)) (.cse26 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse25 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse26 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse25) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse25 ssl3_accept_~ag_Z~0)) (not (= (div .cse26 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse27 (* 8672 ssl3_accept_~ag_Y~0)) (.cse28 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse27 ssl3_accept_~ag_Z~0))) (not (= (mod .cse28 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse27) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse27 ssl3_accept_~ag_Z~0)) (not (= (div .cse28 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse29 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse30 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse29 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse30 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse29 ssl3_accept_~ag_Z~0) 8641)) (< .cse30 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse31 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse31 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse31) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse31 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (not (= c_ssl3_accept_~s__state~0 8673)) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse32 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse33 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse32 ssl3_accept_~ag_Z~0) 0) (not (= 8674 (div .cse33 ssl3_accept_~ag_Z~0))) (not (= (div .cse32 ssl3_accept_~ag_Z~0) 8642)) (<= 0 .cse33) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (= 0 (mod .cse33 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse34 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse34) (not (= 8672 (div .cse34 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse34 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse36 (* 8672 ssl3_accept_~ag_Y~0)) (.cse35 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (= (mod .cse35 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse36 ssl3_accept_~ag_Z~0))) (not (= 8673 (div .cse36 ssl3_accept_~ag_Z~0))) (not (= (div .cse35 ssl3_accept_~ag_Z~0) 8642)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse37 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8674 (div .cse37 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse37) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse37 ssl3_accept_~ag_Z~0)) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse39 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse38 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse39 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse38 ssl3_accept_~ag_Z~0) 8641)) (< .cse39 0)))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse41 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse40 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse40 ssl3_accept_~ag_Z~0) 8640)) (not (= 8674 (div .cse41 ssl3_accept_~ag_Z~0))) (<= 0 .cse41) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse41 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse42 (* 8672 ssl3_accept_~ag_Y~0)) (.cse43 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse42 ssl3_accept_~ag_Z~0))) (not (= (mod .cse43 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse42 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse43 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse45 (* 8672 ssl3_accept_~ag_Y~0)) (.cse44 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse44 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse45) (not (= 8672 (div .cse45 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse45 ssl3_accept_~ag_Z~0)) (not (= (div .cse44 ssl3_accept_~ag_Z~0) 8641))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse47 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse46 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse46 ssl3_accept_~ag_Z~0) 8640)) (not (= 8673 (div .cse47 ssl3_accept_~ag_Z~0))) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (< .cse47 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse48 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse48 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse48 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8641)))))) is different from true [2019-09-09 05:50:10,305 WARN L188 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-09 05:50:28,714 WARN L188 SmtUtils]: Spent 18.37 s on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-09-09 05:50:45,394 WARN L188 SmtUtils]: Spent 16.64 s on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-09-09 05:50:49,546 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-09 05:51:00,655 WARN L188 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-09 05:51:44,518 WARN L188 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-09 05:52:03,055 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2019-09-09 05:52:03,245 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-09 05:52:13,966 WARN L188 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 547 DAG size of output: 33 [2019-09-09 05:52:17,299 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-09 05:52:19,432 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-09 05:52:32,577 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (* 8672 c_ssl3_accept_~ag_Y~0)) (.cse64 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse19 (< c_ssl3_accept_~ag_Z~0 0)) (.cse20 (<= 0 c_ssl3_accept_~ag_Z~0)) (.cse17 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse16 (= (mod .cse64 c_ssl3_accept_~ag_Z~0) 0)) (.cse18 (div .cse64 c_ssl3_accept_~ag_Z~0)) (.cse23 (div .cse24 c_ssl3_accept_~ag_Z~0)) (.cse25 (= 0 (mod .cse24 c_ssl3_accept_~ag_Z~0)))) (and (forall ((v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_92)) (.cse0 (* 8672 v_prenex_92))) (or (<= 0 .cse0) (< .cse1 0) (not (= 8672 (div .cse0 v_prenex_91))) (not (= (div .cse1 v_prenex_91) 8641)) (= 0 (mod .cse0 v_prenex_91)) (< v_prenex_91 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* 8672 ssl3_accept_~ag_Y~0)) (.cse3 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse2 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse3 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse2 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse3 ssl3_accept_~ag_Z~0) 8641))))) (forall ((v_prenex_74 Int) (v_prenex_73 Int)) (let ((.cse4 (* 8672 v_prenex_74)) (.cse5 (* c_ssl3_accept_~ag_X~0 v_prenex_74))) (or (not (= 8673 (div .cse4 v_prenex_73))) (< .cse4 0) (< .cse5 0) (not (= (div .cse5 v_prenex_73) 8641)) (<= 0 v_prenex_73)))) (forall ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_62)) (.cse7 (* 8672 v_prenex_62))) (or (< v_prenex_61 0) (not (= (mod .cse6 v_prenex_61) 0)) (< .cse6 0) (not (= (div .cse6 v_prenex_61) 8641)) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_61)) (not (= 8672 (div .cse7 v_prenex_61)))))) (forall ((v_prenex_84 Int) (v_prenex_83 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_84)) (.cse9 (* 8672 v_prenex_84))) (or (not (= (div .cse8 v_prenex_83) 8641)) (not (= (mod .cse8 v_prenex_83) 0)) (< v_prenex_83 0) (= 0 (mod .cse9 v_prenex_83)) (<= 0 v_prenex_83) (<= 0 .cse9) (not (= 8674 (div .cse9 v_prenex_83)))))) (forall ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse10 (* 8672 v_prenex_64)) (.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_64))) (or (< v_prenex_63 0) (not (= 8673 (div .cse10 v_prenex_63))) (not (= (mod .cse11 v_prenex_63) 0)) (not (= 0 (mod .cse10 v_prenex_63))) (not (= (div .cse11 v_prenex_63) 8641))))) (forall ((v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse12 (* 8672 v_prenex_98)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_98))) (or (not (= 8673 (div .cse12 v_prenex_97))) (not (= (div .cse13 v_prenex_97) 8641)) (< v_prenex_97 0) (< .cse12 0) (not (= (mod .cse13 v_prenex_97) 0))))) (forall ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse15 (* 8672 v_prenex_56)) (.cse14 (* c_ssl3_accept_~ag_X~0 v_prenex_56))) (or (not (= (div .cse14 v_prenex_55) 8642)) (= (mod .cse14 v_prenex_55) 0) (< .cse15 0) (<= 0 v_prenex_55) (not (= 8673 (div .cse15 v_prenex_55))) (not (< .cse14 0))))) (or .cse16 (not .cse17) (and (or (not (= .cse18 8672)) .cse19) (or (not (= .cse18 8674)) .cse20))) (forall ((v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_88)) (.cse21 (* 8672 v_prenex_88))) (or (= 0 (mod .cse21 v_prenex_87)) (not (= (div .cse22 v_prenex_87) 8641)) (<= 0 v_prenex_87) (< v_prenex_87 0) (<= 0 .cse21) (< .cse22 0) (not (= 8674 (div .cse21 v_prenex_87)))))) (or (and (or (not (= 8672 .cse23)) .cse19) (or (not (= 8674 .cse23)) .cse20)) (<= 0 .cse24) .cse25) (forall ((v_prenex_99 Int) (v_prenex_100 Int)) (let ((.cse27 (* c_ssl3_accept_~ag_X~0 v_prenex_100)) (.cse26 (* 8672 v_prenex_100))) (or (<= 0 .cse26) (not (< .cse27 0)) (= (mod .cse27 v_prenex_99) 0) (= 0 (mod .cse26 v_prenex_99)) (<= 0 v_prenex_99) (not (= (div .cse27 v_prenex_99) 8640)) (not (= 8674 (div .cse26 v_prenex_99))) (< v_prenex_99 0)))) (forall ((v_prenex_105 Int) (v_prenex_106 Int)) (let ((.cse29 (* 8672 v_prenex_105)) (.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_105))) (or (< v_prenex_106 0) (= (mod .cse28 v_prenex_106) 0) (< .cse29 0) (not (= 8673 (div .cse29 v_prenex_106))) (not (= (div .cse28 v_prenex_106) 8640)) (not (< .cse28 0))))) (forall ((v_prenex_101 Int) (v_prenex_102 Int)) (let ((.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_101)) (.cse31 (* 8672 v_prenex_101))) (or (not (= (mod .cse30 v_prenex_102) 0)) (not (= 8673 (div .cse31 v_prenex_102))) (not (= (div .cse30 v_prenex_102) 8641)) (not (= 0 (mod .cse31 v_prenex_102))) (<= 0 v_prenex_102)))) (forall ((v_prenex_90 Int) (v_prenex_89 Int)) (let ((.cse32 (* 8672 v_prenex_90)) (.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_90))) (or (not (= 8674 (div .cse32 v_prenex_89))) (= (mod .cse33 v_prenex_89) 0) (= 0 (mod .cse32 v_prenex_89)) (<= 0 v_prenex_89) (<= 0 .cse32) (not (= (div .cse33 v_prenex_89) 8642)) (not (< .cse33 0))))) (or (and .cse17 (not .cse16)) (not (= .cse18 8673))) (forall ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse35 (* 8672 v_prenex_96)) (.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_96))) (or (< .cse34 0) (= 0 (mod .cse35 v_prenex_95)) (<= 0 v_prenex_95) (<= 0 .cse35) (not (= 8674 (div .cse35 v_prenex_95))) (not (= (div .cse34 v_prenex_95) 8641))))) (forall ((v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse36 (* 8672 v_prenex_103)) (.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_103))) (or (<= 0 .cse36) (not (= (div .cse37 v_prenex_104) 8641)) (< v_prenex_104 0) (not (= 8672 (div .cse36 v_prenex_104))) (= 0 (mod .cse36 v_prenex_104)) (not (= (mod .cse37 v_prenex_104) 0))))) (forall ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_68)) (.cse38 (* 8672 v_prenex_68))) (or (not (= 8672 (div .cse38 v_prenex_67))) (= (mod .cse39 v_prenex_67) 0) (not (< .cse39 0)) (< v_prenex_67 0) (= 0 (mod .cse38 v_prenex_67)) (not (= (div .cse39 v_prenex_67) 8640)) (<= 0 .cse38)))) (forall ((v_prenex_107 Int) (v_prenex_108 Int)) (let ((.cse41 (* c_ssl3_accept_~ag_X~0 v_prenex_107)) (.cse40 (* 8672 v_prenex_107))) (or (not (= 8673 (div .cse40 v_prenex_108))) (not (= (div .cse41 v_prenex_108) 8641)) (<= 0 v_prenex_108) (< .cse41 0) (not (= 0 (mod .cse40 v_prenex_108)))))) (forall ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse42 (* 8672 v_prenex_58)) (.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_58))) (or (< .cse42 0) (< .cse43 0) (not (= 8673 (div .cse42 v_prenex_57))) (not (= (mod .cse43 v_prenex_57) 0)) (< v_prenex_57 0) (not (= (div .cse43 v_prenex_57) 8641))))) (forall ((v_prenex_78 Int) (v_prenex_77 Int)) (let ((.cse44 (* 8672 v_prenex_78)) (.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_78))) (or (not (= 8673 (div .cse44 v_prenex_77))) (<= 0 v_prenex_77) (not (= (div .cse45 v_prenex_77) 8641)) (< .cse44 0) (not (= (mod .cse45 v_prenex_77) 0))))) (forall ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_66)) (.cse47 (* 8672 v_prenex_66))) (or (< .cse46 0) (< v_prenex_65 0) (not (= 8673 (div .cse47 v_prenex_65))) (not (= (div .cse46 v_prenex_65) 8641)) (not (= 0 (mod .cse47 v_prenex_65)))))) (forall ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse49 (* 8672 v_prenex_80)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_80))) (or (not (= (div .cse48 v_prenex_79) 8641)) (<= 0 v_prenex_79) (not (= 0 (mod .cse49 v_prenex_79))) (not (= (mod .cse48 v_prenex_79) 0)) (not (= 8673 (div .cse49 v_prenex_79))) (< .cse48 0)))) (not (= c_ssl3_accept_~s__state~0 8673)) (forall ((v_prenex_69 Int) (v_prenex_70 Int)) (let ((.cse51 (* 8672 v_prenex_70)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_70))) (or (not (= (mod .cse50 v_prenex_69) 0)) (<= 0 .cse51) (<= 0 v_prenex_69) (not (= 8674 (div .cse51 v_prenex_69))) (= 0 (mod .cse51 v_prenex_69)) (not (= (div .cse50 v_prenex_69) 8641))))) (or (not (= 8673 .cse23)) (and (not .cse25) (< .cse24 0))) (forall ((v_prenex_85 Int) (v_prenex_86 Int)) (let ((.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_86)) (.cse52 (* 8672 v_prenex_86))) (or (<= 0 v_prenex_85) (< .cse52 0) (not (= (mod .cse53 v_prenex_85) 0)) (not (= (div .cse53 v_prenex_85) 8641)) (< .cse53 0) (not (= 8673 (div .cse52 v_prenex_85)))))) (forall ((v_prenex_76 Int) (v_prenex_75 Int)) (let ((.cse54 (* 8672 v_prenex_76)) (.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_76))) (or (< .cse54 0) (not (= 8673 (div .cse54 v_prenex_75))) (< .cse55 0) (not (= (div .cse55 v_prenex_75) 8641)) (< v_prenex_75 0)))) (forall ((v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse57 (* 8672 v_prenex_94)) (.cse56 (* c_ssl3_accept_~ag_X~0 v_prenex_94))) (or (not (< .cse56 0)) (not (= 0 (mod .cse57 v_prenex_93))) (not (= (div .cse56 v_prenex_93) 8642)) (<= 0 v_prenex_93) (not (= 8673 (div .cse57 v_prenex_93))) (= (mod .cse56 v_prenex_93) 0)))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse58 (* c_ssl3_accept_~ag_X~0 v_prenex_60)) (.cse59 (* 8672 v_prenex_60))) (or (= (mod .cse58 v_prenex_59) 0) (not (< .cse58 0)) (not (= (div .cse58 v_prenex_59) 8640)) (not (= 0 (mod .cse59 v_prenex_59))) (< v_prenex_59 0) (not (= 8673 (div .cse59 v_prenex_59)))))) (forall ((v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse60 (* 8672 v_prenex_72)) (.cse61 (* c_ssl3_accept_~ag_X~0 v_prenex_72))) (or (= 0 (mod .cse60 v_prenex_71)) (not (= (mod .cse61 v_prenex_71) 0)) (< .cse61 0) (not (= 8674 (div .cse60 v_prenex_71))) (<= 0 .cse60) (<= 0 v_prenex_71) (not (= (div .cse61 v_prenex_71) 8641)) (< v_prenex_71 0)))) (forall ((v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse63 (* 8672 v_prenex_82)) (.cse62 (* c_ssl3_accept_~ag_X~0 v_prenex_82))) (or (<= 0 v_prenex_81) (not (= (mod .cse62 v_prenex_81) 0)) (not (= (div .cse62 v_prenex_81) 8641)) (not (= 8674 (div .cse63 v_prenex_81))) (<= 0 .cse63) (= 0 (mod .cse63 v_prenex_81)) (< .cse62 0))))))) is different from false [2019-09-09 05:52:34,250 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-09 05:52:34,749 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse24 (* 8672 c_ssl3_accept_~ag_Y~0)) (.cse64 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse19 (< c_ssl3_accept_~ag_Z~0 0)) (.cse20 (<= 0 c_ssl3_accept_~ag_Z~0)) (.cse17 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse16 (= (mod .cse64 c_ssl3_accept_~ag_Z~0) 0)) (.cse18 (div .cse64 c_ssl3_accept_~ag_Z~0)) (.cse23 (div .cse24 c_ssl3_accept_~ag_Z~0)) (.cse25 (= 0 (mod .cse24 c_ssl3_accept_~ag_Z~0)))) (and (forall ((v_prenex_92 Int) (v_prenex_91 Int)) (let ((.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_92)) (.cse0 (* 8672 v_prenex_92))) (or (<= 0 .cse0) (< .cse1 0) (not (= 8672 (div .cse0 v_prenex_91))) (not (= (div .cse1 v_prenex_91) 8641)) (= 0 (mod .cse0 v_prenex_91)) (< v_prenex_91 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* 8672 ssl3_accept_~ag_Y~0)) (.cse3 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse2 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse3 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse2 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (not (= (div .cse3 ssl3_accept_~ag_Z~0) 8641))))) (forall ((v_prenex_74 Int) (v_prenex_73 Int)) (let ((.cse4 (* 8672 v_prenex_74)) (.cse5 (* c_ssl3_accept_~ag_X~0 v_prenex_74))) (or (not (= 8673 (div .cse4 v_prenex_73))) (< .cse4 0) (< .cse5 0) (not (= (div .cse5 v_prenex_73) 8641)) (<= 0 v_prenex_73)))) (forall ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_62)) (.cse7 (* 8672 v_prenex_62))) (or (< v_prenex_61 0) (not (= (mod .cse6 v_prenex_61) 0)) (< .cse6 0) (not (= (div .cse6 v_prenex_61) 8641)) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_61)) (not (= 8672 (div .cse7 v_prenex_61)))))) (forall ((v_prenex_84 Int) (v_prenex_83 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_84)) (.cse9 (* 8672 v_prenex_84))) (or (not (= (div .cse8 v_prenex_83) 8641)) (not (= (mod .cse8 v_prenex_83) 0)) (< v_prenex_83 0) (= 0 (mod .cse9 v_prenex_83)) (<= 0 v_prenex_83) (<= 0 .cse9) (not (= 8674 (div .cse9 v_prenex_83)))))) (forall ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse10 (* 8672 v_prenex_64)) (.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_64))) (or (< v_prenex_63 0) (not (= 8673 (div .cse10 v_prenex_63))) (not (= (mod .cse11 v_prenex_63) 0)) (not (= 0 (mod .cse10 v_prenex_63))) (not (= (div .cse11 v_prenex_63) 8641))))) (forall ((v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse12 (* 8672 v_prenex_98)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_98))) (or (not (= 8673 (div .cse12 v_prenex_97))) (not (= (div .cse13 v_prenex_97) 8641)) (< v_prenex_97 0) (< .cse12 0) (not (= (mod .cse13 v_prenex_97) 0))))) (forall ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse15 (* 8672 v_prenex_56)) (.cse14 (* c_ssl3_accept_~ag_X~0 v_prenex_56))) (or (not (= (div .cse14 v_prenex_55) 8642)) (= (mod .cse14 v_prenex_55) 0) (< .cse15 0) (<= 0 v_prenex_55) (not (= 8673 (div .cse15 v_prenex_55))) (not (< .cse14 0))))) (or .cse16 (not .cse17) (and (or (not (= .cse18 8672)) .cse19) (or (not (= .cse18 8674)) .cse20))) (forall ((v_prenex_88 Int) (v_prenex_87 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_88)) (.cse21 (* 8672 v_prenex_88))) (or (= 0 (mod .cse21 v_prenex_87)) (not (= (div .cse22 v_prenex_87) 8641)) (<= 0 v_prenex_87) (< v_prenex_87 0) (<= 0 .cse21) (< .cse22 0) (not (= 8674 (div .cse21 v_prenex_87)))))) (or (and (or (not (= 8672 .cse23)) .cse19) (or (not (= 8674 .cse23)) .cse20)) (<= 0 .cse24) .cse25) (forall ((v_prenex_99 Int) (v_prenex_100 Int)) (let ((.cse27 (* c_ssl3_accept_~ag_X~0 v_prenex_100)) (.cse26 (* 8672 v_prenex_100))) (or (<= 0 .cse26) (not (< .cse27 0)) (= (mod .cse27 v_prenex_99) 0) (= 0 (mod .cse26 v_prenex_99)) (<= 0 v_prenex_99) (not (= (div .cse27 v_prenex_99) 8640)) (not (= 8674 (div .cse26 v_prenex_99))) (< v_prenex_99 0)))) (forall ((v_prenex_105 Int) (v_prenex_106 Int)) (let ((.cse29 (* 8672 v_prenex_105)) (.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_105))) (or (< v_prenex_106 0) (= (mod .cse28 v_prenex_106) 0) (< .cse29 0) (not (= 8673 (div .cse29 v_prenex_106))) (not (= (div .cse28 v_prenex_106) 8640)) (not (< .cse28 0))))) (forall ((v_prenex_101 Int) (v_prenex_102 Int)) (let ((.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_101)) (.cse31 (* 8672 v_prenex_101))) (or (not (= (mod .cse30 v_prenex_102) 0)) (not (= 8673 (div .cse31 v_prenex_102))) (not (= (div .cse30 v_prenex_102) 8641)) (not (= 0 (mod .cse31 v_prenex_102))) (<= 0 v_prenex_102)))) (forall ((v_prenex_90 Int) (v_prenex_89 Int)) (let ((.cse32 (* 8672 v_prenex_90)) (.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_90))) (or (not (= 8674 (div .cse32 v_prenex_89))) (= (mod .cse33 v_prenex_89) 0) (= 0 (mod .cse32 v_prenex_89)) (<= 0 v_prenex_89) (<= 0 .cse32) (not (= (div .cse33 v_prenex_89) 8642)) (not (< .cse33 0))))) (or (and .cse17 (not .cse16)) (not (= .cse18 8673))) (forall ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse35 (* 8672 v_prenex_96)) (.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_96))) (or (< .cse34 0) (= 0 (mod .cse35 v_prenex_95)) (<= 0 v_prenex_95) (<= 0 .cse35) (not (= 8674 (div .cse35 v_prenex_95))) (not (= (div .cse34 v_prenex_95) 8641))))) (forall ((v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse36 (* 8672 v_prenex_103)) (.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_103))) (or (<= 0 .cse36) (not (= (div .cse37 v_prenex_104) 8641)) (< v_prenex_104 0) (not (= 8672 (div .cse36 v_prenex_104))) (= 0 (mod .cse36 v_prenex_104)) (not (= (mod .cse37 v_prenex_104) 0))))) (forall ((v_prenex_67 Int) (v_prenex_68 Int)) (let ((.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_68)) (.cse38 (* 8672 v_prenex_68))) (or (not (= 8672 (div .cse38 v_prenex_67))) (= (mod .cse39 v_prenex_67) 0) (not (< .cse39 0)) (< v_prenex_67 0) (= 0 (mod .cse38 v_prenex_67)) (not (= (div .cse39 v_prenex_67) 8640)) (<= 0 .cse38)))) (forall ((v_prenex_107 Int) (v_prenex_108 Int)) (let ((.cse41 (* c_ssl3_accept_~ag_X~0 v_prenex_107)) (.cse40 (* 8672 v_prenex_107))) (or (not (= 8673 (div .cse40 v_prenex_108))) (not (= (div .cse41 v_prenex_108) 8641)) (<= 0 v_prenex_108) (< .cse41 0) (not (= 0 (mod .cse40 v_prenex_108)))))) (forall ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse42 (* 8672 v_prenex_58)) (.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_58))) (or (< .cse42 0) (< .cse43 0) (not (= 8673 (div .cse42 v_prenex_57))) (not (= (mod .cse43 v_prenex_57) 0)) (< v_prenex_57 0) (not (= (div .cse43 v_prenex_57) 8641))))) (forall ((v_prenex_78 Int) (v_prenex_77 Int)) (let ((.cse44 (* 8672 v_prenex_78)) (.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_78))) (or (not (= 8673 (div .cse44 v_prenex_77))) (<= 0 v_prenex_77) (not (= (div .cse45 v_prenex_77) 8641)) (< .cse44 0) (not (= (mod .cse45 v_prenex_77) 0))))) (forall ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_66)) (.cse47 (* 8672 v_prenex_66))) (or (< .cse46 0) (< v_prenex_65 0) (not (= 8673 (div .cse47 v_prenex_65))) (not (= (div .cse46 v_prenex_65) 8641)) (not (= 0 (mod .cse47 v_prenex_65)))))) (forall ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse49 (* 8672 v_prenex_80)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_80))) (or (not (= (div .cse48 v_prenex_79) 8641)) (<= 0 v_prenex_79) (not (= 0 (mod .cse49 v_prenex_79))) (not (= (mod .cse48 v_prenex_79) 0)) (not (= 8673 (div .cse49 v_prenex_79))) (< .cse48 0)))) (forall ((v_prenex_69 Int) (v_prenex_70 Int)) (let ((.cse51 (* 8672 v_prenex_70)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_70))) (or (not (= (mod .cse50 v_prenex_69) 0)) (<= 0 .cse51) (<= 0 v_prenex_69) (not (= 8674 (div .cse51 v_prenex_69))) (= 0 (mod .cse51 v_prenex_69)) (not (= (div .cse50 v_prenex_69) 8641))))) (or (not (= 8673 .cse23)) (and (not .cse25) (< .cse24 0))) (forall ((v_prenex_85 Int) (v_prenex_86 Int)) (let ((.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_86)) (.cse52 (* 8672 v_prenex_86))) (or (<= 0 v_prenex_85) (< .cse52 0) (not (= (mod .cse53 v_prenex_85) 0)) (not (= (div .cse53 v_prenex_85) 8641)) (< .cse53 0) (not (= 8673 (div .cse52 v_prenex_85)))))) (forall ((v_prenex_76 Int) (v_prenex_75 Int)) (let ((.cse54 (* 8672 v_prenex_76)) (.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_76))) (or (< .cse54 0) (not (= 8673 (div .cse54 v_prenex_75))) (< .cse55 0) (not (= (div .cse55 v_prenex_75) 8641)) (< v_prenex_75 0)))) (forall ((v_prenex_94 Int) (v_prenex_93 Int)) (let ((.cse57 (* 8672 v_prenex_94)) (.cse56 (* c_ssl3_accept_~ag_X~0 v_prenex_94))) (or (not (< .cse56 0)) (not (= 0 (mod .cse57 v_prenex_93))) (not (= (div .cse56 v_prenex_93) 8642)) (<= 0 v_prenex_93) (not (= 8673 (div .cse57 v_prenex_93))) (= (mod .cse56 v_prenex_93) 0)))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse58 (* c_ssl3_accept_~ag_X~0 v_prenex_60)) (.cse59 (* 8672 v_prenex_60))) (or (= (mod .cse58 v_prenex_59) 0) (not (< .cse58 0)) (not (= (div .cse58 v_prenex_59) 8640)) (not (= 0 (mod .cse59 v_prenex_59))) (< v_prenex_59 0) (not (= 8673 (div .cse59 v_prenex_59)))))) (forall ((v_prenex_72 Int) (v_prenex_71 Int)) (let ((.cse60 (* 8672 v_prenex_72)) (.cse61 (* c_ssl3_accept_~ag_X~0 v_prenex_72))) (or (= 0 (mod .cse60 v_prenex_71)) (not (= (mod .cse61 v_prenex_71) 0)) (< .cse61 0) (not (= 8674 (div .cse60 v_prenex_71))) (<= 0 .cse60) (<= 0 v_prenex_71) (not (= (div .cse61 v_prenex_71) 8641)) (< v_prenex_71 0)))) (forall ((v_prenex_81 Int) (v_prenex_82 Int)) (let ((.cse63 (* 8672 v_prenex_82)) (.cse62 (* c_ssl3_accept_~ag_X~0 v_prenex_82))) (or (<= 0 v_prenex_81) (not (= (mod .cse62 v_prenex_81) 0)) (not (= (div .cse62 v_prenex_81) 8641)) (not (= 8674 (div .cse63 v_prenex_81))) (<= 0 .cse63) (= 0 (mod .cse63 v_prenex_81)) (< .cse62 0))))))) is different from false [2019-09-09 05:52:39,270 WARN L188 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:52:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:51,291 INFO L93 Difference]: Finished difference Result 34004 states and 46398 transitions. [2019-09-09 05:52:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-09 05:52:51,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 441 [2019-09-09 05:52:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:51,347 INFO L225 Difference]: With dead ends: 34004 [2019-09-09 05:52:51,347 INFO L226 Difference]: Without dead ends: 33179 [2019-09-09 05:52:51,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 886 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 105.8s TimeCoverageRelationStatistics Valid=209, Invalid=505, Unknown=8, NotChecked=270, Total=992 [2019-09-09 05:52:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33179 states. [2019-09-09 05:52:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33179 to 21261. [2019-09-09 05:52:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21261 states. [2019-09-09 05:52:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21261 states to 21261 states and 29690 transitions. [2019-09-09 05:52:51,740 INFO L78 Accepts]: Start accepts. Automaton has 21261 states and 29690 transitions. Word has length 441 [2019-09-09 05:52:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:51,741 INFO L475 AbstractCegarLoop]: Abstraction has 21261 states and 29690 transitions. [2019-09-09 05:52:51,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:52:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 21261 states and 29690 transitions. [2019-09-09 05:52:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-09 05:52:51,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:51,755 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:51,756 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash -536589052, now seen corresponding path program 1 times [2019-09-09 05:52:51,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:51,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:51,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:51,779 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:52:51,779 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:52:51,779 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:52:51,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:51,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:52:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:51,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 474 with the following transitions: [2019-09-09 05:52:51,873 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [585], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:52:51,874 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:52:51,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:52:51,961 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:52:52,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:52:52,768 INFO L272 AbstractInterpreter]: Visited 108 different actions 2264 times. Merged at 87 different actions 1806 times. Widened at 21 different actions 287 times. Performed 5487 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5487 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 290 fixpoints after 32 different actions. Largest state had 94 variables. [2019-09-09 05:52:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:52,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:52:52,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:52:52,769 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:52:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:52,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:52:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:52,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:52:52,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:52:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2019-09-09 05:52:53,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:52:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2019-09-09 05:52:53,403 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:53,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:52:53,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:53,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:53,404 INFO L87 Difference]: Start difference. First operand 21261 states and 29690 transitions. Second operand 3 states. [2019-09-09 05:52:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:53,464 INFO L93 Difference]: Finished difference Result 37928 states and 51417 transitions. [2019-09-09 05:52:53,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:53,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-09-09 05:52:53,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:53,527 INFO L225 Difference]: With dead ends: 37928 [2019-09-09 05:52:53,527 INFO L226 Difference]: Without dead ends: 37928 [2019-09-09 05:52:53,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37928 states. [2019-09-09 05:52:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37928 to 37894. [2019-09-09 05:52:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37894 states. [2019-09-09 05:52:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37894 states to 37894 states and 51380 transitions. [2019-09-09 05:52:54,083 INFO L78 Accepts]: Start accepts. Automaton has 37894 states and 51380 transitions. Word has length 473 [2019-09-09 05:52:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:54,084 INFO L475 AbstractCegarLoop]: Abstraction has 37894 states and 51380 transitions. [2019-09-09 05:52:54,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 37894 states and 51380 transitions. [2019-09-09 05:52:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-09 05:52:54,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:54,252 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:54,252 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -589051196, now seen corresponding path program 1 times [2019-09-09 05:52:54,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:54,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:54,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 982 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-09-09 05:52:54,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:52:54,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:54,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:54,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:54,436 INFO L87 Difference]: Start difference. First operand 37894 states and 51380 transitions. Second operand 3 states. [2019-09-09 05:52:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:54,547 INFO L93 Difference]: Finished difference Result 39050 states and 52390 transitions. [2019-09-09 05:52:54,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:54,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-09 05:52:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:54,625 INFO L225 Difference]: With dead ends: 39050 [2019-09-09 05:52:54,625 INFO L226 Difference]: Without dead ends: 39050 [2019-09-09 05:52:54,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39050 states. [2019-09-09 05:52:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39050 to 38346. [2019-09-09 05:52:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38346 states. [2019-09-09 05:52:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38346 states to 38346 states and 51686 transitions. [2019-09-09 05:52:55,222 INFO L78 Accepts]: Start accepts. Automaton has 38346 states and 51686 transitions. Word has length 490 [2019-09-09 05:52:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:55,223 INFO L475 AbstractCegarLoop]: Abstraction has 38346 states and 51686 transitions. [2019-09-09 05:52:55,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 38346 states and 51686 transitions. [2019-09-09 05:52:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-09-09 05:52:55,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:55,254 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:55,254 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1839774951, now seen corresponding path program 1 times [2019-09-09 05:52:55,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:55,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:55,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:55,282 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:52:55,282 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:52:55,283 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:52:55,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:55,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:52:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:55,562 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 508 with the following transitions: [2019-09-09 05:52:55,562 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [329], [335], [340], [375], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [560], [570], [582], [585], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:52:55,564 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:52:55,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:52:55,638 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:52:56,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:52:56,519 INFO L272 AbstractInterpreter]: Visited 111 different actions 2119 times. Merged at 89 different actions 1668 times. Widened at 20 different actions 234 times. Performed 5010 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5010 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 280 fixpoints after 22 different actions. Largest state had 93 variables. [2019-09-09 05:52:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:56,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:52:56,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:52:56,520 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:52:56,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:56,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:52:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:52:56,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:52:56,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:52:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 2038 trivial. 0 not checked. [2019-09-09 05:52:56,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:52:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2548 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 2038 trivial. 0 not checked. [2019-09-09 05:52:57,098 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:57,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:52:57,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:57,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:52:57,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:52:57,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:57,099 INFO L87 Difference]: Start difference. First operand 38346 states and 51686 transitions. Second operand 3 states. [2019-09-09 05:52:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:52:57,166 INFO L93 Difference]: Finished difference Result 36833 states and 48820 transitions. [2019-09-09 05:52:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:52:57,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-09-09 05:52:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:52:57,203 INFO L225 Difference]: With dead ends: 36833 [2019-09-09 05:52:57,203 INFO L226 Difference]: Without dead ends: 36833 [2019-09-09 05:52:57,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:52:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36833 states. [2019-09-09 05:52:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36833 to 36831. [2019-09-09 05:52:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36831 states. [2019-09-09 05:52:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36831 states to 36831 states and 48819 transitions. [2019-09-09 05:52:57,673 INFO L78 Accepts]: Start accepts. Automaton has 36831 states and 48819 transitions. Word has length 507 [2019-09-09 05:52:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:52:57,674 INFO L475 AbstractCegarLoop]: Abstraction has 36831 states and 48819 transitions. [2019-09-09 05:52:57,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:52:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 36831 states and 48819 transitions. [2019-09-09 05:52:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-09 05:52:57,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:52:57,693 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:52:57,694 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:52:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash -593618616, now seen corresponding path program 1 times [2019-09-09 05:52:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:52:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:57,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:52:57,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:52:57,715 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:52:57,716 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:52:57,716 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:52:57,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:52:57,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:52:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:52:58,015 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 511 with the following transitions: [2019-09-09 05:52:58,015 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [329], [335], [340], [375], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [560], [570], [582], [585], [590], [603], [608], [609], [610], [612] [2019-09-09 05:52:58,017 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:52:58,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:52:58,056 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:52:58,057 INFO L272 AbstractInterpreter]: Visited 31 different actions 31 times. Never merged. Never widened. Performed 122 root evaluator evaluations with a maximum evaluation depth of 8. Performed 122 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 93 variables. [2019-09-09 05:52:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:52:58,057 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:52:58,302 INFO L227 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 70.54% of their original sizes. [2019-09-09 05:52:58,302 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:52:59,362 INFO L420 sIntCurrentIteration]: We unified 509 AI predicates to 509 [2019-09-09 05:52:59,362 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:52:59,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:52:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-09-09 05:52:59,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:52:59,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-09 05:52:59,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-09 05:52:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=934, Unknown=0, NotChecked=0, Total=1122 [2019-09-09 05:52:59,364 INFO L87 Difference]: Start difference. First operand 36831 states and 48819 transitions. Second operand 34 states. [2019-09-09 05:53:02,285 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:53:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:04,399 INFO L93 Difference]: Finished difference Result 36873 states and 48859 transitions. [2019-09-09 05:53:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-09 05:53:04,399 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 510 [2019-09-09 05:53:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:04,436 INFO L225 Difference]: With dead ends: 36873 [2019-09-09 05:53:04,436 INFO L226 Difference]: Without dead ends: 36873 [2019-09-09 05:53:04,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2019-09-09 05:53:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36873 states. [2019-09-09 05:53:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36873 to 36835. [2019-09-09 05:53:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36835 states. [2019-09-09 05:53:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36835 states to 36835 states and 48819 transitions. [2019-09-09 05:53:04,789 INFO L78 Accepts]: Start accepts. Automaton has 36835 states and 48819 transitions. Word has length 510 [2019-09-09 05:53:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:04,790 INFO L475 AbstractCegarLoop]: Abstraction has 36835 states and 48819 transitions. [2019-09-09 05:53:04,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-09 05:53:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36835 states and 48819 transitions. [2019-09-09 05:53:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-09 05:53:04,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:04,801 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:04,802 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:04,802 INFO L82 PathProgramCache]: Analyzing trace with hash 888245305, now seen corresponding path program 1 times [2019-09-09 05:53:04,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:04,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2019-09-09 05:53:05,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:05,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:05,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:05,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:05,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:05,214 INFO L87 Difference]: Start difference. First operand 36835 states and 48819 transitions. Second operand 3 states. [2019-09-09 05:53:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:05,392 INFO L93 Difference]: Finished difference Result 71915 states and 94388 transitions. [2019-09-09 05:53:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:05,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2019-09-09 05:53:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:05,494 INFO L225 Difference]: With dead ends: 71915 [2019-09-09 05:53:05,494 INFO L226 Difference]: Without dead ends: 71915 [2019-09-09 05:53:05,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71915 states. [2019-09-09 05:53:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71915 to 71913. [2019-09-09 05:53:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71913 states. [2019-09-09 05:53:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71913 states to 71913 states and 94387 transitions. [2019-09-09 05:53:06,537 INFO L78 Accepts]: Start accepts. Automaton has 71913 states and 94387 transitions. Word has length 511 [2019-09-09 05:53:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:06,537 INFO L475 AbstractCegarLoop]: Abstraction has 71913 states and 94387 transitions. [2019-09-09 05:53:06,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 71913 states and 94387 transitions. [2019-09-09 05:53:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-09 05:53:06,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:06,556 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:06,556 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:06,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash -964766354, now seen corresponding path program 1 times [2019-09-09 05:53:06,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:06,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:06,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:06,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:06,579 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:53:06,579 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:53:06,579 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:53:06,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:06,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:53:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:06,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 512 with the following transitions: [2019-09-09 05:53:06,673 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [13], [18], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [329], [335], [340], [375], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [560], [570], [582], [585], [590], [603], [608], [609], [610], [612] [2019-09-09 05:53:06,676 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:53:06,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:53:06,730 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:53:08,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:53:08,503 INFO L272 AbstractInterpreter]: Visited 111 different actions 2048 times. Merged at 90 different actions 1638 times. Widened at 20 different actions 224 times. Performed 4889 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 255 fixpoints after 31 different actions. Largest state had 93 variables. [2019-09-09 05:53:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:08,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:53:08,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:53:08,504 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:53:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:08,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:53:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:08,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-09 05:53:08,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:53:27,269 WARN L188 SmtUtils]: Spent 18.61 s on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-09 05:53:27,407 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-09 05:53:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:27,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:29,644 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2019-09-09 05:53:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1373 proven. 240 refuted. 35 times theorem prover too weak. 935 trivial. 0 not checked. [2019-09-09 05:53:30,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:53:30,592 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-09 05:53:33,561 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-09 05:53:33,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:33,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:53:35,627 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse1 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse0 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse1 ssl3_accept_~ag_Z~0))) (<= 0 .cse1) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse0 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse1 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse3 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse2 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse2 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse3 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse3 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse2 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse4 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse5 ssl3_accept_~ag_Z~0))) (< .cse5 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse7 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse6 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse6 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse7 ssl3_accept_~ag_Z~0))) (< .cse7 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse9 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse8 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse8 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse9 ssl3_accept_~ag_Z~0))) (< .cse9 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse10 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8671 (div .cse10 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 .cse10) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse10 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse11 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse11 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse11 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse13 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse12 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse12 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse13 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse13 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse14 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse14 ssl3_accept_~ag_Z~0))) (not (= (mod .cse15 ssl3_accept_~ag_Z~0) 0)) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse15 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse14 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse16 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse16 ssl3_accept_~ag_Z~0))) (< .cse16 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse18 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse17 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8671 (div .cse17 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse18 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse17) (not (= (div .cse18 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse17 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse20 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse19 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse20 ssl3_accept_~ag_Z~0))) (<= 0 .cse20) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse19 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse20 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse21 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse21 ssl3_accept_~ag_Z~0))) (<= 0 .cse21) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse21 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse23 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse22 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse22 ssl3_accept_~ag_Z~0))) (not (= (mod .cse23 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse23 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse22 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse24 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse24 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse24 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse25 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse26 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse25 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse25 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse26 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse26 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse27 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse28 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse27 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse28 ssl3_accept_~ag_Z~0))) (not (= (div .cse27 ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse28 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse29 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse30 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse29 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse30 ssl3_accept_~ag_Z~0))) (not (= (div .cse29 ssl3_accept_~ag_Z~0) 8607)) (<= 0 .cse30) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse30 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse32 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse31 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse32 ssl3_accept_~ag_Z~0))) (not (= (div .cse31 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse32) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (= 0 (mod .cse32 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse34 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse33 ssl3_accept_~ag_Z~0) 0) (not (= 8671 (div .cse34 ssl3_accept_~ag_Z~0))) (not (= (div .cse33 ssl3_accept_~ag_Z~0) 8607)) (<= 0 .cse34) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse34 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse36 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse35 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse35 ssl3_accept_~ag_Z~0) 8607)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse36 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse36 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse37 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse37 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse37 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse39 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse38 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse39 ssl3_accept_~ag_Z~0))) (<= 0 .cse39) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse38 ssl3_accept_~ag_Z~0) 8608)) (= 0 (mod .cse39 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse41 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse40 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse41 ssl3_accept_~ag_Z~0))) (<= 0 .cse41) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse40 ssl3_accept_~ag_Z~0) 8608)) (= 0 (mod .cse41 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse42 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8671 (div .cse42 ssl3_accept_~ag_Z~0))) (not (= (mod .cse43 ssl3_accept_~ag_Z~0) 0)) (<= 0 .cse42) (not (= (div .cse43 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse42 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse44 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse45 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse44 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse45 ssl3_accept_~ag_Z~0))) (not (= (div .cse44 ssl3_accept_~ag_Z~0) 8607)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse45 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse46 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse46 ssl3_accept_~ag_Z~0))) (<= 0 .cse46) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8608)) (= 0 (mod .cse46 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse48 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse47 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse47 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse48 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse48 ssl3_accept_~ag_Z~0) 8608)) (not (= 8672 (div .cse47 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0))))) is different from false [2019-09-09 05:53:37,672 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_132 Int) (v_prenex_131 Int)) (let ((.cse0 (* 8672 v_prenex_132)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_132))) (or (= 0 (mod .cse0 v_prenex_131)) (not (= 8673 (div .cse0 v_prenex_131))) (< .cse1 0) (<= 0 v_prenex_131) (<= 0 .cse0) (< v_prenex_131 0) (not (= (div .cse1 v_prenex_131) 8608))))) (forall ((v_prenex_120 Int) (v_prenex_119 Int)) (let ((.cse2 (* 8672 v_prenex_120)) (.cse3 (* c_ssl3_accept_~ag_X~0 v_prenex_120))) (or (not (= 0 (mod .cse2 v_prenex_119))) (not (= 8672 (div .cse2 v_prenex_119))) (< .cse3 0) (not (= (div .cse3 v_prenex_119) 8608)) (< v_prenex_119 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (<= 0 .cse5) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse5 ssl3_accept_~ag_Z~0))))) (forall ((v_prenex_159 Int) (v_prenex_160 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_159)) (.cse7 (* 8672 v_prenex_159))) (or (<= 0 v_prenex_160) (not (= (div .cse6 v_prenex_160) 8608)) (< .cse6 0) (not (= 8673 (div .cse7 v_prenex_160))) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_160))))) (forall ((v_prenex_125 Int) (v_prenex_126 Int)) (let ((.cse9 (* c_ssl3_accept_~ag_X~0 v_prenex_126)) (.cse8 (* 8672 v_prenex_126))) (or (< .cse8 0) (<= 0 v_prenex_125) (< .cse9 0) (not (= (div .cse9 v_prenex_125) 8608)) (not (= 8672 (div .cse8 v_prenex_125)))))) (forall ((v_prenex_121 Int) (v_prenex_122 Int)) (let ((.cse10 (* 8672 v_prenex_122)) (.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_122))) (or (< v_prenex_121 0) (< .cse10 0) (not (= (div .cse11 v_prenex_121) 8608)) (not (= 8672 (div .cse10 v_prenex_121))) (not (= (mod .cse11 v_prenex_121) 0))))) (forall ((v_prenex_136 Int) (v_prenex_135 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 v_prenex_136)) (.cse13 (* 8672 v_prenex_136))) (or (< v_prenex_135 0) (< .cse12 0) (not (= (div .cse12 v_prenex_135) 8608)) (not (= 8672 (div .cse13 v_prenex_135))) (< .cse13 0)))) (forall ((v_prenex_152 Int) (v_prenex_151 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_152)) (.cse14 (* 8672 v_prenex_152))) (or (<= 0 v_prenex_151) (not (= 8673 (div .cse14 v_prenex_151))) (not (= (mod .cse15 v_prenex_151) 0)) (not (= (div .cse15 v_prenex_151) 8608)) (<= 0 .cse14) (= 0 (mod .cse14 v_prenex_151))))) (forall ((v_prenex_127 Int) (v_prenex_128 Int)) (let ((.cse16 (* c_ssl3_accept_~ag_X~0 v_prenex_128)) (.cse17 (* 8672 v_prenex_128))) (or (< v_prenex_127 0) (< .cse16 0) (not (= (mod .cse16 v_prenex_127) 0)) (not (= (div .cse16 v_prenex_127) 8608)) (= 0 (mod .cse17 v_prenex_127)) (<= 0 .cse17) (not (= 8671 (div .cse17 v_prenex_127)))))) (forall ((v_prenex_138 Int) (v_prenex_137 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_138)) (.cse18 (* 8672 v_prenex_138))) (or (not (= 8672 (div .cse18 v_prenex_137))) (< .cse19 0) (not (= (mod .cse19 v_prenex_137) 0)) (< v_prenex_137 0) (not (= (div .cse19 v_prenex_137) 8608)) (< .cse18 0)))) (forall ((v_prenex_145 Int) (v_prenex_146 Int)) (let ((.cse20 (* 8672 v_prenex_146)) (.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_146))) (or (<= 0 .cse20) (< v_prenex_145 0) (= 0 (mod .cse20 v_prenex_145)) (not (< .cse21 0)) (not (= 8671 (div .cse20 v_prenex_145))) (= (mod .cse21 v_prenex_145) 0) (not (= (div .cse21 v_prenex_145) 8607))))) (forall ((v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse22 (* 8672 v_prenex_130)) (.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_130))) (or (<= 0 .cse22) (<= 0 v_prenex_129) (not (= (div .cse23 v_prenex_129) 8608)) (= 0 (mod .cse22 v_prenex_129)) (not (= 8673 (div .cse22 v_prenex_129))) (< v_prenex_129 0) (not (= (mod .cse23 v_prenex_129) 0))))) (forall ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse25 (* c_ssl3_accept_~ag_X~0 v_prenex_124)) (.cse24 (* 8672 v_prenex_124))) (or (not (= 8672 (div .cse24 v_prenex_123))) (<= 0 v_prenex_123) (not (= (div .cse25 v_prenex_123) 8608)) (not (= (mod .cse25 v_prenex_123) 0)) (not (= 0 (mod .cse24 v_prenex_123)))))) (forall ((v_prenex_116 Int) (v_prenex_115 Int)) (let ((.cse26 (* 8672 v_prenex_116)) (.cse27 (* c_ssl3_accept_~ag_X~0 v_prenex_116))) (or (< .cse26 0) (not (= (div .cse27 v_prenex_115) 8608)) (<= 0 v_prenex_115) (< .cse27 0) (not (= 8672 (div .cse26 v_prenex_115))) (not (= (mod .cse27 v_prenex_115) 0))))) (forall ((v_prenex_114 Int) (v_prenex_113 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_114)) (.cse29 (* 8672 v_prenex_114))) (or (not (= (div .cse28 v_prenex_113) 8608)) (not (= 8672 (div .cse29 v_prenex_113))) (<= 0 v_prenex_113) (not (= (mod .cse28 v_prenex_113) 0)) (< .cse29 0)))) (forall ((v_prenex_156 Int) (v_prenex_155 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_155)) (.cse30 (* 8672 v_prenex_155))) (or (= 0 (mod .cse30 v_prenex_156)) (not (= (div .cse31 v_prenex_156) 8608)) (not (= 8671 (div .cse30 v_prenex_156))) (not (= (mod .cse31 v_prenex_156) 0)) (<= 0 .cse30) (< v_prenex_156 0)))) (forall ((v_prenex_134 Int) (v_prenex_133 Int)) (let ((.cse32 (* 8672 v_prenex_134)) (.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_134))) (or (not (= 8672 (div .cse32 v_prenex_133))) (not (= (div .cse33 v_prenex_133) 8608)) (< v_prenex_133 0) (not (= 0 (mod .cse32 v_prenex_133))) (not (= (mod .cse33 v_prenex_133) 0))))) (forall ((v_prenex_149 Int) (v_prenex_150 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_150)) (.cse34 (* 8672 v_prenex_150))) (or (not (= 8672 (div .cse34 v_prenex_149))) (not (= (div .cse35 v_prenex_149) 8608)) (< .cse35 0) (<= 0 v_prenex_149) (not (= 0 (mod .cse34 v_prenex_149)))))) (forall ((v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse36 (* 8672 v_prenex_142)) (.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_142))) (or (<= 0 .cse36) (= (mod .cse37 v_prenex_141) 0) (not (= (div .cse37 v_prenex_141) 8607)) (< v_prenex_141 0) (= 0 (mod .cse36 v_prenex_141)) (not (= 8673 (div .cse36 v_prenex_141))) (<= 0 v_prenex_141) (not (< .cse37 0))))) (forall ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse38 (* 8672 v_prenex_118)) (.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_118))) (or (not (= 8671 (div .cse38 v_prenex_117))) (= 0 (mod .cse38 v_prenex_117)) (< .cse39 0) (<= 0 .cse38) (not (= (div .cse39 v_prenex_117) 8608)) (< v_prenex_117 0)))) (forall ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_140)) (.cse41 (* 8672 v_prenex_140))) (or (<= 0 v_prenex_139) (not (= (div .cse40 v_prenex_139) 8609)) (not (= 0 (mod .cse41 v_prenex_139))) (not (< .cse40 0)) (= (mod .cse40 v_prenex_139) 0) (not (= 8672 (div .cse41 v_prenex_139)))))) (forall ((v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse42 (* 8672 v_prenex_161)) (.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_161))) (or (not (= 0 (mod .cse42 v_prenex_162))) (< v_prenex_162 0) (< .cse43 0) (not (= (mod .cse43 v_prenex_162) 0)) (not (= 8672 (div .cse42 v_prenex_162))) (not (= (div .cse43 v_prenex_162) 8608))))) (forall ((v_prenex_110 Int) (v_prenex_109 Int)) (let ((.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_110)) (.cse45 (* 8672 v_prenex_110))) (or (<= 0 v_prenex_109) (not (= (mod .cse44 v_prenex_109) 0)) (not (= (div .cse44 v_prenex_109) 8608)) (not (= 0 (mod .cse45 v_prenex_109))) (< .cse44 0) (not (= 8672 (div .cse45 v_prenex_109)))))) (forall ((v_prenex_143 Int) (v_prenex_144 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 v_prenex_144)) (.cse46 (* 8672 v_prenex_144))) (or (<= 0 .cse46) (<= 0 v_prenex_143) (not (= (div .cse47 v_prenex_143) 8609)) (= 0 (mod .cse46 v_prenex_143)) (= (mod .cse47 v_prenex_143) 0) (not (< .cse47 0)) (not (= 8673 (div .cse46 v_prenex_143)))))) (forall ((v_prenex_112 Int) (v_prenex_111 Int)) (let ((.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_112)) (.cse49 (* 8672 v_prenex_112))) (or (not (< .cse48 0)) (not (= (div .cse48 v_prenex_111) 8609)) (not (= 8672 (div .cse49 v_prenex_111))) (<= 0 v_prenex_111) (= (mod .cse48 v_prenex_111) 0) (< .cse49 0)))) (forall ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse51 (* 8672 v_prenex_148)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_148))) (or (= (mod .cse50 v_prenex_147) 0) (not (= (div .cse50 v_prenex_147) 8607)) (not (= 8672 (div .cse51 v_prenex_147))) (< v_prenex_147 0) (< .cse51 0) (not (< .cse50 0))))) (forall ((v_prenex_154 Int) (v_prenex_153 Int)) (let ((.cse53 (* 8672 v_prenex_154)) (.cse52 (* c_ssl3_accept_~ag_X~0 v_prenex_154))) (or (< .cse52 0) (not (= 8673 (div .cse53 v_prenex_153))) (<= 0 .cse53) (not (= (mod .cse52 v_prenex_153) 0)) (= 0 (mod .cse53 v_prenex_153)) (not (= (div .cse52 v_prenex_153) 8608)) (<= 0 v_prenex_153)))) (forall ((v_prenex_158 Int) (v_prenex_157 Int)) (let ((.cse55 (* 8672 v_prenex_157)) (.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_157))) (or (not (= (div .cse54 v_prenex_158) 8607)) (not (= 0 (mod .cse55 v_prenex_158))) (not (< .cse54 0)) (< v_prenex_158 0) (not (= 8672 (div .cse55 v_prenex_158))) (= (mod .cse54 v_prenex_158) 0))))) is different from false [2019-09-09 05:53:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1318 proven. 179 refuted. 0 times theorem prover too weak. 935 trivial. 151 not checked. [2019-09-09 05:53:42,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:53:42,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-09 05:53:42,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:53:42,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:53:42,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:53:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=82, Unknown=3, NotChecked=38, Total=156 [2019-09-09 05:53:42,988 INFO L87 Difference]: Start difference. First operand 71913 states and 94387 transitions. Second operand 13 states. [2019-09-09 05:53:45,893 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_132 Int) (v_prenex_131 Int)) (let ((.cse0 (* 8672 v_prenex_132)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_132))) (or (= 0 (mod .cse0 v_prenex_131)) (not (= 8673 (div .cse0 v_prenex_131))) (< .cse1 0) (<= 0 v_prenex_131) (<= 0 .cse0) (< v_prenex_131 0) (not (= (div .cse1 v_prenex_131) 8608))))) (forall ((v_prenex_120 Int) (v_prenex_119 Int)) (let ((.cse2 (* 8672 v_prenex_120)) (.cse3 (* c_ssl3_accept_~ag_X~0 v_prenex_120))) (or (not (= 0 (mod .cse2 v_prenex_119))) (not (= 8672 (div .cse2 v_prenex_119))) (< .cse3 0) (not (= (div .cse3 v_prenex_119) 8608)) (< v_prenex_119 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (<= 0 .cse5) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse5 ssl3_accept_~ag_Z~0))))) (forall ((v_prenex_159 Int) (v_prenex_160 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_159)) (.cse7 (* 8672 v_prenex_159))) (or (<= 0 v_prenex_160) (not (= (div .cse6 v_prenex_160) 8608)) (< .cse6 0) (not (= 8673 (div .cse7 v_prenex_160))) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_160))))) (forall ((v_prenex_125 Int) (v_prenex_126 Int)) (let ((.cse9 (* c_ssl3_accept_~ag_X~0 v_prenex_126)) (.cse8 (* 8672 v_prenex_126))) (or (< .cse8 0) (<= 0 v_prenex_125) (< .cse9 0) (not (= (div .cse9 v_prenex_125) 8608)) (not (= 8672 (div .cse8 v_prenex_125)))))) (forall ((v_prenex_121 Int) (v_prenex_122 Int)) (let ((.cse10 (* 8672 v_prenex_122)) (.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_122))) (or (< v_prenex_121 0) (< .cse10 0) (not (= (div .cse11 v_prenex_121) 8608)) (not (= 8672 (div .cse10 v_prenex_121))) (not (= (mod .cse11 v_prenex_121) 0))))) (forall ((v_prenex_136 Int) (v_prenex_135 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 v_prenex_136)) (.cse13 (* 8672 v_prenex_136))) (or (< v_prenex_135 0) (< .cse12 0) (not (= (div .cse12 v_prenex_135) 8608)) (not (= 8672 (div .cse13 v_prenex_135))) (< .cse13 0)))) (forall ((v_prenex_152 Int) (v_prenex_151 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_152)) (.cse14 (* 8672 v_prenex_152))) (or (<= 0 v_prenex_151) (not (= 8673 (div .cse14 v_prenex_151))) (not (= (mod .cse15 v_prenex_151) 0)) (not (= (div .cse15 v_prenex_151) 8608)) (<= 0 .cse14) (= 0 (mod .cse14 v_prenex_151))))) (forall ((v_prenex_127 Int) (v_prenex_128 Int)) (let ((.cse16 (* c_ssl3_accept_~ag_X~0 v_prenex_128)) (.cse17 (* 8672 v_prenex_128))) (or (< v_prenex_127 0) (< .cse16 0) (not (= (mod .cse16 v_prenex_127) 0)) (not (= (div .cse16 v_prenex_127) 8608)) (= 0 (mod .cse17 v_prenex_127)) (<= 0 .cse17) (not (= 8671 (div .cse17 v_prenex_127)))))) (forall ((v_prenex_138 Int) (v_prenex_137 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_138)) (.cse18 (* 8672 v_prenex_138))) (or (not (= 8672 (div .cse18 v_prenex_137))) (< .cse19 0) (not (= (mod .cse19 v_prenex_137) 0)) (< v_prenex_137 0) (not (= (div .cse19 v_prenex_137) 8608)) (< .cse18 0)))) (forall ((v_prenex_145 Int) (v_prenex_146 Int)) (let ((.cse20 (* 8672 v_prenex_146)) (.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_146))) (or (<= 0 .cse20) (< v_prenex_145 0) (= 0 (mod .cse20 v_prenex_145)) (not (< .cse21 0)) (not (= 8671 (div .cse20 v_prenex_145))) (= (mod .cse21 v_prenex_145) 0) (not (= (div .cse21 v_prenex_145) 8607))))) (forall ((v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse22 (* 8672 v_prenex_130)) (.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_130))) (or (<= 0 .cse22) (<= 0 v_prenex_129) (not (= (div .cse23 v_prenex_129) 8608)) (= 0 (mod .cse22 v_prenex_129)) (not (= 8673 (div .cse22 v_prenex_129))) (< v_prenex_129 0) (not (= (mod .cse23 v_prenex_129) 0))))) (forall ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse25 (* c_ssl3_accept_~ag_X~0 v_prenex_124)) (.cse24 (* 8672 v_prenex_124))) (or (not (= 8672 (div .cse24 v_prenex_123))) (<= 0 v_prenex_123) (not (= (div .cse25 v_prenex_123) 8608)) (not (= (mod .cse25 v_prenex_123) 0)) (not (= 0 (mod .cse24 v_prenex_123)))))) (forall ((v_prenex_116 Int) (v_prenex_115 Int)) (let ((.cse26 (* 8672 v_prenex_116)) (.cse27 (* c_ssl3_accept_~ag_X~0 v_prenex_116))) (or (< .cse26 0) (not (= (div .cse27 v_prenex_115) 8608)) (<= 0 v_prenex_115) (< .cse27 0) (not (= 8672 (div .cse26 v_prenex_115))) (not (= (mod .cse27 v_prenex_115) 0))))) (forall ((v_prenex_114 Int) (v_prenex_113 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_114)) (.cse29 (* 8672 v_prenex_114))) (or (not (= (div .cse28 v_prenex_113) 8608)) (not (= 8672 (div .cse29 v_prenex_113))) (<= 0 v_prenex_113) (not (= (mod .cse28 v_prenex_113) 0)) (< .cse29 0)))) (forall ((v_prenex_156 Int) (v_prenex_155 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_155)) (.cse30 (* 8672 v_prenex_155))) (or (= 0 (mod .cse30 v_prenex_156)) (not (= (div .cse31 v_prenex_156) 8608)) (not (= 8671 (div .cse30 v_prenex_156))) (not (= (mod .cse31 v_prenex_156) 0)) (<= 0 .cse30) (< v_prenex_156 0)))) (forall ((v_prenex_134 Int) (v_prenex_133 Int)) (let ((.cse32 (* 8672 v_prenex_134)) (.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_134))) (or (not (= 8672 (div .cse32 v_prenex_133))) (not (= (div .cse33 v_prenex_133) 8608)) (< v_prenex_133 0) (not (= 0 (mod .cse32 v_prenex_133))) (not (= (mod .cse33 v_prenex_133) 0))))) (forall ((v_prenex_149 Int) (v_prenex_150 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_150)) (.cse34 (* 8672 v_prenex_150))) (or (not (= 8672 (div .cse34 v_prenex_149))) (not (= (div .cse35 v_prenex_149) 8608)) (< .cse35 0) (<= 0 v_prenex_149) (not (= 0 (mod .cse34 v_prenex_149)))))) (forall ((v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse36 (* 8672 v_prenex_142)) (.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_142))) (or (<= 0 .cse36) (= (mod .cse37 v_prenex_141) 0) (not (= (div .cse37 v_prenex_141) 8607)) (< v_prenex_141 0) (= 0 (mod .cse36 v_prenex_141)) (not (= 8673 (div .cse36 v_prenex_141))) (<= 0 v_prenex_141) (not (< .cse37 0))))) (not (= c_ssl3_accept_~s__state~0 8672)) (forall ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse38 (* 8672 v_prenex_118)) (.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_118))) (or (not (= 8671 (div .cse38 v_prenex_117))) (= 0 (mod .cse38 v_prenex_117)) (< .cse39 0) (<= 0 .cse38) (not (= (div .cse39 v_prenex_117) 8608)) (< v_prenex_117 0)))) (forall ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_140)) (.cse41 (* 8672 v_prenex_140))) (or (<= 0 v_prenex_139) (not (= (div .cse40 v_prenex_139) 8609)) (not (= 0 (mod .cse41 v_prenex_139))) (not (< .cse40 0)) (= (mod .cse40 v_prenex_139) 0) (not (= 8672 (div .cse41 v_prenex_139)))))) (forall ((v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse42 (* 8672 v_prenex_161)) (.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_161))) (or (not (= 0 (mod .cse42 v_prenex_162))) (< v_prenex_162 0) (< .cse43 0) (not (= (mod .cse43 v_prenex_162) 0)) (not (= 8672 (div .cse42 v_prenex_162))) (not (= (div .cse43 v_prenex_162) 8608))))) (forall ((v_prenex_110 Int) (v_prenex_109 Int)) (let ((.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_110)) (.cse45 (* 8672 v_prenex_110))) (or (<= 0 v_prenex_109) (not (= (mod .cse44 v_prenex_109) 0)) (not (= (div .cse44 v_prenex_109) 8608)) (not (= 0 (mod .cse45 v_prenex_109))) (< .cse44 0) (not (= 8672 (div .cse45 v_prenex_109)))))) (forall ((v_prenex_143 Int) (v_prenex_144 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 v_prenex_144)) (.cse46 (* 8672 v_prenex_144))) (or (<= 0 .cse46) (<= 0 v_prenex_143) (not (= (div .cse47 v_prenex_143) 8609)) (= 0 (mod .cse46 v_prenex_143)) (= (mod .cse47 v_prenex_143) 0) (not (< .cse47 0)) (not (= 8673 (div .cse46 v_prenex_143)))))) (forall ((v_prenex_112 Int) (v_prenex_111 Int)) (let ((.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_112)) (.cse49 (* 8672 v_prenex_112))) (or (not (< .cse48 0)) (not (= (div .cse48 v_prenex_111) 8609)) (not (= 8672 (div .cse49 v_prenex_111))) (<= 0 v_prenex_111) (= (mod .cse48 v_prenex_111) 0) (< .cse49 0)))) (forall ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse51 (* 8672 v_prenex_148)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_148))) (or (= (mod .cse50 v_prenex_147) 0) (not (= (div .cse50 v_prenex_147) 8607)) (not (= 8672 (div .cse51 v_prenex_147))) (< v_prenex_147 0) (< .cse51 0) (not (< .cse50 0))))) (forall ((v_prenex_154 Int) (v_prenex_153 Int)) (let ((.cse53 (* 8672 v_prenex_154)) (.cse52 (* c_ssl3_accept_~ag_X~0 v_prenex_154))) (or (< .cse52 0) (not (= 8673 (div .cse53 v_prenex_153))) (<= 0 .cse53) (not (= (mod .cse52 v_prenex_153) 0)) (= 0 (mod .cse53 v_prenex_153)) (not (= (div .cse52 v_prenex_153) 8608)) (<= 0 v_prenex_153)))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_158 Int) (v_prenex_157 Int)) (let ((.cse55 (* 8672 v_prenex_157)) (.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_157))) (or (not (= (div .cse54 v_prenex_158) 8607)) (not (= 0 (mod .cse55 v_prenex_158))) (not (< .cse54 0)) (< v_prenex_158 0) (not (= 8672 (div .cse55 v_prenex_158))) (= (mod .cse54 v_prenex_158) 0))))) is different from true [2019-09-09 05:53:54,605 WARN L188 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-09 05:53:59,603 WARN L188 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-09 05:54:01,993 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-09 05:54:13,097 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-09 05:54:13,690 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-09 05:54:14,042 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-09 05:54:20,258 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-09 05:54:26,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse59 (* 8672 c_ssl3_accept_~ag_Y~0)) (.cse64 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse11 (div .cse64 c_ssl3_accept_~ag_Z~0)) (.cse14 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse10 (= (mod .cse64 c_ssl3_accept_~ag_Z~0) 0)) (.cse13 (<= 0 c_ssl3_accept_~ag_Z~0)) (.cse12 (< c_ssl3_accept_~ag_Z~0 0)) (.cse61 (= 0 (mod .cse59 c_ssl3_accept_~ag_Z~0))) (.cse60 (div .cse59 c_ssl3_accept_~ag_Z~0))) (and (forall ((v_prenex_132 Int) (v_prenex_131 Int)) (let ((.cse0 (* 8672 v_prenex_132)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_132))) (or (= 0 (mod .cse0 v_prenex_131)) (not (= 8673 (div .cse0 v_prenex_131))) (< .cse1 0) (<= 0 v_prenex_131) (<= 0 .cse0) (< v_prenex_131 0) (not (= (div .cse1 v_prenex_131) 8608))))) (forall ((v_prenex_120 Int) (v_prenex_119 Int)) (let ((.cse2 (* 8672 v_prenex_120)) (.cse3 (* c_ssl3_accept_~ag_X~0 v_prenex_120))) (or (not (= 0 (mod .cse2 v_prenex_119))) (not (= 8672 (div .cse2 v_prenex_119))) (< .cse3 0) (not (= (div .cse3 v_prenex_119) 8608)) (< v_prenex_119 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (<= 0 .cse5) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse5 ssl3_accept_~ag_Z~0))))) (forall ((v_prenex_159 Int) (v_prenex_160 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_159)) (.cse7 (* 8672 v_prenex_159))) (or (<= 0 v_prenex_160) (not (= (div .cse6 v_prenex_160) 8608)) (< .cse6 0) (not (= 8673 (div .cse7 v_prenex_160))) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_160))))) (forall ((v_prenex_125 Int) (v_prenex_126 Int)) (let ((.cse9 (* c_ssl3_accept_~ag_X~0 v_prenex_126)) (.cse8 (* 8672 v_prenex_126))) (or (< .cse8 0) (<= 0 v_prenex_125) (< .cse9 0) (not (= (div .cse9 v_prenex_125) 8608)) (not (= 8672 (div .cse8 v_prenex_125)))))) (or .cse10 (and (or (not (= .cse11 8671)) .cse12) (or .cse13 (not (= .cse11 8673)))) (not .cse14)) (forall ((v_prenex_121 Int) (v_prenex_122 Int)) (let ((.cse15 (* 8672 v_prenex_122)) (.cse16 (* c_ssl3_accept_~ag_X~0 v_prenex_122))) (or (< v_prenex_121 0) (< .cse15 0) (not (= (div .cse16 v_prenex_121) 8608)) (not (= 8672 (div .cse15 v_prenex_121))) (not (= (mod .cse16 v_prenex_121) 0))))) (forall ((v_prenex_136 Int) (v_prenex_135 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 v_prenex_136)) (.cse18 (* 8672 v_prenex_136))) (or (< v_prenex_135 0) (< .cse17 0) (not (= (div .cse17 v_prenex_135) 8608)) (not (= 8672 (div .cse18 v_prenex_135))) (< .cse18 0)))) (forall ((v_prenex_152 Int) (v_prenex_151 Int)) (let ((.cse20 (* c_ssl3_accept_~ag_X~0 v_prenex_152)) (.cse19 (* 8672 v_prenex_152))) (or (<= 0 v_prenex_151) (not (= 8673 (div .cse19 v_prenex_151))) (not (= (mod .cse20 v_prenex_151) 0)) (not (= (div .cse20 v_prenex_151) 8608)) (<= 0 .cse19) (= 0 (mod .cse19 v_prenex_151))))) (forall ((v_prenex_127 Int) (v_prenex_128 Int)) (let ((.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_128)) (.cse22 (* 8672 v_prenex_128))) (or (< v_prenex_127 0) (< .cse21 0) (not (= (mod .cse21 v_prenex_127) 0)) (not (= (div .cse21 v_prenex_127) 8608)) (= 0 (mod .cse22 v_prenex_127)) (<= 0 .cse22) (not (= 8671 (div .cse22 v_prenex_127)))))) (forall ((v_prenex_138 Int) (v_prenex_137 Int)) (let ((.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_138)) (.cse23 (* 8672 v_prenex_138))) (or (not (= 8672 (div .cse23 v_prenex_137))) (< .cse24 0) (not (= (mod .cse24 v_prenex_137) 0)) (< v_prenex_137 0) (not (= (div .cse24 v_prenex_137) 8608)) (< .cse23 0)))) (forall ((v_prenex_145 Int) (v_prenex_146 Int)) (let ((.cse25 (* 8672 v_prenex_146)) (.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_146))) (or (<= 0 .cse25) (< v_prenex_145 0) (= 0 (mod .cse25 v_prenex_145)) (not (< .cse26 0)) (not (= 8671 (div .cse25 v_prenex_145))) (= (mod .cse26 v_prenex_145) 0) (not (= (div .cse26 v_prenex_145) 8607))))) (forall ((v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse27 (* 8672 v_prenex_130)) (.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_130))) (or (<= 0 .cse27) (<= 0 v_prenex_129) (not (= (div .cse28 v_prenex_129) 8608)) (= 0 (mod .cse27 v_prenex_129)) (not (= 8673 (div .cse27 v_prenex_129))) (< v_prenex_129 0) (not (= (mod .cse28 v_prenex_129) 0))))) (forall ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_124)) (.cse29 (* 8672 v_prenex_124))) (or (not (= 8672 (div .cse29 v_prenex_123))) (<= 0 v_prenex_123) (not (= (div .cse30 v_prenex_123) 8608)) (not (= (mod .cse30 v_prenex_123) 0)) (not (= 0 (mod .cse29 v_prenex_123)))))) (forall ((v_prenex_116 Int) (v_prenex_115 Int)) (let ((.cse31 (* 8672 v_prenex_116)) (.cse32 (* c_ssl3_accept_~ag_X~0 v_prenex_116))) (or (< .cse31 0) (not (= (div .cse32 v_prenex_115) 8608)) (<= 0 v_prenex_115) (< .cse32 0) (not (= 8672 (div .cse31 v_prenex_115))) (not (= (mod .cse32 v_prenex_115) 0))))) (forall ((v_prenex_114 Int) (v_prenex_113 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_114)) (.cse34 (* 8672 v_prenex_114))) (or (not (= (div .cse33 v_prenex_113) 8608)) (not (= 8672 (div .cse34 v_prenex_113))) (<= 0 v_prenex_113) (not (= (mod .cse33 v_prenex_113) 0)) (< .cse34 0)))) (forall ((v_prenex_156 Int) (v_prenex_155 Int)) (let ((.cse36 (* c_ssl3_accept_~ag_X~0 v_prenex_155)) (.cse35 (* 8672 v_prenex_155))) (or (= 0 (mod .cse35 v_prenex_156)) (not (= (div .cse36 v_prenex_156) 8608)) (not (= 8671 (div .cse35 v_prenex_156))) (not (= (mod .cse36 v_prenex_156) 0)) (<= 0 .cse35) (< v_prenex_156 0)))) (forall ((v_prenex_134 Int) (v_prenex_133 Int)) (let ((.cse37 (* 8672 v_prenex_134)) (.cse38 (* c_ssl3_accept_~ag_X~0 v_prenex_134))) (or (not (= 8672 (div .cse37 v_prenex_133))) (not (= (div .cse38 v_prenex_133) 8608)) (< v_prenex_133 0) (not (= 0 (mod .cse37 v_prenex_133))) (not (= (mod .cse38 v_prenex_133) 0))))) (forall ((v_prenex_149 Int) (v_prenex_150 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_150)) (.cse39 (* 8672 v_prenex_150))) (or (not (= 8672 (div .cse39 v_prenex_149))) (not (= (div .cse40 v_prenex_149) 8608)) (< .cse40 0) (<= 0 v_prenex_149) (not (= 0 (mod .cse39 v_prenex_149)))))) (forall ((v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse41 (* 8672 v_prenex_142)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_142))) (or (<= 0 .cse41) (= (mod .cse42 v_prenex_141) 0) (not (= (div .cse42 v_prenex_141) 8607)) (< v_prenex_141 0) (= 0 (mod .cse41 v_prenex_141)) (not (= 8673 (div .cse41 v_prenex_141))) (<= 0 v_prenex_141) (not (< .cse42 0))))) (not (= c_ssl3_accept_~s__state~0 8672)) (forall ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse43 (* 8672 v_prenex_118)) (.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_118))) (or (not (= 8671 (div .cse43 v_prenex_117))) (= 0 (mod .cse43 v_prenex_117)) (< .cse44 0) (<= 0 .cse43) (not (= (div .cse44 v_prenex_117) 8608)) (< v_prenex_117 0)))) (forall ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_140)) (.cse46 (* 8672 v_prenex_140))) (or (<= 0 v_prenex_139) (not (= (div .cse45 v_prenex_139) 8609)) (not (= 0 (mod .cse46 v_prenex_139))) (not (< .cse45 0)) (= (mod .cse45 v_prenex_139) 0) (not (= 8672 (div .cse46 v_prenex_139)))))) (forall ((v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse47 (* 8672 v_prenex_161)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_161))) (or (not (= 0 (mod .cse47 v_prenex_162))) (< v_prenex_162 0) (< .cse48 0) (not (= (mod .cse48 v_prenex_162) 0)) (not (= 8672 (div .cse47 v_prenex_162))) (not (= (div .cse48 v_prenex_162) 8608))))) (forall ((v_prenex_110 Int) (v_prenex_109 Int)) (let ((.cse49 (* c_ssl3_accept_~ag_X~0 v_prenex_110)) (.cse50 (* 8672 v_prenex_110))) (or (<= 0 v_prenex_109) (not (= (mod .cse49 v_prenex_109) 0)) (not (= (div .cse49 v_prenex_109) 8608)) (not (= 0 (mod .cse50 v_prenex_109))) (< .cse49 0) (not (= 8672 (div .cse50 v_prenex_109)))))) (forall ((v_prenex_143 Int) (v_prenex_144 Int)) (let ((.cse52 (* c_ssl3_accept_~ag_X~0 v_prenex_144)) (.cse51 (* 8672 v_prenex_144))) (or (<= 0 .cse51) (<= 0 v_prenex_143) (not (= (div .cse52 v_prenex_143) 8609)) (= 0 (mod .cse51 v_prenex_143)) (= (mod .cse52 v_prenex_143) 0) (not (< .cse52 0)) (not (= 8673 (div .cse51 v_prenex_143)))))) (forall ((v_prenex_112 Int) (v_prenex_111 Int)) (let ((.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_112)) (.cse54 (* 8672 v_prenex_112))) (or (not (< .cse53 0)) (not (= (div .cse53 v_prenex_111) 8609)) (not (= 8672 (div .cse54 v_prenex_111))) (<= 0 v_prenex_111) (= (mod .cse53 v_prenex_111) 0) (< .cse54 0)))) (forall ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse56 (* 8672 v_prenex_148)) (.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_148))) (or (= (mod .cse55 v_prenex_147) 0) (not (= (div .cse55 v_prenex_147) 8607)) (not (= 8672 (div .cse56 v_prenex_147))) (< v_prenex_147 0) (< .cse56 0) (not (< .cse55 0))))) (or (not (= .cse11 8672)) (and .cse14 (not .cse10))) (forall ((v_prenex_154 Int) (v_prenex_153 Int)) (let ((.cse58 (* 8672 v_prenex_154)) (.cse57 (* c_ssl3_accept_~ag_X~0 v_prenex_154))) (or (< .cse57 0) (not (= 8673 (div .cse58 v_prenex_153))) (<= 0 .cse58) (not (= (mod .cse57 v_prenex_153) 0)) (= 0 (mod .cse58 v_prenex_153)) (not (= (div .cse57 v_prenex_153) 8608)) (<= 0 v_prenex_153)))) (= c_ssl3_accept_~ag_X~0 8672) (or (<= 0 .cse59) (and (or (not (= 8673 .cse60)) .cse13) (or (not (= 8671 .cse60)) .cse12)) .cse61) (or (and (not .cse61) (< .cse59 0)) (not (= 8672 .cse60))) (forall ((v_prenex_158 Int) (v_prenex_157 Int)) (let ((.cse63 (* 8672 v_prenex_157)) (.cse62 (* c_ssl3_accept_~ag_X~0 v_prenex_157))) (or (not (= (div .cse62 v_prenex_158) 8607)) (not (= 0 (mod .cse63 v_prenex_158))) (not (< .cse62 0)) (< v_prenex_158 0) (not (= 8672 (div .cse63 v_prenex_158))) (= (mod .cse62 v_prenex_158) 0))))))) is different from false [2019-09-09 05:54:26,518 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse59 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse11 (div .cse59 c_ssl3_accept_~ag_Z~0)) (.cse12 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse10 (= (mod .cse59 c_ssl3_accept_~ag_Z~0) 0))) (and (forall ((v_prenex_132 Int) (v_prenex_131 Int)) (let ((.cse0 (* 8672 v_prenex_132)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_132))) (or (= 0 (mod .cse0 v_prenex_131)) (not (= 8673 (div .cse0 v_prenex_131))) (< .cse1 0) (<= 0 v_prenex_131) (<= 0 .cse0) (< v_prenex_131 0) (not (= (div .cse1 v_prenex_131) 8608))))) (forall ((v_prenex_120 Int) (v_prenex_119 Int)) (let ((.cse2 (* 8672 v_prenex_120)) (.cse3 (* c_ssl3_accept_~ag_X~0 v_prenex_120))) (or (not (= 0 (mod .cse2 v_prenex_119))) (not (= 8672 (div .cse2 v_prenex_119))) (< .cse3 0) (not (= (div .cse3 v_prenex_119) 8608)) (< v_prenex_119 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (<= 0 .cse5) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse5 ssl3_accept_~ag_Z~0))))) (forall ((v_prenex_159 Int) (v_prenex_160 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_159)) (.cse7 (* 8672 v_prenex_159))) (or (<= 0 v_prenex_160) (not (= (div .cse6 v_prenex_160) 8608)) (< .cse6 0) (not (= 8673 (div .cse7 v_prenex_160))) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_160))))) (forall ((v_prenex_125 Int) (v_prenex_126 Int)) (let ((.cse9 (* c_ssl3_accept_~ag_X~0 v_prenex_126)) (.cse8 (* 8672 v_prenex_126))) (or (< .cse8 0) (<= 0 v_prenex_125) (< .cse9 0) (not (= (div .cse9 v_prenex_125) 8608)) (not (= 8672 (div .cse8 v_prenex_125)))))) (or .cse10 (and (or (not (= .cse11 8671)) (< c_ssl3_accept_~ag_Z~0 0)) (or (<= 0 c_ssl3_accept_~ag_Z~0) (not (= .cse11 8673)))) (not .cse12)) (forall ((v_prenex_121 Int) (v_prenex_122 Int)) (let ((.cse13 (* 8672 v_prenex_122)) (.cse14 (* c_ssl3_accept_~ag_X~0 v_prenex_122))) (or (< v_prenex_121 0) (< .cse13 0) (not (= (div .cse14 v_prenex_121) 8608)) (not (= 8672 (div .cse13 v_prenex_121))) (not (= (mod .cse14 v_prenex_121) 0))))) (forall ((v_prenex_136 Int) (v_prenex_135 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_136)) (.cse16 (* 8672 v_prenex_136))) (or (< v_prenex_135 0) (< .cse15 0) (not (= (div .cse15 v_prenex_135) 8608)) (not (= 8672 (div .cse16 v_prenex_135))) (< .cse16 0)))) (forall ((v_prenex_152 Int) (v_prenex_151 Int)) (let ((.cse18 (* c_ssl3_accept_~ag_X~0 v_prenex_152)) (.cse17 (* 8672 v_prenex_152))) (or (<= 0 v_prenex_151) (not (= 8673 (div .cse17 v_prenex_151))) (not (= (mod .cse18 v_prenex_151) 0)) (not (= (div .cse18 v_prenex_151) 8608)) (<= 0 .cse17) (= 0 (mod .cse17 v_prenex_151))))) (forall ((v_prenex_127 Int) (v_prenex_128 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_128)) (.cse20 (* 8672 v_prenex_128))) (or (< v_prenex_127 0) (< .cse19 0) (not (= (mod .cse19 v_prenex_127) 0)) (not (= (div .cse19 v_prenex_127) 8608)) (= 0 (mod .cse20 v_prenex_127)) (<= 0 .cse20) (not (= 8671 (div .cse20 v_prenex_127)))))) (forall ((v_prenex_138 Int) (v_prenex_137 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_138)) (.cse21 (* 8672 v_prenex_138))) (or (not (= 8672 (div .cse21 v_prenex_137))) (< .cse22 0) (not (= (mod .cse22 v_prenex_137) 0)) (< v_prenex_137 0) (not (= (div .cse22 v_prenex_137) 8608)) (< .cse21 0)))) (forall ((v_prenex_145 Int) (v_prenex_146 Int)) (let ((.cse23 (* 8672 v_prenex_146)) (.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_146))) (or (<= 0 .cse23) (< v_prenex_145 0) (= 0 (mod .cse23 v_prenex_145)) (not (< .cse24 0)) (not (= 8671 (div .cse23 v_prenex_145))) (= (mod .cse24 v_prenex_145) 0) (not (= (div .cse24 v_prenex_145) 8607))))) (forall ((v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse25 (* 8672 v_prenex_130)) (.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_130))) (or (<= 0 .cse25) (<= 0 v_prenex_129) (not (= (div .cse26 v_prenex_129) 8608)) (= 0 (mod .cse25 v_prenex_129)) (not (= 8673 (div .cse25 v_prenex_129))) (< v_prenex_129 0) (not (= (mod .cse26 v_prenex_129) 0))))) (forall ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_124)) (.cse27 (* 8672 v_prenex_124))) (or (not (= 8672 (div .cse27 v_prenex_123))) (<= 0 v_prenex_123) (not (= (div .cse28 v_prenex_123) 8608)) (not (= (mod .cse28 v_prenex_123) 0)) (not (= 0 (mod .cse27 v_prenex_123)))))) (forall ((v_prenex_116 Int) (v_prenex_115 Int)) (let ((.cse29 (* 8672 v_prenex_116)) (.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_116))) (or (< .cse29 0) (not (= (div .cse30 v_prenex_115) 8608)) (<= 0 v_prenex_115) (< .cse30 0) (not (= 8672 (div .cse29 v_prenex_115))) (not (= (mod .cse30 v_prenex_115) 0))))) (forall ((v_prenex_114 Int) (v_prenex_113 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_114)) (.cse32 (* 8672 v_prenex_114))) (or (not (= (div .cse31 v_prenex_113) 8608)) (not (= 8672 (div .cse32 v_prenex_113))) (<= 0 v_prenex_113) (not (= (mod .cse31 v_prenex_113) 0)) (< .cse32 0)))) (forall ((v_prenex_156 Int) (v_prenex_155 Int)) (let ((.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_155)) (.cse33 (* 8672 v_prenex_155))) (or (= 0 (mod .cse33 v_prenex_156)) (not (= (div .cse34 v_prenex_156) 8608)) (not (= 8671 (div .cse33 v_prenex_156))) (not (= (mod .cse34 v_prenex_156) 0)) (<= 0 .cse33) (< v_prenex_156 0)))) (forall ((v_prenex_134 Int) (v_prenex_133 Int)) (let ((.cse35 (* 8672 v_prenex_134)) (.cse36 (* c_ssl3_accept_~ag_X~0 v_prenex_134))) (or (not (= 8672 (div .cse35 v_prenex_133))) (not (= (div .cse36 v_prenex_133) 8608)) (< v_prenex_133 0) (not (= 0 (mod .cse35 v_prenex_133))) (not (= (mod .cse36 v_prenex_133) 0))))) (forall ((v_prenex_149 Int) (v_prenex_150 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 v_prenex_150)) (.cse37 (* 8672 v_prenex_150))) (or (not (= 8672 (div .cse37 v_prenex_149))) (not (= (div .cse38 v_prenex_149) 8608)) (< .cse38 0) (<= 0 v_prenex_149) (not (= 0 (mod .cse37 v_prenex_149)))))) (forall ((v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse39 (* 8672 v_prenex_142)) (.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_142))) (or (<= 0 .cse39) (= (mod .cse40 v_prenex_141) 0) (not (= (div .cse40 v_prenex_141) 8607)) (< v_prenex_141 0) (= 0 (mod .cse39 v_prenex_141)) (not (= 8673 (div .cse39 v_prenex_141))) (<= 0 v_prenex_141) (not (< .cse40 0))))) (forall ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse41 (* 8672 v_prenex_118)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_118))) (or (not (= 8671 (div .cse41 v_prenex_117))) (= 0 (mod .cse41 v_prenex_117)) (< .cse42 0) (<= 0 .cse41) (not (= (div .cse42 v_prenex_117) 8608)) (< v_prenex_117 0)))) (forall ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_140)) (.cse44 (* 8672 v_prenex_140))) (or (<= 0 v_prenex_139) (not (= (div .cse43 v_prenex_139) 8609)) (not (= 0 (mod .cse44 v_prenex_139))) (not (< .cse43 0)) (= (mod .cse43 v_prenex_139) 0) (not (= 8672 (div .cse44 v_prenex_139)))))) (forall ((v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse45 (* 8672 v_prenex_161)) (.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_161))) (or (not (= 0 (mod .cse45 v_prenex_162))) (< v_prenex_162 0) (< .cse46 0) (not (= (mod .cse46 v_prenex_162) 0)) (not (= 8672 (div .cse45 v_prenex_162))) (not (= (div .cse46 v_prenex_162) 8608))))) (forall ((v_prenex_110 Int) (v_prenex_109 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 v_prenex_110)) (.cse48 (* 8672 v_prenex_110))) (or (<= 0 v_prenex_109) (not (= (mod .cse47 v_prenex_109) 0)) (not (= (div .cse47 v_prenex_109) 8608)) (not (= 0 (mod .cse48 v_prenex_109))) (< .cse47 0) (not (= 8672 (div .cse48 v_prenex_109)))))) (forall ((v_prenex_143 Int) (v_prenex_144 Int)) (let ((.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_144)) (.cse49 (* 8672 v_prenex_144))) (or (<= 0 .cse49) (<= 0 v_prenex_143) (not (= (div .cse50 v_prenex_143) 8609)) (= 0 (mod .cse49 v_prenex_143)) (= (mod .cse50 v_prenex_143) 0) (not (< .cse50 0)) (not (= 8673 (div .cse49 v_prenex_143)))))) (forall ((v_prenex_112 Int) (v_prenex_111 Int)) (let ((.cse51 (* c_ssl3_accept_~ag_X~0 v_prenex_112)) (.cse52 (* 8672 v_prenex_112))) (or (not (< .cse51 0)) (not (= (div .cse51 v_prenex_111) 8609)) (not (= 8672 (div .cse52 v_prenex_111))) (<= 0 v_prenex_111) (= (mod .cse51 v_prenex_111) 0) (< .cse52 0)))) (forall ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse54 (* 8672 v_prenex_148)) (.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_148))) (or (= (mod .cse53 v_prenex_147) 0) (not (= (div .cse53 v_prenex_147) 8607)) (not (= 8672 (div .cse54 v_prenex_147))) (< v_prenex_147 0) (< .cse54 0) (not (< .cse53 0))))) (or (not (= .cse11 8672)) (and .cse12 (not .cse10))) (forall ((v_prenex_154 Int) (v_prenex_153 Int)) (let ((.cse56 (* 8672 v_prenex_154)) (.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_154))) (or (< .cse55 0) (not (= 8673 (div .cse56 v_prenex_153))) (<= 0 .cse56) (not (= (mod .cse55 v_prenex_153) 0)) (= 0 (mod .cse56 v_prenex_153)) (not (= (div .cse55 v_prenex_153) 8608)) (<= 0 v_prenex_153)))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_158 Int) (v_prenex_157 Int)) (let ((.cse58 (* 8672 v_prenex_157)) (.cse57 (* c_ssl3_accept_~ag_X~0 v_prenex_157))) (or (not (= (div .cse57 v_prenex_158) 8607)) (not (= 0 (mod .cse58 v_prenex_158))) (not (< .cse57 0)) (< v_prenex_158 0) (not (= 8672 (div .cse58 v_prenex_158))) (= (mod .cse57 v_prenex_158) 0))))))) is different from false [2019-09-09 05:54:28,342 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-09-09 05:54:31,028 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_132 Int) (v_prenex_131 Int)) (let ((.cse0 (* 8672 v_prenex_132)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_132))) (or (= 0 (mod .cse0 v_prenex_131)) (not (= 8673 (div .cse0 v_prenex_131))) (< .cse1 0) (<= 0 v_prenex_131) (<= 0 .cse0) (< v_prenex_131 0) (not (= (div .cse1 v_prenex_131) 8608))))) (forall ((v_prenex_120 Int) (v_prenex_119 Int)) (let ((.cse2 (* 8672 v_prenex_120)) (.cse3 (* c_ssl3_accept_~ag_X~0 v_prenex_120))) (or (not (= 0 (mod .cse2 v_prenex_119))) (not (= 8672 (div .cse2 v_prenex_119))) (< .cse3 0) (not (= (div .cse3 v_prenex_119) 8608)) (< v_prenex_119 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse4 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse5 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse4 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse5 ssl3_accept_~ag_Z~0))) (<= 0 .cse5) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse4 ssl3_accept_~ag_Z~0) 8608)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse5 ssl3_accept_~ag_Z~0))))) (forall ((v_prenex_159 Int) (v_prenex_160 Int)) (let ((.cse6 (* c_ssl3_accept_~ag_X~0 v_prenex_159)) (.cse7 (* 8672 v_prenex_159))) (or (<= 0 v_prenex_160) (not (= (div .cse6 v_prenex_160) 8608)) (< .cse6 0) (not (= 8673 (div .cse7 v_prenex_160))) (<= 0 .cse7) (= 0 (mod .cse7 v_prenex_160))))) (forall ((v_prenex_125 Int) (v_prenex_126 Int)) (let ((.cse9 (* c_ssl3_accept_~ag_X~0 v_prenex_126)) (.cse8 (* 8672 v_prenex_126))) (or (< .cse8 0) (<= 0 v_prenex_125) (< .cse9 0) (not (= (div .cse9 v_prenex_125) 8608)) (not (= 8672 (div .cse8 v_prenex_125)))))) (forall ((v_prenex_121 Int) (v_prenex_122 Int)) (let ((.cse10 (* 8672 v_prenex_122)) (.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_122))) (or (< v_prenex_121 0) (< .cse10 0) (not (= (div .cse11 v_prenex_121) 8608)) (not (= 8672 (div .cse10 v_prenex_121))) (not (= (mod .cse11 v_prenex_121) 0))))) (forall ((v_prenex_136 Int) (v_prenex_135 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 v_prenex_136)) (.cse13 (* 8672 v_prenex_136))) (or (< v_prenex_135 0) (< .cse12 0) (not (= (div .cse12 v_prenex_135) 8608)) (not (= 8672 (div .cse13 v_prenex_135))) (< .cse13 0)))) (or (let ((.cse14 (* 8672 c_ssl3_accept_~ag_Y~0))) (let ((.cse16 (= 0 (mod .cse14 c_ssl3_accept_~ag_Z~0))) (.cse15 (div .cse14 c_ssl3_accept_~ag_Z~0))) (and (or (<= 0 .cse14) (and (or (not (= 8673 .cse15)) (<= 0 c_ssl3_accept_~ag_Z~0)) (or (not (= 8671 .cse15)) (< c_ssl3_accept_~ag_Z~0 0))) .cse16) (or (and (not .cse16) (< .cse14 0)) (not (= 8672 .cse15)))))) (not (= c_ssl3_accept_~s__state~0 8608))) (forall ((v_prenex_152 Int) (v_prenex_151 Int)) (let ((.cse18 (* c_ssl3_accept_~ag_X~0 v_prenex_152)) (.cse17 (* 8672 v_prenex_152))) (or (<= 0 v_prenex_151) (not (= 8673 (div .cse17 v_prenex_151))) (not (= (mod .cse18 v_prenex_151) 0)) (not (= (div .cse18 v_prenex_151) 8608)) (<= 0 .cse17) (= 0 (mod .cse17 v_prenex_151))))) (forall ((v_prenex_127 Int) (v_prenex_128 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_128)) (.cse20 (* 8672 v_prenex_128))) (or (< v_prenex_127 0) (< .cse19 0) (not (= (mod .cse19 v_prenex_127) 0)) (not (= (div .cse19 v_prenex_127) 8608)) (= 0 (mod .cse20 v_prenex_127)) (<= 0 .cse20) (not (= 8671 (div .cse20 v_prenex_127)))))) (forall ((v_prenex_138 Int) (v_prenex_137 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_138)) (.cse21 (* 8672 v_prenex_138))) (or (not (= 8672 (div .cse21 v_prenex_137))) (< .cse22 0) (not (= (mod .cse22 v_prenex_137) 0)) (< v_prenex_137 0) (not (= (div .cse22 v_prenex_137) 8608)) (< .cse21 0)))) (forall ((v_prenex_145 Int) (v_prenex_146 Int)) (let ((.cse23 (* 8672 v_prenex_146)) (.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_146))) (or (<= 0 .cse23) (< v_prenex_145 0) (= 0 (mod .cse23 v_prenex_145)) (not (< .cse24 0)) (not (= 8671 (div .cse23 v_prenex_145))) (= (mod .cse24 v_prenex_145) 0) (not (= (div .cse24 v_prenex_145) 8607))))) (forall ((v_prenex_130 Int) (v_prenex_129 Int)) (let ((.cse25 (* 8672 v_prenex_130)) (.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_130))) (or (<= 0 .cse25) (<= 0 v_prenex_129) (not (= (div .cse26 v_prenex_129) 8608)) (= 0 (mod .cse25 v_prenex_129)) (not (= 8673 (div .cse25 v_prenex_129))) (< v_prenex_129 0) (not (= (mod .cse26 v_prenex_129) 0))))) (forall ((v_prenex_123 Int) (v_prenex_124 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_124)) (.cse27 (* 8672 v_prenex_124))) (or (not (= 8672 (div .cse27 v_prenex_123))) (<= 0 v_prenex_123) (not (= (div .cse28 v_prenex_123) 8608)) (not (= (mod .cse28 v_prenex_123) 0)) (not (= 0 (mod .cse27 v_prenex_123)))))) (forall ((v_prenex_116 Int) (v_prenex_115 Int)) (let ((.cse29 (* 8672 v_prenex_116)) (.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_116))) (or (< .cse29 0) (not (= (div .cse30 v_prenex_115) 8608)) (<= 0 v_prenex_115) (< .cse30 0) (not (= 8672 (div .cse29 v_prenex_115))) (not (= (mod .cse30 v_prenex_115) 0))))) (forall ((v_prenex_114 Int) (v_prenex_113 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_114)) (.cse32 (* 8672 v_prenex_114))) (or (not (= (div .cse31 v_prenex_113) 8608)) (not (= 8672 (div .cse32 v_prenex_113))) (<= 0 v_prenex_113) (not (= (mod .cse31 v_prenex_113) 0)) (< .cse32 0)))) (forall ((v_prenex_156 Int) (v_prenex_155 Int)) (let ((.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_155)) (.cse33 (* 8672 v_prenex_155))) (or (= 0 (mod .cse33 v_prenex_156)) (not (= (div .cse34 v_prenex_156) 8608)) (not (= 8671 (div .cse33 v_prenex_156))) (not (= (mod .cse34 v_prenex_156) 0)) (<= 0 .cse33) (< v_prenex_156 0)))) (forall ((v_prenex_134 Int) (v_prenex_133 Int)) (let ((.cse35 (* 8672 v_prenex_134)) (.cse36 (* c_ssl3_accept_~ag_X~0 v_prenex_134))) (or (not (= 8672 (div .cse35 v_prenex_133))) (not (= (div .cse36 v_prenex_133) 8608)) (< v_prenex_133 0) (not (= 0 (mod .cse35 v_prenex_133))) (not (= (mod .cse36 v_prenex_133) 0))))) (forall ((v_prenex_149 Int) (v_prenex_150 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 v_prenex_150)) (.cse37 (* 8672 v_prenex_150))) (or (not (= 8672 (div .cse37 v_prenex_149))) (not (= (div .cse38 v_prenex_149) 8608)) (< .cse38 0) (<= 0 v_prenex_149) (not (= 0 (mod .cse37 v_prenex_149)))))) (forall ((v_prenex_141 Int) (v_prenex_142 Int)) (let ((.cse39 (* 8672 v_prenex_142)) (.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_142))) (or (<= 0 .cse39) (= (mod .cse40 v_prenex_141) 0) (not (= (div .cse40 v_prenex_141) 8607)) (< v_prenex_141 0) (= 0 (mod .cse39 v_prenex_141)) (not (= 8673 (div .cse39 v_prenex_141))) (<= 0 v_prenex_141) (not (< .cse40 0))))) (not (= c_ssl3_accept_~s__state~0 8672)) (forall ((v_prenex_117 Int) (v_prenex_118 Int)) (let ((.cse41 (* 8672 v_prenex_118)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_118))) (or (not (= 8671 (div .cse41 v_prenex_117))) (= 0 (mod .cse41 v_prenex_117)) (< .cse42 0) (<= 0 .cse41) (not (= (div .cse42 v_prenex_117) 8608)) (< v_prenex_117 0)))) (forall ((v_prenex_139 Int) (v_prenex_140 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_140)) (.cse44 (* 8672 v_prenex_140))) (or (<= 0 v_prenex_139) (not (= (div .cse43 v_prenex_139) 8609)) (not (= 0 (mod .cse44 v_prenex_139))) (not (< .cse43 0)) (= (mod .cse43 v_prenex_139) 0) (not (= 8672 (div .cse44 v_prenex_139)))))) (forall ((v_prenex_161 Int) (v_prenex_162 Int)) (let ((.cse45 (* 8672 v_prenex_161)) (.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_161))) (or (not (= 0 (mod .cse45 v_prenex_162))) (< v_prenex_162 0) (< .cse46 0) (not (= (mod .cse46 v_prenex_162) 0)) (not (= 8672 (div .cse45 v_prenex_162))) (not (= (div .cse46 v_prenex_162) 8608))))) (forall ((v_prenex_110 Int) (v_prenex_109 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 v_prenex_110)) (.cse48 (* 8672 v_prenex_110))) (or (<= 0 v_prenex_109) (not (= (mod .cse47 v_prenex_109) 0)) (not (= (div .cse47 v_prenex_109) 8608)) (not (= 0 (mod .cse48 v_prenex_109))) (< .cse47 0) (not (= 8672 (div .cse48 v_prenex_109)))))) (forall ((v_prenex_143 Int) (v_prenex_144 Int)) (let ((.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_144)) (.cse49 (* 8672 v_prenex_144))) (or (<= 0 .cse49) (<= 0 v_prenex_143) (not (= (div .cse50 v_prenex_143) 8609)) (= 0 (mod .cse49 v_prenex_143)) (= (mod .cse50 v_prenex_143) 0) (not (< .cse50 0)) (not (= 8673 (div .cse49 v_prenex_143)))))) (forall ((v_prenex_112 Int) (v_prenex_111 Int)) (let ((.cse51 (* c_ssl3_accept_~ag_X~0 v_prenex_112)) (.cse52 (* 8672 v_prenex_112))) (or (not (< .cse51 0)) (not (= (div .cse51 v_prenex_111) 8609)) (not (= 8672 (div .cse52 v_prenex_111))) (<= 0 v_prenex_111) (= (mod .cse51 v_prenex_111) 0) (< .cse52 0)))) (forall ((v_prenex_147 Int) (v_prenex_148 Int)) (let ((.cse54 (* 8672 v_prenex_148)) (.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_148))) (or (= (mod .cse53 v_prenex_147) 0) (not (= (div .cse53 v_prenex_147) 8607)) (not (= 8672 (div .cse54 v_prenex_147))) (< v_prenex_147 0) (< .cse54 0) (not (< .cse53 0))))) (forall ((v_prenex_154 Int) (v_prenex_153 Int)) (let ((.cse56 (* 8672 v_prenex_154)) (.cse55 (* c_ssl3_accept_~ag_X~0 v_prenex_154))) (or (< .cse55 0) (not (= 8673 (div .cse56 v_prenex_153))) (<= 0 .cse56) (not (= (mod .cse55 v_prenex_153) 0)) (= 0 (mod .cse56 v_prenex_153)) (not (= (div .cse55 v_prenex_153) 8608)) (<= 0 v_prenex_153)))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_158 Int) (v_prenex_157 Int)) (let ((.cse58 (* 8672 v_prenex_157)) (.cse57 (* c_ssl3_accept_~ag_X~0 v_prenex_157))) (or (not (= (div .cse57 v_prenex_158) 8607)) (not (= 0 (mod .cse58 v_prenex_158))) (not (< .cse57 0)) (< v_prenex_158 0) (not (= 8672 (div .cse58 v_prenex_158))) (= (mod .cse57 v_prenex_158) 0))))) is different from false [2019-09-09 05:54:38,747 WARN L188 SmtUtils]: Spent 6.74 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:54:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:44,854 INFO L93 Difference]: Finished difference Result 254210 states and 333854 transitions. [2019-09-09 05:54:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-09 05:54:44,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 511 [2019-09-09 05:54:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:45,140 INFO L225 Difference]: With dead ends: 254210 [2019-09-09 05:54:45,140 INFO L226 Difference]: Without dead ends: 248218 [2019-09-09 05:54:45,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1023 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=177, Invalid=439, Unknown=8, NotChecked=306, Total=930 [2019-09-09 05:54:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248218 states. [2019-09-09 05:54:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248218 to 125930. [2019-09-09 05:54:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125930 states. [2019-09-09 05:54:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125930 states to 125930 states and 165987 transitions. [2019-09-09 05:54:49,124 INFO L78 Accepts]: Start accepts. Automaton has 125930 states and 165987 transitions. Word has length 511 [2019-09-09 05:54:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:49,125 INFO L475 AbstractCegarLoop]: Abstraction has 125930 states and 165987 transitions. [2019-09-09 05:54:49,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:54:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 125930 states and 165987 transitions. [2019-09-09 05:54:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-09-09 05:54:49,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:49,154 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:49,155 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1596679375, now seen corresponding path program 1 times [2019-09-09 05:54:49,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:49,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:49,174 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:54:49,174 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:54:49,174 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:54:49,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:49,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:54:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:49,270 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 514 with the following transitions: [2019-09-09 05:54:49,270 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [13], [18], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [186], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [329], [335], [340], [375], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [560], [563], [568], [570], [582], [585], [590], [603], [608], [609], [610], [612] [2019-09-09 05:54:49,273 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:49,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:49,325 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:54:50,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:54:50,084 INFO L272 AbstractInterpreter]: Visited 114 different actions 2345 times. Merged at 95 different actions 1848 times. Widened at 22 different actions 249 times. Performed 5772 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5772 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 330 fixpoints after 33 different actions. Largest state had 94 variables. [2019-09-09 05:54:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:50,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:54:50,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:50,085 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:54:50,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:50,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:54:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:50,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:54:50,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:54:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 870 proven. 0 refuted. 0 times theorem prover too weak. 1718 trivial. 0 not checked. [2019-09-09 05:54:50,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:54:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2588 backedges. 870 proven. 0 refuted. 0 times theorem prover too weak. 1718 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:54:51,615 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:51,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:54:51,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:51,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:51,623 INFO L87 Difference]: Start difference. First operand 125930 states and 165987 transitions. Second operand 3 states. [2019-09-09 05:54:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:52,100 INFO L93 Difference]: Finished difference Result 168217 states and 221287 transitions. [2019-09-09 05:54:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:52,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 513 [2019-09-09 05:54:52,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:52,335 INFO L225 Difference]: With dead ends: 168217 [2019-09-09 05:54:52,335 INFO L226 Difference]: Without dead ends: 168217 [2019-09-09 05:54:52,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 1024 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168217 states. [2019-09-09 05:54:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168217 to 168189. [2019-09-09 05:54:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168189 states. [2019-09-09 05:54:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168189 states to 168189 states and 221254 transitions. [2019-09-09 05:54:56,386 INFO L78 Accepts]: Start accepts. Automaton has 168189 states and 221254 transitions. Word has length 513 [2019-09-09 05:54:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:56,387 INFO L475 AbstractCegarLoop]: Abstraction has 168189 states and 221254 transitions. [2019-09-09 05:54:56,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 168189 states and 221254 transitions. [2019-09-09 05:54:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-09-09 05:54:56,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:56,415 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:56,416 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:56,416 INFO L82 PathProgramCache]: Analyzing trace with hash -258027468, now seen corresponding path program 1 times [2019-09-09 05:54:56,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:56,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:56,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:56,434 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:54:56,435 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:54:56,435 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:54:56,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:56,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:54:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:56,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 515 with the following transitions: [2019-09-09 05:54:56,543 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [13], [18], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [186], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [329], [335], [340], [375], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [560], [570], [574], [577], [582], [585], [590], [603], [608], [609], [610], [612] [2019-09-09 05:54:56,548 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:56,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:56,600 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:54:57,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:54:57,107 INFO L272 AbstractInterpreter]: Visited 113 different actions 2036 times. Merged at 91 different actions 1586 times. Widened at 21 different actions 218 times. Performed 4898 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4898 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 259 fixpoints after 22 different actions. Largest state had 93 variables. [2019-09-09 05:54:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:57,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:54:57,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:57,108 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:54:57,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:57,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:54:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:57,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:54:57,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:54:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2589 backedges. 695 proven. 0 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2019-09-09 05:54:57,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:54:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2589 backedges. 695 proven. 0 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2019-09-09 05:54:57,601 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:57,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:54:57,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:57,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:57,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:57,603 INFO L87 Difference]: Start difference. First operand 168189 states and 221254 transitions. Second operand 3 states. [2019-09-09 05:54:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:58,378 INFO L93 Difference]: Finished difference Result 156781 states and 204533 transitions. [2019-09-09 05:54:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:58,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-09-09 05:54:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:58,550 INFO L225 Difference]: With dead ends: 156781 [2019-09-09 05:54:58,550 INFO L226 Difference]: Without dead ends: 156781 [2019-09-09 05:54:58,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 1026 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156781 states. [2019-09-09 05:54:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156781 to 156779. [2019-09-09 05:54:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156779 states. [2019-09-09 05:55:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156779 states to 156779 states and 204532 transitions. [2019-09-09 05:55:00,032 INFO L78 Accepts]: Start accepts. Automaton has 156779 states and 204532 transitions. Word has length 514 [2019-09-09 05:55:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:00,032 INFO L475 AbstractCegarLoop]: Abstraction has 156779 states and 204532 transitions. [2019-09-09 05:55:00,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 156779 states and 204532 transitions. [2019-09-09 05:55:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2019-09-09 05:55:00,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:00,060 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:00,061 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1587926496, now seen corresponding path program 1 times [2019-09-09 05:55:00,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:00,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:00,078 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:55:00,079 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:55:00,079 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:55:00,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:00,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:55:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:55:00,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 524 with the following transitions: [2019-09-09 05:55:00,167 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [186], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [329], [335], [340], [375], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [557], [560], [570], [574], [577], [585], [590], [603], [608], [609], [610], [612] [2019-09-09 05:55:00,168 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:00,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:00,221 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:55:03,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:55:03,826 INFO L272 AbstractInterpreter]: Visited 112 different actions 2117 times. Merged at 92 different actions 1683 times. Widened at 21 different actions 229 times. Performed 5354 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5354 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 264 fixpoints after 22 different actions. Largest state had 93 variables. [2019-09-09 05:55:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:03,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:55:03,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:03,827 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:55:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:03,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:55:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:03,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-09 05:55:03,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:55:10,494 WARN L188 SmtUtils]: Spent 6.46 s on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-09 05:55:10,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:10,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:14,320 WARN L188 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 49 DAG size of output: 15 [2019-09-09 05:55:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2654 backedges. 1408 proven. 290 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2019-09-09 05:55:14,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:55:15,163 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-09 05:55:15,354 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-09-09 05:55:17,481 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-09 05:55:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:55:17,819 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse0 ssl3_accept_~ag_Z~0))) (< .cse0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse2 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse1 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8671 (div .cse1 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse2 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse2 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse1) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse1 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse3 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse4 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse3 ssl3_accept_~ag_Z~0) 8610)) (= (mod .cse3 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse4 ssl3_accept_~ag_Z~0))) (<= 0 .cse4) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (= 0 (mod .cse4 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse5 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse6 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse5 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse5 ssl3_accept_~ag_Z~0) 8609)) (not (= 8672 (div .cse6 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse6 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse7 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse7 ssl3_accept_~ag_Z~0))) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse7) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse7 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse9 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse8 ssl3_accept_~ag_Z~0) 0) (not (= 8673 (div .cse9 ssl3_accept_~ag_Z~0))) (<= 0 .cse9) (<= 0 ssl3_accept_~ag_Z~0) (not (= (div .cse8 ssl3_accept_~ag_Z~0) 8608)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse9 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse10 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse10 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse10 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse11 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= 8673 (div .cse11 ssl3_accept_~ag_Z~0))) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse11) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse11 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse13 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse12 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse13 ssl3_accept_~ag_Z~0))) (not (= (div .cse12 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse13) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse13 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse14 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse15 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse14 ssl3_accept_~ag_Z~0) 0) (not (= 8671 (div .cse15 ssl3_accept_~ag_Z~0))) (<= 0 .cse15) (not (= (div .cse14 ssl3_accept_~ag_Z~0) 8608)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse15 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse16 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse17 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse16 ssl3_accept_~ag_Z~0) 8610)) (= (mod .cse16 ssl3_accept_~ag_Z~0) 0) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse17 ssl3_accept_~ag_Z~0))) (< .cse17 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse18 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (not (= 8672 (div .cse18 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse18 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse20 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse19 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse20 ssl3_accept_~ag_Z~0))) (not (= (div .cse19 ssl3_accept_~ag_Z~0) 8608)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse20 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse21 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse21 ssl3_accept_~ag_Z~0))) (not (= (mod .cse22 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse22 ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse21 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse23 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse24 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse23 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse24 ssl3_accept_~ag_Z~0))) (not (= (div .cse23 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse24) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse24 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse25 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse26 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse25 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse25 ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse26 ssl3_accept_~ag_Z~0))) (< .cse26 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse27 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse27 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse28 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse28 ssl3_accept_~ag_Z~0) 8609)) (not (= 8672 (div .cse27 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse30 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse29 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse29 ssl3_accept_~ag_Z~0))) (not (= (mod .cse30 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse30 ssl3_accept_~ag_Z~0) 8609)) (not (= 8672 (div .cse29 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse32 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse31 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse32 ssl3_accept_~ag_Z~0))) (not (= (div .cse31 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse32) (<= 0 ssl3_accept_~ag_Z~0) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse32 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse34 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse33 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse33 ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse34 ssl3_accept_~ag_Z~0))) (< .cse34 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse36 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse35 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse35 ssl3_accept_~ag_Z~0) 8609)) (not (= 8672 (div .cse36 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse36 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse38 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse37 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse37 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (mod .cse38 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse38 ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse37 ssl3_accept_~ag_Z~0)))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse39 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 0 (mod .cse39 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (not (= 8672 (div .cse39 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse41 (* 8672 ssl3_accept_~ag_Y~0))) (or (= (mod .cse40 ssl3_accept_~ag_Z~0) 0) (not (= (div .cse40 ssl3_accept_~ag_Z~0) 8608)) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse41 ssl3_accept_~ag_Z~0))) (< ssl3_accept_~ag_Z~0 0) (< .cse41 0)))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse42 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8671 (div .cse42 ssl3_accept_~ag_Z~0))) (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse42) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse42 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse44 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (mod .cse43 ssl3_accept_~ag_Z~0) 0)) (not (= 8673 (div .cse44 ssl3_accept_~ag_Z~0))) (not (= (div .cse43 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse44) (<= 0 ssl3_accept_~ag_Z~0) (= 0 (mod .cse44 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse45 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= 8671 (div .cse45 ssl3_accept_~ag_Z~0))) (not (= (mod .cse46 ssl3_accept_~ag_Z~0) 0)) (not (= (div .cse46 ssl3_accept_~ag_Z~0) 8609)) (<= 0 .cse45) (< ssl3_accept_~ag_Z~0 0) (= 0 (mod .cse45 ssl3_accept_~ag_Z~0))))) (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse47 (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0)) (.cse48 (* 8672 ssl3_accept_~ag_Y~0))) (or (not (= (div .cse47 ssl3_accept_~ag_Z~0) 8610)) (= (mod .cse47 ssl3_accept_~ag_Z~0) 0) (not (= 0 (mod .cse48 ssl3_accept_~ag_Z~0))) (<= 0 ssl3_accept_~ag_Z~0) (not (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (not (= 8672 (div .cse48 ssl3_accept_~ag_Z~0))))))) is different from false [2019-09-09 05:55:19,847 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse0 ssl3_accept_~ag_Z~0))) (< .cse0 0)))) (forall ((v_prenex_185 Int) (v_prenex_186 Int)) (let ((.cse2 (* 8672 v_prenex_186)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_186))) (or (= (mod .cse1 v_prenex_185) 0) (not (= 0 (mod .cse2 v_prenex_185))) (not (= (div .cse1 v_prenex_185) 8608)) (not (= 8672 (div .cse2 v_prenex_185))) (< v_prenex_185 0) (not (< .cse1 0))))) (forall ((v_prenex_192 Int) (v_prenex_191 Int)) (let ((.cse3 (* 8672 v_prenex_192)) (.cse4 (* c_ssl3_accept_~ag_X~0 v_prenex_192))) (or (< .cse3 0) (<= 0 v_prenex_191) (not (= (mod .cse4 v_prenex_191) 0)) (not (= 8672 (div .cse3 v_prenex_191))) (not (= (div .cse4 v_prenex_191) 8609)) (< .cse4 0)))) (forall ((v_prenex_205 Int) (v_prenex_206 Int)) (let ((.cse5 (* c_ssl3_accept_~ag_X~0 v_prenex_206)) (.cse6 (* 8672 v_prenex_206))) (or (< .cse5 0) (not (= (div .cse5 v_prenex_205) 8609)) (not (= 0 (mod .cse6 v_prenex_205))) (< v_prenex_205 0) (not (= 8672 (div .cse6 v_prenex_205)))))) (forall ((v_prenex_204 Int) (v_prenex_203 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_204)) (.cse7 (* 8672 v_prenex_204))) (or (not (= 0 (mod .cse7 v_prenex_203))) (<= 0 v_prenex_203) (not (= (mod .cse8 v_prenex_203) 0)) (< .cse8 0) (not (= (div .cse8 v_prenex_203) 8609)) (not (= 8672 (div .cse7 v_prenex_203)))))) (forall ((v_prenex_183 Int) (v_prenex_184 Int)) (let ((.cse9 (* 8672 v_prenex_184)) (.cse10 (* c_ssl3_accept_~ag_X~0 v_prenex_184))) (or (< .cse9 0) (not (= 8672 (div .cse9 v_prenex_183))) (< v_prenex_183 0) (not (= (div .cse10 v_prenex_183) 8609)) (< .cse10 0)))) (forall ((v_prenex_198 Int) (v_prenex_197 Int)) (let ((.cse12 (* c_ssl3_accept_~ag_X~0 v_prenex_198)) (.cse11 (* 8672 v_prenex_198))) (or (< v_prenex_197 0) (<= 0 .cse11) (<= 0 v_prenex_197) (not (= (div .cse12 v_prenex_197) 8609)) (= 0 (mod .cse11 v_prenex_197)) (not (= (mod .cse12 v_prenex_197) 0)) (not (= 8673 (div .cse11 v_prenex_197)))))) (forall ((v_prenex_172 Int) (v_prenex_171 Int)) (let ((.cse14 (* 8672 v_prenex_172)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_172))) (or (<= 0 v_prenex_171) (not (= (div .cse13 v_prenex_171) 8608)) (<= 0 .cse14) (not (= 8673 (div .cse14 v_prenex_171))) (= 0 (mod .cse14 v_prenex_171)) (not (< .cse13 0)) (< v_prenex_171 0) (= (mod .cse13 v_prenex_171) 0)))) (forall ((v_prenex_200 Int) (v_prenex_199 Int)) (let ((.cse15 (* 8672 v_prenex_200)) (.cse16 (* c_ssl3_accept_~ag_X~0 v_prenex_200))) (or (not (= 8672 (div .cse15 v_prenex_199))) (<= 0 v_prenex_199) (not (= (mod .cse16 v_prenex_199) 0)) (< .cse15 0) (not (= (div .cse16 v_prenex_199) 8609))))) (forall ((v_prenex_163 Int) (v_prenex_164 Int)) (let ((.cse17 (* 8672 v_prenex_164)) (.cse18 (* c_ssl3_accept_~ag_X~0 v_prenex_164))) (or (= 0 (mod .cse17 v_prenex_163)) (<= 0 .cse17) (not (= (mod .cse18 v_prenex_163) 0)) (< v_prenex_163 0) (not (= 8671 (div .cse17 v_prenex_163))) (< .cse18 0) (not (= (div .cse18 v_prenex_163) 8609))))) (forall ((v_prenex_194 Int) (v_prenex_193 Int)) (let ((.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_194)) (.cse20 (* 8672 v_prenex_194))) (or (< .cse19 0) (not (= (div .cse19 v_prenex_193) 8609)) (not (= 0 (mod .cse20 v_prenex_193))) (< v_prenex_193 0) (not (= (mod .cse19 v_prenex_193) 0)) (not (= 8672 (div .cse20 v_prenex_193)))))) (forall ((v_prenex_169 Int) (v_prenex_170 Int)) (let ((.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_170)) (.cse22 (* 8672 v_prenex_170))) (or (not (= (div .cse21 v_prenex_169) 8609)) (= 0 (mod .cse22 v_prenex_169)) (not (= 8673 (div .cse22 v_prenex_169))) (< .cse21 0) (<= 0 .cse22) (<= 0 v_prenex_169)))) (forall ((v_prenex_215 Int) (v_prenex_216 Int)) (let ((.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_215)) (.cse24 (* 8672 v_prenex_215))) (or (not (= (div .cse23 v_prenex_216) 8610)) (not (= 0 (mod .cse24 v_prenex_216))) (<= 0 v_prenex_216) (not (< .cse23 0)) (= (mod .cse23 v_prenex_216) 0) (not (= 8672 (div .cse24 v_prenex_216)))))) (forall ((v_prenex_174 Int) (v_prenex_173 Int)) (let ((.cse25 (* c_ssl3_accept_~ag_X~0 v_prenex_174)) (.cse26 (* 8672 v_prenex_174))) (or (not (= (div .cse25 v_prenex_173) 8609)) (< .cse25 0) (<= 0 v_prenex_173) (not (= 8672 (div .cse26 v_prenex_173))) (not (= 0 (mod .cse26 v_prenex_173)))))) (forall ((v_prenex_210 Int) (v_prenex_209 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_209)) (.cse27 (* 8672 v_prenex_209))) (or (not (= 8671 (div .cse27 v_prenex_210))) (< .cse28 0) (not (= (div .cse28 v_prenex_210) 8609)) (= 0 (mod .cse27 v_prenex_210)) (<= 0 .cse27) (< v_prenex_210 0)))) (forall ((v_prenex_196 Int) (v_prenex_195 Int)) (let ((.cse29 (* 8672 v_prenex_196)) (.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_196))) (or (not (= 8672 (div .cse29 v_prenex_195))) (not (= (mod .cse30 v_prenex_195) 0)) (< v_prenex_195 0) (not (= 0 (mod .cse29 v_prenex_195))) (not (= (div .cse30 v_prenex_195) 8609))))) (forall ((v_prenex_165 Int) (v_prenex_166 Int)) (let ((.cse32 (* c_ssl3_accept_~ag_X~0 v_prenex_166)) (.cse31 (* 8672 v_prenex_166))) (or (= 0 (mod .cse31 v_prenex_165)) (not (= 8673 (div .cse31 v_prenex_165))) (<= 0 v_prenex_165) (= (mod .cse32 v_prenex_165) 0) (not (< .cse32 0)) (not (= (div .cse32 v_prenex_165) 8610)) (<= 0 .cse31)))) (forall ((v_prenex_213 Int) (v_prenex_214 Int)) (let ((.cse34 (* c_ssl3_accept_~ag_X~0 v_prenex_213)) (.cse33 (* 8672 v_prenex_213))) (or (not (= 8671 (div .cse33 v_prenex_214))) (<= 0 .cse33) (not (= (mod .cse34 v_prenex_214) 0)) (not (= (div .cse34 v_prenex_214) 8609)) (< v_prenex_214 0) (= 0 (mod .cse33 v_prenex_214))))) (forall ((v_prenex_167 Int) (v_prenex_168 Int)) (let ((.cse35 (* 8672 v_prenex_168)) (.cse36 (* c_ssl3_accept_~ag_X~0 v_prenex_168))) (or (< .cse35 0) (< .cse36 0) (not (= 8672 (div .cse35 v_prenex_167))) (< v_prenex_167 0) (not (= (mod .cse36 v_prenex_167) 0)) (not (= (div .cse36 v_prenex_167) 8609))))) (forall ((v_prenex_208 Int) (v_prenex_207 Int)) (let ((.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_208)) (.cse38 (* 8672 v_prenex_208))) (or (not (= (div .cse37 v_prenex_207) 8608)) (not (< .cse37 0)) (not (= 8672 (div .cse38 v_prenex_207))) (< v_prenex_207 0) (= (mod .cse37 v_prenex_207) 0) (< .cse38 0)))) (forall ((v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse40 (* 8672 v_prenex_182)) (.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_182))) (or (not (< .cse39 0)) (not (= 8672 (div .cse40 v_prenex_181))) (<= 0 v_prenex_181) (< .cse40 0) (not (= (div .cse39 v_prenex_181) 8610)) (= (mod .cse39 v_prenex_181) 0)))) (forall ((v_prenex_176 Int) (v_prenex_175 Int)) (let ((.cse41 (* c_ssl3_accept_~ag_X~0 v_prenex_176)) (.cse42 (* 8672 v_prenex_176))) (or (not (= (div .cse41 v_prenex_175) 8609)) (< .cse41 0) (< v_prenex_175 0) (= 0 (mod .cse42 v_prenex_175)) (not (= 8673 (div .cse42 v_prenex_175))) (<= 0 v_prenex_175) (<= 0 .cse42)))) (forall ((v_prenex_211 Int) (v_prenex_212 Int)) (let ((.cse43 (* c_ssl3_accept_~ag_X~0 v_prenex_211)) (.cse44 (* 8672 v_prenex_211))) (or (<= 0 v_prenex_212) (not (= (mod .cse43 v_prenex_212) 0)) (not (= (div .cse43 v_prenex_212) 8609)) (<= 0 .cse44) (not (= 8673 (div .cse44 v_prenex_212))) (= 0 (mod .cse44 v_prenex_212))))) (forall ((v_prenex_189 Int) (v_prenex_190 Int)) (let ((.cse46 (* 8672 v_prenex_190)) (.cse45 (* c_ssl3_accept_~ag_X~0 v_prenex_190))) (or (<= 0 v_prenex_189) (< .cse45 0) (not (= 8673 (div .cse46 v_prenex_189))) (not (= (mod .cse45 v_prenex_189) 0)) (<= 0 .cse46) (= 0 (mod .cse46 v_prenex_189)) (not (= (div .cse45 v_prenex_189) 8609))))) (forall ((v_prenex_187 Int) (v_prenex_188 Int)) (let ((.cse47 (* 8672 v_prenex_188)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_188))) (or (not (= 8672 (div .cse47 v_prenex_187))) (not (= (mod .cse48 v_prenex_187) 0)) (not (= 0 (mod .cse47 v_prenex_187))) (<= 0 v_prenex_187) (not (= (div .cse48 v_prenex_187) 8609))))) (forall ((v_prenex_202 Int) (v_prenex_201 Int)) (let ((.cse50 (* 8672 v_prenex_202)) (.cse49 (* c_ssl3_accept_~ag_X~0 v_prenex_202))) (or (not (= (mod .cse49 v_prenex_201) 0)) (< .cse50 0) (not (= 8672 (div .cse50 v_prenex_201))) (< v_prenex_201 0) (not (= (div .cse49 v_prenex_201) 8609))))) (forall ((v_prenex_179 Int) (v_prenex_180 Int)) (let ((.cse51 (* c_ssl3_accept_~ag_X~0 v_prenex_180)) (.cse52 (* 8672 v_prenex_180))) (or (not (= (div .cse51 v_prenex_179) 8608)) (not (< .cse51 0)) (<= 0 .cse52) (not (= 8671 (div .cse52 v_prenex_179))) (= (mod .cse51 v_prenex_179) 0) (= 0 (mod .cse52 v_prenex_179)) (< v_prenex_179 0)))) (forall ((v_prenex_178 Int) (v_prenex_177 Int)) (let ((.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_178)) (.cse54 (* 8672 v_prenex_178))) (or (not (= (mod .cse53 v_prenex_177) 0)) (not (= (div .cse53 v_prenex_177) 8609)) (not (= 8673 (div .cse54 v_prenex_177))) (< .cse53 0) (<= 0 v_prenex_177) (= 0 (mod .cse54 v_prenex_177)) (<= 0 .cse54) (< v_prenex_177 0))))) is different from false [2019-09-09 05:55:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2654 backedges. 1356 proven. 186 refuted. 0 times theorem prover too weak. 956 trivial. 156 not checked. [2019-09-09 05:55:25,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:55:25,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-09 05:55:25,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:55:25,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-09 05:55:25,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-09 05:55:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2019-09-09 05:55:25,009 INFO L87 Difference]: Start difference. First operand 156779 states and 204532 transitions. Second operand 13 states. [2019-09-09 05:55:27,202 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-09 05:55:32,791 WARN L188 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 553 DAG size of output: 38 [2019-09-09 05:55:35,212 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-09 05:55:39,866 WARN L188 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-09 05:55:40,374 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-09 05:55:49,106 WARN L188 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-09 05:55:49,359 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-09 05:55:52,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse56 (* 8672 c_ssl3_accept_~ag_Y~0)) (.cse63 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse6 (div .cse63 c_ssl3_accept_~ag_Z~0)) (.cse9 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse5 (= (mod .cse63 c_ssl3_accept_~ag_Z~0) 0)) (.cse8 (<= 0 c_ssl3_accept_~ag_Z~0)) (.cse7 (< c_ssl3_accept_~ag_Z~0 0)) (.cse58 (= 0 (mod .cse56 c_ssl3_accept_~ag_Z~0))) (.cse57 (div .cse56 c_ssl3_accept_~ag_Z~0))) (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse0 ssl3_accept_~ag_Z~0))) (< .cse0 0)))) (forall ((v_prenex_185 Int) (v_prenex_186 Int)) (let ((.cse2 (* 8672 v_prenex_186)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_186))) (or (= (mod .cse1 v_prenex_185) 0) (not (= 0 (mod .cse2 v_prenex_185))) (not (= (div .cse1 v_prenex_185) 8608)) (not (= 8672 (div .cse2 v_prenex_185))) (< v_prenex_185 0) (not (< .cse1 0))))) (forall ((v_prenex_192 Int) (v_prenex_191 Int)) (let ((.cse3 (* 8672 v_prenex_192)) (.cse4 (* c_ssl3_accept_~ag_X~0 v_prenex_192))) (or (< .cse3 0) (<= 0 v_prenex_191) (not (= (mod .cse4 v_prenex_191) 0)) (not (= 8672 (div .cse3 v_prenex_191))) (not (= (div .cse4 v_prenex_191) 8609)) (< .cse4 0)))) (or .cse5 (and (or (not (= .cse6 8671)) .cse7) (or .cse8 (not (= .cse6 8673)))) (not .cse9)) (forall ((v_prenex_205 Int) (v_prenex_206 Int)) (let ((.cse10 (* c_ssl3_accept_~ag_X~0 v_prenex_206)) (.cse11 (* 8672 v_prenex_206))) (or (< .cse10 0) (not (= (div .cse10 v_prenex_205) 8609)) (not (= 0 (mod .cse11 v_prenex_205))) (< v_prenex_205 0) (not (= 8672 (div .cse11 v_prenex_205)))))) (forall ((v_prenex_204 Int) (v_prenex_203 Int)) (let ((.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_204)) (.cse12 (* 8672 v_prenex_204))) (or (not (= 0 (mod .cse12 v_prenex_203))) (<= 0 v_prenex_203) (not (= (mod .cse13 v_prenex_203) 0)) (< .cse13 0) (not (= (div .cse13 v_prenex_203) 8609)) (not (= 8672 (div .cse12 v_prenex_203)))))) (forall ((v_prenex_183 Int) (v_prenex_184 Int)) (let ((.cse14 (* 8672 v_prenex_184)) (.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_184))) (or (< .cse14 0) (not (= 8672 (div .cse14 v_prenex_183))) (< v_prenex_183 0) (not (= (div .cse15 v_prenex_183) 8609)) (< .cse15 0)))) (forall ((v_prenex_198 Int) (v_prenex_197 Int)) (let ((.cse17 (* c_ssl3_accept_~ag_X~0 v_prenex_198)) (.cse16 (* 8672 v_prenex_198))) (or (< v_prenex_197 0) (<= 0 .cse16) (<= 0 v_prenex_197) (not (= (div .cse17 v_prenex_197) 8609)) (= 0 (mod .cse16 v_prenex_197)) (not (= (mod .cse17 v_prenex_197) 0)) (not (= 8673 (div .cse16 v_prenex_197)))))) (forall ((v_prenex_172 Int) (v_prenex_171 Int)) (let ((.cse19 (* 8672 v_prenex_172)) (.cse18 (* c_ssl3_accept_~ag_X~0 v_prenex_172))) (or (<= 0 v_prenex_171) (not (= (div .cse18 v_prenex_171) 8608)) (<= 0 .cse19) (not (= 8673 (div .cse19 v_prenex_171))) (= 0 (mod .cse19 v_prenex_171)) (not (< .cse18 0)) (< v_prenex_171 0) (= (mod .cse18 v_prenex_171) 0)))) (forall ((v_prenex_200 Int) (v_prenex_199 Int)) (let ((.cse20 (* 8672 v_prenex_200)) (.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_200))) (or (not (= 8672 (div .cse20 v_prenex_199))) (<= 0 v_prenex_199) (not (= (mod .cse21 v_prenex_199) 0)) (< .cse20 0) (not (= (div .cse21 v_prenex_199) 8609))))) (forall ((v_prenex_163 Int) (v_prenex_164 Int)) (let ((.cse22 (* 8672 v_prenex_164)) (.cse23 (* c_ssl3_accept_~ag_X~0 v_prenex_164))) (or (= 0 (mod .cse22 v_prenex_163)) (<= 0 .cse22) (not (= (mod .cse23 v_prenex_163) 0)) (< v_prenex_163 0) (not (= 8671 (div .cse22 v_prenex_163))) (< .cse23 0) (not (= (div .cse23 v_prenex_163) 8609))))) (forall ((v_prenex_194 Int) (v_prenex_193 Int)) (let ((.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_194)) (.cse25 (* 8672 v_prenex_194))) (or (< .cse24 0) (not (= (div .cse24 v_prenex_193) 8609)) (not (= 0 (mod .cse25 v_prenex_193))) (< v_prenex_193 0) (not (= (mod .cse24 v_prenex_193) 0)) (not (= 8672 (div .cse25 v_prenex_193)))))) (forall ((v_prenex_169 Int) (v_prenex_170 Int)) (let ((.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_170)) (.cse27 (* 8672 v_prenex_170))) (or (not (= (div .cse26 v_prenex_169) 8609)) (= 0 (mod .cse27 v_prenex_169)) (not (= 8673 (div .cse27 v_prenex_169))) (< .cse26 0) (<= 0 .cse27) (<= 0 v_prenex_169)))) (forall ((v_prenex_215 Int) (v_prenex_216 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_215)) (.cse29 (* 8672 v_prenex_215))) (or (not (= (div .cse28 v_prenex_216) 8610)) (not (= 0 (mod .cse29 v_prenex_216))) (<= 0 v_prenex_216) (not (< .cse28 0)) (= (mod .cse28 v_prenex_216) 0) (not (= 8672 (div .cse29 v_prenex_216)))))) (forall ((v_prenex_174 Int) (v_prenex_173 Int)) (let ((.cse30 (* c_ssl3_accept_~ag_X~0 v_prenex_174)) (.cse31 (* 8672 v_prenex_174))) (or (not (= (div .cse30 v_prenex_173) 8609)) (< .cse30 0) (<= 0 v_prenex_173) (not (= 8672 (div .cse31 v_prenex_173))) (not (= 0 (mod .cse31 v_prenex_173)))))) (forall ((v_prenex_210 Int) (v_prenex_209 Int)) (let ((.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_209)) (.cse32 (* 8672 v_prenex_209))) (or (not (= 8671 (div .cse32 v_prenex_210))) (< .cse33 0) (not (= (div .cse33 v_prenex_210) 8609)) (= 0 (mod .cse32 v_prenex_210)) (<= 0 .cse32) (< v_prenex_210 0)))) (not (= c_ssl3_accept_~s__state~0 8672)) (forall ((v_prenex_196 Int) (v_prenex_195 Int)) (let ((.cse34 (* 8672 v_prenex_196)) (.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_196))) (or (not (= 8672 (div .cse34 v_prenex_195))) (not (= (mod .cse35 v_prenex_195) 0)) (< v_prenex_195 0) (not (= 0 (mod .cse34 v_prenex_195))) (not (= (div .cse35 v_prenex_195) 8609))))) (forall ((v_prenex_165 Int) (v_prenex_166 Int)) (let ((.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_166)) (.cse36 (* 8672 v_prenex_166))) (or (= 0 (mod .cse36 v_prenex_165)) (not (= 8673 (div .cse36 v_prenex_165))) (<= 0 v_prenex_165) (= (mod .cse37 v_prenex_165) 0) (not (< .cse37 0)) (not (= (div .cse37 v_prenex_165) 8610)) (<= 0 .cse36)))) (forall ((v_prenex_213 Int) (v_prenex_214 Int)) (let ((.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_213)) (.cse38 (* 8672 v_prenex_213))) (or (not (= 8671 (div .cse38 v_prenex_214))) (<= 0 .cse38) (not (= (mod .cse39 v_prenex_214) 0)) (not (= (div .cse39 v_prenex_214) 8609)) (< v_prenex_214 0) (= 0 (mod .cse38 v_prenex_214))))) (forall ((v_prenex_167 Int) (v_prenex_168 Int)) (let ((.cse40 (* 8672 v_prenex_168)) (.cse41 (* c_ssl3_accept_~ag_X~0 v_prenex_168))) (or (< .cse40 0) (< .cse41 0) (not (= 8672 (div .cse40 v_prenex_167))) (< v_prenex_167 0) (not (= (mod .cse41 v_prenex_167) 0)) (not (= (div .cse41 v_prenex_167) 8609))))) (forall ((v_prenex_208 Int) (v_prenex_207 Int)) (let ((.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_208)) (.cse43 (* 8672 v_prenex_208))) (or (not (= (div .cse42 v_prenex_207) 8608)) (not (< .cse42 0)) (not (= 8672 (div .cse43 v_prenex_207))) (< v_prenex_207 0) (= (mod .cse42 v_prenex_207) 0) (< .cse43 0)))) (forall ((v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse45 (* 8672 v_prenex_182)) (.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_182))) (or (not (< .cse44 0)) (not (= 8672 (div .cse45 v_prenex_181))) (<= 0 v_prenex_181) (< .cse45 0) (not (= (div .cse44 v_prenex_181) 8610)) (= (mod .cse44 v_prenex_181) 0)))) (or (not (= .cse6 8672)) (and .cse9 (not .cse5))) (forall ((v_prenex_176 Int) (v_prenex_175 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_176)) (.cse47 (* 8672 v_prenex_176))) (or (not (= (div .cse46 v_prenex_175) 8609)) (< .cse46 0) (< v_prenex_175 0) (= 0 (mod .cse47 v_prenex_175)) (not (= 8673 (div .cse47 v_prenex_175))) (<= 0 v_prenex_175) (<= 0 .cse47)))) (forall ((v_prenex_211 Int) (v_prenex_212 Int)) (let ((.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_211)) (.cse49 (* 8672 v_prenex_211))) (or (<= 0 v_prenex_212) (not (= (mod .cse48 v_prenex_212) 0)) (not (= (div .cse48 v_prenex_212) 8609)) (<= 0 .cse49) (not (= 8673 (div .cse49 v_prenex_212))) (= 0 (mod .cse49 v_prenex_212))))) (forall ((v_prenex_189 Int) (v_prenex_190 Int)) (let ((.cse51 (* 8672 v_prenex_190)) (.cse50 (* c_ssl3_accept_~ag_X~0 v_prenex_190))) (or (<= 0 v_prenex_189) (< .cse50 0) (not (= 8673 (div .cse51 v_prenex_189))) (not (= (mod .cse50 v_prenex_189) 0)) (<= 0 .cse51) (= 0 (mod .cse51 v_prenex_189)) (not (= (div .cse50 v_prenex_189) 8609))))) (forall ((v_prenex_187 Int) (v_prenex_188 Int)) (let ((.cse52 (* 8672 v_prenex_188)) (.cse53 (* c_ssl3_accept_~ag_X~0 v_prenex_188))) (or (not (= 8672 (div .cse52 v_prenex_187))) (not (= (mod .cse53 v_prenex_187) 0)) (not (= 0 (mod .cse52 v_prenex_187))) (<= 0 v_prenex_187) (not (= (div .cse53 v_prenex_187) 8609))))) (forall ((v_prenex_202 Int) (v_prenex_201 Int)) (let ((.cse55 (* 8672 v_prenex_202)) (.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_202))) (or (not (= (mod .cse54 v_prenex_201) 0)) (< .cse55 0) (not (= 8672 (div .cse55 v_prenex_201))) (< v_prenex_201 0) (not (= (div .cse54 v_prenex_201) 8609))))) (= c_ssl3_accept_~ag_X~0 8672) (or (<= 0 .cse56) (and (or (not (= 8673 .cse57)) .cse8) (or (not (= 8671 .cse57)) .cse7)) .cse58) (forall ((v_prenex_179 Int) (v_prenex_180 Int)) (let ((.cse59 (* c_ssl3_accept_~ag_X~0 v_prenex_180)) (.cse60 (* 8672 v_prenex_180))) (or (not (= (div .cse59 v_prenex_179) 8608)) (not (< .cse59 0)) (<= 0 .cse60) (not (= 8671 (div .cse60 v_prenex_179))) (= (mod .cse59 v_prenex_179) 0) (= 0 (mod .cse60 v_prenex_179)) (< v_prenex_179 0)))) (or (and (not .cse58) (< .cse56 0)) (not (= 8672 .cse57))) (forall ((v_prenex_178 Int) (v_prenex_177 Int)) (let ((.cse61 (* c_ssl3_accept_~ag_X~0 v_prenex_178)) (.cse62 (* 8672 v_prenex_178))) (or (not (= (mod .cse61 v_prenex_177) 0)) (not (= (div .cse61 v_prenex_177) 8609)) (not (= 8673 (div .cse62 v_prenex_177))) (< .cse61 0) (<= 0 v_prenex_177) (= 0 (mod .cse62 v_prenex_177)) (<= 0 .cse62) (< v_prenex_177 0))))))) is different from false [2019-09-09 05:55:53,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse58 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse6 (div .cse58 c_ssl3_accept_~ag_Z~0)) (.cse7 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse5 (= (mod .cse58 c_ssl3_accept_~ag_Z~0) 0))) (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse0 ssl3_accept_~ag_Z~0))) (< .cse0 0)))) (forall ((v_prenex_185 Int) (v_prenex_186 Int)) (let ((.cse2 (* 8672 v_prenex_186)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_186))) (or (= (mod .cse1 v_prenex_185) 0) (not (= 0 (mod .cse2 v_prenex_185))) (not (= (div .cse1 v_prenex_185) 8608)) (not (= 8672 (div .cse2 v_prenex_185))) (< v_prenex_185 0) (not (< .cse1 0))))) (forall ((v_prenex_192 Int) (v_prenex_191 Int)) (let ((.cse3 (* 8672 v_prenex_192)) (.cse4 (* c_ssl3_accept_~ag_X~0 v_prenex_192))) (or (< .cse3 0) (<= 0 v_prenex_191) (not (= (mod .cse4 v_prenex_191) 0)) (not (= 8672 (div .cse3 v_prenex_191))) (not (= (div .cse4 v_prenex_191) 8609)) (< .cse4 0)))) (or .cse5 (and (or (not (= .cse6 8671)) (< c_ssl3_accept_~ag_Z~0 0)) (or (<= 0 c_ssl3_accept_~ag_Z~0) (not (= .cse6 8673)))) (not .cse7)) (forall ((v_prenex_205 Int) (v_prenex_206 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_206)) (.cse9 (* 8672 v_prenex_206))) (or (< .cse8 0) (not (= (div .cse8 v_prenex_205) 8609)) (not (= 0 (mod .cse9 v_prenex_205))) (< v_prenex_205 0) (not (= 8672 (div .cse9 v_prenex_205)))))) (forall ((v_prenex_204 Int) (v_prenex_203 Int)) (let ((.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_204)) (.cse10 (* 8672 v_prenex_204))) (or (not (= 0 (mod .cse10 v_prenex_203))) (<= 0 v_prenex_203) (not (= (mod .cse11 v_prenex_203) 0)) (< .cse11 0) (not (= (div .cse11 v_prenex_203) 8609)) (not (= 8672 (div .cse10 v_prenex_203)))))) (forall ((v_prenex_183 Int) (v_prenex_184 Int)) (let ((.cse12 (* 8672 v_prenex_184)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_184))) (or (< .cse12 0) (not (= 8672 (div .cse12 v_prenex_183))) (< v_prenex_183 0) (not (= (div .cse13 v_prenex_183) 8609)) (< .cse13 0)))) (forall ((v_prenex_198 Int) (v_prenex_197 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_198)) (.cse14 (* 8672 v_prenex_198))) (or (< v_prenex_197 0) (<= 0 .cse14) (<= 0 v_prenex_197) (not (= (div .cse15 v_prenex_197) 8609)) (= 0 (mod .cse14 v_prenex_197)) (not (= (mod .cse15 v_prenex_197) 0)) (not (= 8673 (div .cse14 v_prenex_197)))))) (forall ((v_prenex_172 Int) (v_prenex_171 Int)) (let ((.cse17 (* 8672 v_prenex_172)) (.cse16 (* c_ssl3_accept_~ag_X~0 v_prenex_172))) (or (<= 0 v_prenex_171) (not (= (div .cse16 v_prenex_171) 8608)) (<= 0 .cse17) (not (= 8673 (div .cse17 v_prenex_171))) (= 0 (mod .cse17 v_prenex_171)) (not (< .cse16 0)) (< v_prenex_171 0) (= (mod .cse16 v_prenex_171) 0)))) (forall ((v_prenex_200 Int) (v_prenex_199 Int)) (let ((.cse18 (* 8672 v_prenex_200)) (.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_200))) (or (not (= 8672 (div .cse18 v_prenex_199))) (<= 0 v_prenex_199) (not (= (mod .cse19 v_prenex_199) 0)) (< .cse18 0) (not (= (div .cse19 v_prenex_199) 8609))))) (forall ((v_prenex_163 Int) (v_prenex_164 Int)) (let ((.cse20 (* 8672 v_prenex_164)) (.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_164))) (or (= 0 (mod .cse20 v_prenex_163)) (<= 0 .cse20) (not (= (mod .cse21 v_prenex_163) 0)) (< v_prenex_163 0) (not (= 8671 (div .cse20 v_prenex_163))) (< .cse21 0) (not (= (div .cse21 v_prenex_163) 8609))))) (forall ((v_prenex_194 Int) (v_prenex_193 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_194)) (.cse23 (* 8672 v_prenex_194))) (or (< .cse22 0) (not (= (div .cse22 v_prenex_193) 8609)) (not (= 0 (mod .cse23 v_prenex_193))) (< v_prenex_193 0) (not (= (mod .cse22 v_prenex_193) 0)) (not (= 8672 (div .cse23 v_prenex_193)))))) (forall ((v_prenex_169 Int) (v_prenex_170 Int)) (let ((.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_170)) (.cse25 (* 8672 v_prenex_170))) (or (not (= (div .cse24 v_prenex_169) 8609)) (= 0 (mod .cse25 v_prenex_169)) (not (= 8673 (div .cse25 v_prenex_169))) (< .cse24 0) (<= 0 .cse25) (<= 0 v_prenex_169)))) (forall ((v_prenex_215 Int) (v_prenex_216 Int)) (let ((.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_215)) (.cse27 (* 8672 v_prenex_215))) (or (not (= (div .cse26 v_prenex_216) 8610)) (not (= 0 (mod .cse27 v_prenex_216))) (<= 0 v_prenex_216) (not (< .cse26 0)) (= (mod .cse26 v_prenex_216) 0) (not (= 8672 (div .cse27 v_prenex_216)))))) (forall ((v_prenex_174 Int) (v_prenex_173 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_174)) (.cse29 (* 8672 v_prenex_174))) (or (not (= (div .cse28 v_prenex_173) 8609)) (< .cse28 0) (<= 0 v_prenex_173) (not (= 8672 (div .cse29 v_prenex_173))) (not (= 0 (mod .cse29 v_prenex_173)))))) (forall ((v_prenex_210 Int) (v_prenex_209 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_209)) (.cse30 (* 8672 v_prenex_209))) (or (not (= 8671 (div .cse30 v_prenex_210))) (< .cse31 0) (not (= (div .cse31 v_prenex_210) 8609)) (= 0 (mod .cse30 v_prenex_210)) (<= 0 .cse30) (< v_prenex_210 0)))) (not (= c_ssl3_accept_~s__state~0 8672)) (forall ((v_prenex_196 Int) (v_prenex_195 Int)) (let ((.cse32 (* 8672 v_prenex_196)) (.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_196))) (or (not (= 8672 (div .cse32 v_prenex_195))) (not (= (mod .cse33 v_prenex_195) 0)) (< v_prenex_195 0) (not (= 0 (mod .cse32 v_prenex_195))) (not (= (div .cse33 v_prenex_195) 8609))))) (forall ((v_prenex_165 Int) (v_prenex_166 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_166)) (.cse34 (* 8672 v_prenex_166))) (or (= 0 (mod .cse34 v_prenex_165)) (not (= 8673 (div .cse34 v_prenex_165))) (<= 0 v_prenex_165) (= (mod .cse35 v_prenex_165) 0) (not (< .cse35 0)) (not (= (div .cse35 v_prenex_165) 8610)) (<= 0 .cse34)))) (forall ((v_prenex_213 Int) (v_prenex_214 Int)) (let ((.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_213)) (.cse36 (* 8672 v_prenex_213))) (or (not (= 8671 (div .cse36 v_prenex_214))) (<= 0 .cse36) (not (= (mod .cse37 v_prenex_214) 0)) (not (= (div .cse37 v_prenex_214) 8609)) (< v_prenex_214 0) (= 0 (mod .cse36 v_prenex_214))))) (forall ((v_prenex_167 Int) (v_prenex_168 Int)) (let ((.cse38 (* 8672 v_prenex_168)) (.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_168))) (or (< .cse38 0) (< .cse39 0) (not (= 8672 (div .cse38 v_prenex_167))) (< v_prenex_167 0) (not (= (mod .cse39 v_prenex_167) 0)) (not (= (div .cse39 v_prenex_167) 8609))))) (forall ((v_prenex_208 Int) (v_prenex_207 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_208)) (.cse41 (* 8672 v_prenex_208))) (or (not (= (div .cse40 v_prenex_207) 8608)) (not (< .cse40 0)) (not (= 8672 (div .cse41 v_prenex_207))) (< v_prenex_207 0) (= (mod .cse40 v_prenex_207) 0) (< .cse41 0)))) (forall ((v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse43 (* 8672 v_prenex_182)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_182))) (or (not (< .cse42 0)) (not (= 8672 (div .cse43 v_prenex_181))) (<= 0 v_prenex_181) (< .cse43 0) (not (= (div .cse42 v_prenex_181) 8610)) (= (mod .cse42 v_prenex_181) 0)))) (or (not (= .cse6 8672)) (and .cse7 (not .cse5))) (forall ((v_prenex_176 Int) (v_prenex_175 Int)) (let ((.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_176)) (.cse45 (* 8672 v_prenex_176))) (or (not (= (div .cse44 v_prenex_175) 8609)) (< .cse44 0) (< v_prenex_175 0) (= 0 (mod .cse45 v_prenex_175)) (not (= 8673 (div .cse45 v_prenex_175))) (<= 0 v_prenex_175) (<= 0 .cse45)))) (forall ((v_prenex_211 Int) (v_prenex_212 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_211)) (.cse47 (* 8672 v_prenex_211))) (or (<= 0 v_prenex_212) (not (= (mod .cse46 v_prenex_212) 0)) (not (= (div .cse46 v_prenex_212) 8609)) (<= 0 .cse47) (not (= 8673 (div .cse47 v_prenex_212))) (= 0 (mod .cse47 v_prenex_212))))) (forall ((v_prenex_189 Int) (v_prenex_190 Int)) (let ((.cse49 (* 8672 v_prenex_190)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_190))) (or (<= 0 v_prenex_189) (< .cse48 0) (not (= 8673 (div .cse49 v_prenex_189))) (not (= (mod .cse48 v_prenex_189) 0)) (<= 0 .cse49) (= 0 (mod .cse49 v_prenex_189)) (not (= (div .cse48 v_prenex_189) 8609))))) (forall ((v_prenex_187 Int) (v_prenex_188 Int)) (let ((.cse50 (* 8672 v_prenex_188)) (.cse51 (* c_ssl3_accept_~ag_X~0 v_prenex_188))) (or (not (= 8672 (div .cse50 v_prenex_187))) (not (= (mod .cse51 v_prenex_187) 0)) (not (= 0 (mod .cse50 v_prenex_187))) (<= 0 v_prenex_187) (not (= (div .cse51 v_prenex_187) 8609))))) (forall ((v_prenex_202 Int) (v_prenex_201 Int)) (let ((.cse53 (* 8672 v_prenex_202)) (.cse52 (* c_ssl3_accept_~ag_X~0 v_prenex_202))) (or (not (= (mod .cse52 v_prenex_201) 0)) (< .cse53 0) (not (= 8672 (div .cse53 v_prenex_201))) (< v_prenex_201 0) (not (= (div .cse52 v_prenex_201) 8609))))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_179 Int) (v_prenex_180 Int)) (let ((.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_180)) (.cse55 (* 8672 v_prenex_180))) (or (not (= (div .cse54 v_prenex_179) 8608)) (not (< .cse54 0)) (<= 0 .cse55) (not (= 8671 (div .cse55 v_prenex_179))) (= (mod .cse54 v_prenex_179) 0) (= 0 (mod .cse55 v_prenex_179)) (< v_prenex_179 0)))) (forall ((v_prenex_178 Int) (v_prenex_177 Int)) (let ((.cse56 (* c_ssl3_accept_~ag_X~0 v_prenex_178)) (.cse57 (* 8672 v_prenex_178))) (or (not (= (mod .cse56 v_prenex_177) 0)) (not (= (div .cse56 v_prenex_177) 8609)) (not (= 8673 (div .cse57 v_prenex_177))) (< .cse56 0) (<= 0 v_prenex_177) (= 0 (mod .cse57 v_prenex_177)) (<= 0 .cse57) (< v_prenex_177 0))))))) is different from false [2019-09-09 05:55:53,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse58 (* c_ssl3_accept_~ag_X~0 c_ssl3_accept_~ag_Y~0))) (let ((.cse6 (div .cse58 c_ssl3_accept_~ag_Z~0)) (.cse7 (< (* c_ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0)) (.cse5 (= (mod .cse58 c_ssl3_accept_~ag_Z~0) 0))) (and (forall ((ssl3_accept_~ag_Z~0 Int) (ssl3_accept_~ag_Y~0 Int)) (let ((.cse0 (* 8672 ssl3_accept_~ag_Y~0))) (or (< (* ssl3_accept_~ag_Y~0 c_ssl3_accept_~ag_X~0) 0) (not (= (div (* c_ssl3_accept_~ag_X~0 ssl3_accept_~ag_Y~0) ssl3_accept_~ag_Z~0) 8609)) (<= 0 ssl3_accept_~ag_Z~0) (not (= 8672 (div .cse0 ssl3_accept_~ag_Z~0))) (< .cse0 0)))) (forall ((v_prenex_185 Int) (v_prenex_186 Int)) (let ((.cse2 (* 8672 v_prenex_186)) (.cse1 (* c_ssl3_accept_~ag_X~0 v_prenex_186))) (or (= (mod .cse1 v_prenex_185) 0) (not (= 0 (mod .cse2 v_prenex_185))) (not (= (div .cse1 v_prenex_185) 8608)) (not (= 8672 (div .cse2 v_prenex_185))) (< v_prenex_185 0) (not (< .cse1 0))))) (forall ((v_prenex_192 Int) (v_prenex_191 Int)) (let ((.cse3 (* 8672 v_prenex_192)) (.cse4 (* c_ssl3_accept_~ag_X~0 v_prenex_192))) (or (< .cse3 0) (<= 0 v_prenex_191) (not (= (mod .cse4 v_prenex_191) 0)) (not (= 8672 (div .cse3 v_prenex_191))) (not (= (div .cse4 v_prenex_191) 8609)) (< .cse4 0)))) (or .cse5 (and (or (not (= .cse6 8671)) (< c_ssl3_accept_~ag_Z~0 0)) (or (<= 0 c_ssl3_accept_~ag_Z~0) (not (= .cse6 8673)))) (not .cse7)) (forall ((v_prenex_205 Int) (v_prenex_206 Int)) (let ((.cse8 (* c_ssl3_accept_~ag_X~0 v_prenex_206)) (.cse9 (* 8672 v_prenex_206))) (or (< .cse8 0) (not (= (div .cse8 v_prenex_205) 8609)) (not (= 0 (mod .cse9 v_prenex_205))) (< v_prenex_205 0) (not (= 8672 (div .cse9 v_prenex_205)))))) (forall ((v_prenex_204 Int) (v_prenex_203 Int)) (let ((.cse11 (* c_ssl3_accept_~ag_X~0 v_prenex_204)) (.cse10 (* 8672 v_prenex_204))) (or (not (= 0 (mod .cse10 v_prenex_203))) (<= 0 v_prenex_203) (not (= (mod .cse11 v_prenex_203) 0)) (< .cse11 0) (not (= (div .cse11 v_prenex_203) 8609)) (not (= 8672 (div .cse10 v_prenex_203)))))) (forall ((v_prenex_183 Int) (v_prenex_184 Int)) (let ((.cse12 (* 8672 v_prenex_184)) (.cse13 (* c_ssl3_accept_~ag_X~0 v_prenex_184))) (or (< .cse12 0) (not (= 8672 (div .cse12 v_prenex_183))) (< v_prenex_183 0) (not (= (div .cse13 v_prenex_183) 8609)) (< .cse13 0)))) (forall ((v_prenex_198 Int) (v_prenex_197 Int)) (let ((.cse15 (* c_ssl3_accept_~ag_X~0 v_prenex_198)) (.cse14 (* 8672 v_prenex_198))) (or (< v_prenex_197 0) (<= 0 .cse14) (<= 0 v_prenex_197) (not (= (div .cse15 v_prenex_197) 8609)) (= 0 (mod .cse14 v_prenex_197)) (not (= (mod .cse15 v_prenex_197) 0)) (not (= 8673 (div .cse14 v_prenex_197)))))) (forall ((v_prenex_172 Int) (v_prenex_171 Int)) (let ((.cse17 (* 8672 v_prenex_172)) (.cse16 (* c_ssl3_accept_~ag_X~0 v_prenex_172))) (or (<= 0 v_prenex_171) (not (= (div .cse16 v_prenex_171) 8608)) (<= 0 .cse17) (not (= 8673 (div .cse17 v_prenex_171))) (= 0 (mod .cse17 v_prenex_171)) (not (< .cse16 0)) (< v_prenex_171 0) (= (mod .cse16 v_prenex_171) 0)))) (forall ((v_prenex_200 Int) (v_prenex_199 Int)) (let ((.cse18 (* 8672 v_prenex_200)) (.cse19 (* c_ssl3_accept_~ag_X~0 v_prenex_200))) (or (not (= 8672 (div .cse18 v_prenex_199))) (<= 0 v_prenex_199) (not (= (mod .cse19 v_prenex_199) 0)) (< .cse18 0) (not (= (div .cse19 v_prenex_199) 8609))))) (forall ((v_prenex_163 Int) (v_prenex_164 Int)) (let ((.cse20 (* 8672 v_prenex_164)) (.cse21 (* c_ssl3_accept_~ag_X~0 v_prenex_164))) (or (= 0 (mod .cse20 v_prenex_163)) (<= 0 .cse20) (not (= (mod .cse21 v_prenex_163) 0)) (< v_prenex_163 0) (not (= 8671 (div .cse20 v_prenex_163))) (< .cse21 0) (not (= (div .cse21 v_prenex_163) 8609))))) (forall ((v_prenex_194 Int) (v_prenex_193 Int)) (let ((.cse22 (* c_ssl3_accept_~ag_X~0 v_prenex_194)) (.cse23 (* 8672 v_prenex_194))) (or (< .cse22 0) (not (= (div .cse22 v_prenex_193) 8609)) (not (= 0 (mod .cse23 v_prenex_193))) (< v_prenex_193 0) (not (= (mod .cse22 v_prenex_193) 0)) (not (= 8672 (div .cse23 v_prenex_193)))))) (forall ((v_prenex_169 Int) (v_prenex_170 Int)) (let ((.cse24 (* c_ssl3_accept_~ag_X~0 v_prenex_170)) (.cse25 (* 8672 v_prenex_170))) (or (not (= (div .cse24 v_prenex_169) 8609)) (= 0 (mod .cse25 v_prenex_169)) (not (= 8673 (div .cse25 v_prenex_169))) (< .cse24 0) (<= 0 .cse25) (<= 0 v_prenex_169)))) (forall ((v_prenex_215 Int) (v_prenex_216 Int)) (let ((.cse26 (* c_ssl3_accept_~ag_X~0 v_prenex_215)) (.cse27 (* 8672 v_prenex_215))) (or (not (= (div .cse26 v_prenex_216) 8610)) (not (= 0 (mod .cse27 v_prenex_216))) (<= 0 v_prenex_216) (not (< .cse26 0)) (= (mod .cse26 v_prenex_216) 0) (not (= 8672 (div .cse27 v_prenex_216)))))) (forall ((v_prenex_174 Int) (v_prenex_173 Int)) (let ((.cse28 (* c_ssl3_accept_~ag_X~0 v_prenex_174)) (.cse29 (* 8672 v_prenex_174))) (or (not (= (div .cse28 v_prenex_173) 8609)) (< .cse28 0) (<= 0 v_prenex_173) (not (= 8672 (div .cse29 v_prenex_173))) (not (= 0 (mod .cse29 v_prenex_173)))))) (forall ((v_prenex_210 Int) (v_prenex_209 Int)) (let ((.cse31 (* c_ssl3_accept_~ag_X~0 v_prenex_209)) (.cse30 (* 8672 v_prenex_209))) (or (not (= 8671 (div .cse30 v_prenex_210))) (< .cse31 0) (not (= (div .cse31 v_prenex_210) 8609)) (= 0 (mod .cse30 v_prenex_210)) (<= 0 .cse30) (< v_prenex_210 0)))) (forall ((v_prenex_196 Int) (v_prenex_195 Int)) (let ((.cse32 (* 8672 v_prenex_196)) (.cse33 (* c_ssl3_accept_~ag_X~0 v_prenex_196))) (or (not (= 8672 (div .cse32 v_prenex_195))) (not (= (mod .cse33 v_prenex_195) 0)) (< v_prenex_195 0) (not (= 0 (mod .cse32 v_prenex_195))) (not (= (div .cse33 v_prenex_195) 8609))))) (forall ((v_prenex_165 Int) (v_prenex_166 Int)) (let ((.cse35 (* c_ssl3_accept_~ag_X~0 v_prenex_166)) (.cse34 (* 8672 v_prenex_166))) (or (= 0 (mod .cse34 v_prenex_165)) (not (= 8673 (div .cse34 v_prenex_165))) (<= 0 v_prenex_165) (= (mod .cse35 v_prenex_165) 0) (not (< .cse35 0)) (not (= (div .cse35 v_prenex_165) 8610)) (<= 0 .cse34)))) (forall ((v_prenex_213 Int) (v_prenex_214 Int)) (let ((.cse37 (* c_ssl3_accept_~ag_X~0 v_prenex_213)) (.cse36 (* 8672 v_prenex_213))) (or (not (= 8671 (div .cse36 v_prenex_214))) (<= 0 .cse36) (not (= (mod .cse37 v_prenex_214) 0)) (not (= (div .cse37 v_prenex_214) 8609)) (< v_prenex_214 0) (= 0 (mod .cse36 v_prenex_214))))) (forall ((v_prenex_167 Int) (v_prenex_168 Int)) (let ((.cse38 (* 8672 v_prenex_168)) (.cse39 (* c_ssl3_accept_~ag_X~0 v_prenex_168))) (or (< .cse38 0) (< .cse39 0) (not (= 8672 (div .cse38 v_prenex_167))) (< v_prenex_167 0) (not (= (mod .cse39 v_prenex_167) 0)) (not (= (div .cse39 v_prenex_167) 8609))))) (forall ((v_prenex_208 Int) (v_prenex_207 Int)) (let ((.cse40 (* c_ssl3_accept_~ag_X~0 v_prenex_208)) (.cse41 (* 8672 v_prenex_208))) (or (not (= (div .cse40 v_prenex_207) 8608)) (not (< .cse40 0)) (not (= 8672 (div .cse41 v_prenex_207))) (< v_prenex_207 0) (= (mod .cse40 v_prenex_207) 0) (< .cse41 0)))) (forall ((v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse43 (* 8672 v_prenex_182)) (.cse42 (* c_ssl3_accept_~ag_X~0 v_prenex_182))) (or (not (< .cse42 0)) (not (= 8672 (div .cse43 v_prenex_181))) (<= 0 v_prenex_181) (< .cse43 0) (not (= (div .cse42 v_prenex_181) 8610)) (= (mod .cse42 v_prenex_181) 0)))) (or (not (= .cse6 8672)) (and .cse7 (not .cse5))) (forall ((v_prenex_176 Int) (v_prenex_175 Int)) (let ((.cse44 (* c_ssl3_accept_~ag_X~0 v_prenex_176)) (.cse45 (* 8672 v_prenex_176))) (or (not (= (div .cse44 v_prenex_175) 8609)) (< .cse44 0) (< v_prenex_175 0) (= 0 (mod .cse45 v_prenex_175)) (not (= 8673 (div .cse45 v_prenex_175))) (<= 0 v_prenex_175) (<= 0 .cse45)))) (forall ((v_prenex_211 Int) (v_prenex_212 Int)) (let ((.cse46 (* c_ssl3_accept_~ag_X~0 v_prenex_211)) (.cse47 (* 8672 v_prenex_211))) (or (<= 0 v_prenex_212) (not (= (mod .cse46 v_prenex_212) 0)) (not (= (div .cse46 v_prenex_212) 8609)) (<= 0 .cse47) (not (= 8673 (div .cse47 v_prenex_212))) (= 0 (mod .cse47 v_prenex_212))))) (forall ((v_prenex_189 Int) (v_prenex_190 Int)) (let ((.cse49 (* 8672 v_prenex_190)) (.cse48 (* c_ssl3_accept_~ag_X~0 v_prenex_190))) (or (<= 0 v_prenex_189) (< .cse48 0) (not (= 8673 (div .cse49 v_prenex_189))) (not (= (mod .cse48 v_prenex_189) 0)) (<= 0 .cse49) (= 0 (mod .cse49 v_prenex_189)) (not (= (div .cse48 v_prenex_189) 8609))))) (forall ((v_prenex_187 Int) (v_prenex_188 Int)) (let ((.cse50 (* 8672 v_prenex_188)) (.cse51 (* c_ssl3_accept_~ag_X~0 v_prenex_188))) (or (not (= 8672 (div .cse50 v_prenex_187))) (not (= (mod .cse51 v_prenex_187) 0)) (not (= 0 (mod .cse50 v_prenex_187))) (<= 0 v_prenex_187) (not (= (div .cse51 v_prenex_187) 8609))))) (forall ((v_prenex_202 Int) (v_prenex_201 Int)) (let ((.cse53 (* 8672 v_prenex_202)) (.cse52 (* c_ssl3_accept_~ag_X~0 v_prenex_202))) (or (not (= (mod .cse52 v_prenex_201) 0)) (< .cse53 0) (not (= 8672 (div .cse53 v_prenex_201))) (< v_prenex_201 0) (not (= (div .cse52 v_prenex_201) 8609))))) (= c_ssl3_accept_~ag_X~0 8672) (forall ((v_prenex_179 Int) (v_prenex_180 Int)) (let ((.cse54 (* c_ssl3_accept_~ag_X~0 v_prenex_180)) (.cse55 (* 8672 v_prenex_180))) (or (not (= (div .cse54 v_prenex_179) 8608)) (not (< .cse54 0)) (<= 0 .cse55) (not (= 8671 (div .cse55 v_prenex_179))) (= (mod .cse54 v_prenex_179) 0) (= 0 (mod .cse55 v_prenex_179)) (< v_prenex_179 0)))) (forall ((v_prenex_178 Int) (v_prenex_177 Int)) (let ((.cse56 (* c_ssl3_accept_~ag_X~0 v_prenex_178)) (.cse57 (* 8672 v_prenex_178))) (or (not (= (mod .cse56 v_prenex_177) 0)) (not (= (div .cse56 v_prenex_177) 8609)) (not (= 8673 (div .cse57 v_prenex_177))) (< .cse56 0) (<= 0 v_prenex_177) (= 0 (mod .cse57 v_prenex_177)) (<= 0 .cse57) (< v_prenex_177 0))))))) is different from false [2019-09-09 05:55:57,354 WARN L188 SmtUtils]: Spent 3.62 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:56:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:56:02,988 INFO L93 Difference]: Finished difference Result 328487 states and 429694 transitions. [2019-09-09 05:56:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-09 05:56:02,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 523 [2019-09-09 05:56:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:56:03,346 INFO L225 Difference]: With dead ends: 328487 [2019-09-09 05:56:03,346 INFO L226 Difference]: Without dead ends: 314841 [2019-09-09 05:56:03,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 1045 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=150, Invalid=371, Unknown=5, NotChecked=230, Total=756 [2019-09-09 05:56:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314841 states. [2019-09-09 05:56:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314841 to 176627. [2019-09-09 05:56:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176627 states. [2019-09-09 05:56:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176627 states to 176627 states and 228935 transitions. [2019-09-09 05:56:06,021 INFO L78 Accepts]: Start accepts. Automaton has 176627 states and 228935 transitions. Word has length 523 [2019-09-09 05:56:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:56:06,021 INFO L475 AbstractCegarLoop]: Abstraction has 176627 states and 228935 transitions. [2019-09-09 05:56:06,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-09 05:56:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 176627 states and 228935 transitions. [2019-09-09 05:56:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-09-09 05:56:06,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:56:06,053 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:56:06,053 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:56:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash 519546509, now seen corresponding path program 1 times [2019-09-09 05:56:06,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:56:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:06,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:56:06,070 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:56:06,071 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:56:06,071 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:56:06,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:06,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:56:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:06,160 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 548 with the following transitions: [2019-09-09 05:56:06,160 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [51], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [226], [228], [231], [239], [249], [251], [256], [266], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:56:06,162 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:56:06,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:56:06,216 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:56:06,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:56:06,775 INFO L272 AbstractInterpreter]: Visited 115 different actions 1880 times. Merged at 97 different actions 1497 times. Widened at 25 different actions 229 times. Performed 4685 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4685 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 216 fixpoints after 20 different actions. Largest state had 95 variables. [2019-09-09 05:56:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:06,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:56:06,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:56:06,776 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:56:06,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:06,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:56:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:06,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:56:06,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:56:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1666 proven. 0 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2019-09-09 05:56:07,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:56:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1666 proven. 0 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2019-09-09 05:56:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:56:07,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:56:07,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:56:07,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:56:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:56:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:07,176 INFO L87 Difference]: Start difference. First operand 176627 states and 228935 transitions. Second operand 3 states. [2019-09-09 05:56:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:56:07,583 INFO L93 Difference]: Finished difference Result 182063 states and 234603 transitions. [2019-09-09 05:56:07,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:56:07,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 547 [2019-09-09 05:56:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:56:07,759 INFO L225 Difference]: With dead ends: 182063 [2019-09-09 05:56:07,760 INFO L226 Difference]: Without dead ends: 182063 [2019-09-09 05:56:07,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182063 states. [2019-09-09 05:56:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182063 to 180153. [2019-09-09 05:56:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180153 states. [2019-09-09 05:56:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180153 states to 180153 states and 232637 transitions. [2019-09-09 05:56:09,811 INFO L78 Accepts]: Start accepts. Automaton has 180153 states and 232637 transitions. Word has length 547 [2019-09-09 05:56:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:56:09,812 INFO L475 AbstractCegarLoop]: Abstraction has 180153 states and 232637 transitions. [2019-09-09 05:56:09,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:56:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 180153 states and 232637 transitions. [2019-09-09 05:56:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-09 05:56:09,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:56:09,846 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:56:09,847 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:56:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1793784058, now seen corresponding path program 1 times [2019-09-09 05:56:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:56:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:09,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:09,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:09,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:56:09,865 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:56:09,865 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:56:09,865 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:56:09,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:09,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:56:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:09,979 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 549 with the following transitions: [2019-09-09 05:56:09,979 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [51], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [226], [228], [231], [239], [249], [251], [256], [259], [264], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:56:09,980 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:56:09,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:56:10,029 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:56:10,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:56:10,691 INFO L272 AbstractInterpreter]: Visited 115 different actions 2364 times. Merged at 94 different actions 1903 times. Widened at 23 different actions 308 times. Performed 5784 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5784 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 264 fixpoints after 31 different actions. Largest state had 96 variables. [2019-09-09 05:56:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:10,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:56:10,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:56:10,692 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:56:10,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:10,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:56:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:10,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:56:10,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:56:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1616 proven. 0 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2019-09-09 05:56:14,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:56:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1616 proven. 0 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2019-09-09 05:56:14,403 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:56:14,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:56:14,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:56:14,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:56:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:56:14,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:14,405 INFO L87 Difference]: Start difference. First operand 180153 states and 232637 transitions. Second operand 3 states. [2019-09-09 05:56:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:56:14,789 INFO L93 Difference]: Finished difference Result 180441 states and 232851 transitions. [2019-09-09 05:56:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:56:14,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 548 [2019-09-09 05:56:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:56:14,971 INFO L225 Difference]: With dead ends: 180441 [2019-09-09 05:56:14,971 INFO L226 Difference]: Without dead ends: 180441 [2019-09-09 05:56:14,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1095 GetRequests, 1094 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180441 states. [2019-09-09 05:56:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180441 to 180009. [2019-09-09 05:56:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180009 states. [2019-09-09 05:56:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180009 states to 180009 states and 232371 transitions. [2019-09-09 05:56:16,701 INFO L78 Accepts]: Start accepts. Automaton has 180009 states and 232371 transitions. Word has length 548 [2019-09-09 05:56:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:56:16,702 INFO L475 AbstractCegarLoop]: Abstraction has 180009 states and 232371 transitions. [2019-09-09 05:56:16,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:56:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 180009 states and 232371 transitions. [2019-09-09 05:56:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-09-09 05:56:16,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:56:16,736 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 11, 10, 10, 9, 9, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:56:16,737 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:56:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash -681871217, now seen corresponding path program 1 times [2019-09-09 05:56:16,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:56:16,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:16,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:16,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:16,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:56:16,751 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:56:16,751 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:56:16,751 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:56:16,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:16,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:56:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:16,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 559 with the following transitions: [2019-09-09 05:56:16,842 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [196], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:56:16,844 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:56:16,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:56:16,886 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:56:17,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:56:17,601 INFO L272 AbstractInterpreter]: Visited 107 different actions 2216 times. Merged at 88 different actions 1771 times. Widened at 21 different actions 290 times. Performed 5470 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5470 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 282 fixpoints after 22 different actions. Largest state had 94 variables. [2019-09-09 05:56:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:17,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:56:17,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:56:17,601 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:56:17,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:17,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:56:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:17,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:56:17,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:56:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3251 backedges. 1808 proven. 0 refuted. 0 times theorem prover too weak. 1443 trivial. 0 not checked. [2019-09-09 05:56:17,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:56:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3251 backedges. 1808 proven. 0 refuted. 0 times theorem prover too weak. 1443 trivial. 0 not checked. [2019-09-09 05:56:18,367 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:56:18,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:56:18,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:56:18,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:56:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:56:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:18,368 INFO L87 Difference]: Start difference. First operand 180009 states and 232371 transitions. Second operand 3 states. [2019-09-09 05:56:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:56:18,659 INFO L93 Difference]: Finished difference Result 160315 states and 207241 transitions. [2019-09-09 05:56:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:56:18,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-09-09 05:56:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:56:18,820 INFO L225 Difference]: With dead ends: 160315 [2019-09-09 05:56:18,820 INFO L226 Difference]: Without dead ends: 160315 [2019-09-09 05:56:18,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1115 GetRequests, 1113 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160315 states. [2019-09-09 05:56:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160315 to 156660. [2019-09-09 05:56:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156660 states. [2019-09-09 05:56:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156660 states to 156660 states and 203059 transitions. [2019-09-09 05:56:23,709 INFO L78 Accepts]: Start accepts. Automaton has 156660 states and 203059 transitions. Word has length 558 [2019-09-09 05:56:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:56:23,709 INFO L475 AbstractCegarLoop]: Abstraction has 156660 states and 203059 transitions. [2019-09-09 05:56:23,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:56:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 156660 states and 203059 transitions. [2019-09-09 05:56:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-09-09 05:56:23,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:56:23,740 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 11, 10, 10, 9, 9, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:56:23,740 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:56:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash -468254131, now seen corresponding path program 2 times [2019-09-09 05:56:23,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:56:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:23,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:56:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:23,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:56:23,757 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:56:23,757 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:56:23,757 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:56:23,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:56:23,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:56:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:23,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:56:23,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:56:23,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:56:23,847 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:56:23,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:56:23,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:56:25,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-09 05:56:25,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:56:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:56:25,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:56:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3251 backedges. 1517 proven. 0 refuted. 0 times theorem prover too weak. 1734 trivial. 0 not checked. [2019-09-09 05:56:25,475 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:56:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3251 backedges. 1517 proven. 0 refuted. 0 times theorem prover too weak. 1734 trivial. 0 not checked. [2019-09-09 05:56:25,614 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:56:25,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:56:25,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:56:25,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:56:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:56:25,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:25,616 INFO L87 Difference]: Start difference. First operand 156660 states and 203059 transitions. Second operand 3 states. [2019-09-09 05:56:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:56:25,918 INFO L93 Difference]: Finished difference Result 156660 states and 203007 transitions. [2019-09-09 05:56:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:56:25,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-09-09 05:56:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:56:26,076 INFO L225 Difference]: With dead ends: 156660 [2019-09-09 05:56:26,077 INFO L226 Difference]: Without dead ends: 156660 [2019-09-09 05:56:26,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1115 GetRequests, 1113 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:56:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156660 states. [2019-09-09 05:56:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156660 to 156660. [2019-09-09 05:56:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156660 states. [2019-09-09 05:56:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156660 states to 156660 states and 203007 transitions. [2019-09-09 05:56:27,948 INFO L78 Accepts]: Start accepts. Automaton has 156660 states and 203007 transitions. Word has length 558 [2019-09-09 05:56:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:56:27,949 INFO L475 AbstractCegarLoop]: Abstraction has 156660 states and 203007 transitions. [2019-09-09 05:56:27,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:56:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 156660 states and 203007 transitions. [2019-09-09 05:56:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-09-09 05:56:27,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:56:27,978 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 11, 10, 10, 9, 9, 8, 8, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:56:27,978 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:56:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:56:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1947582219, now seen corresponding path program 3 times [2019-09-09 05:56:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:56:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:27,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:56:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:56:27,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:56:27,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:56:27,993 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:56:27,993 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:56:28,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:56:28,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:56:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:56:28,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:56:28,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:56:28,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:56:28,084 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:56:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:56:28,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:56:28,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:56:28,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:56:28,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:56:28,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:56:28,385 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-09-09 05:56:28,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:43,243 WARN L188 SmtUtils]: Spent 14.76 s on a formula simplification. DAG size of input: 48 DAG size of output: 20 [2019-09-09 05:56:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3251 backedges. 1912 proven. 35 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2019-09-09 05:56:44,119 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:56:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:56:44,294 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-09-09 05:56:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3251 backedges. 1912 proven. 35 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2019-09-09 05:56:44,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:56:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-09 05:56:44,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:56:44,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:56:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:56:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:56:44,599 INFO L87 Difference]: Start difference. First operand 156660 states and 203007 transitions. Second operand 8 states. [2019-09-09 05:56:47,856 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-09 05:56:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:56:59,469 INFO L93 Difference]: Finished difference Result 256340 states and 324991 transitions. [2019-09-09 05:56:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:56:59,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 558 [2019-09-09 05:56:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:56:59,751 INFO L225 Difference]: With dead ends: 256340 [2019-09-09 05:56:59,751 INFO L226 Difference]: Without dead ends: 256340 [2019-09-09 05:56:59,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 1112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:56:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256340 states. [2019-09-09 05:57:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256340 to 171882. [2019-09-09 05:57:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171882 states. [2019-09-09 05:57:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171882 states to 171882 states and 217293 transitions. [2019-09-09 05:57:02,229 INFO L78 Accepts]: Start accepts. Automaton has 171882 states and 217293 transitions. Word has length 558 [2019-09-09 05:57:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:02,230 INFO L475 AbstractCegarLoop]: Abstraction has 171882 states and 217293 transitions. [2019-09-09 05:57:02,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:57:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 171882 states and 217293 transitions. [2019-09-09 05:57:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-09-09 05:57:02,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:02,259 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:57:02,259 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1743949513, now seen corresponding path program 1 times [2019-09-09 05:57:02,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:02,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:57:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:02,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:02,274 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:57:02,274 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:57:02,274 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:57:02,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:02,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:57:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:57:02,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 560 with the following transitions: [2019-09-09 05:57:02,364 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [51], [53], [58], [63], [68], [73], [76], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [226], [228], [231], [239], [249], [251], [256], [266], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:57:02,366 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:57:02,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:57:02,444 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:57:03,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:57:03,627 INFO L272 AbstractInterpreter]: Visited 118 different actions 1831 times. Merged at 95 different actions 1446 times. Widened at 23 different actions 232 times. Performed 4758 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4758 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 241 fixpoints after 26 different actions. Largest state had 96 variables. [2019-09-09 05:57:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:03,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:57:03,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:57:03,627 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:57:03,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:03,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:57:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:03,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:57:03,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:57:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3377 backedges. 1806 proven. 0 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2019-09-09 05:57:03,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:57:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3377 backedges. 1806 proven. 0 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:57:04,029 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:57:04,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-09 05:57:04,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:57:04,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:57:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:57:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:57:04,030 INFO L87 Difference]: Start difference. First operand 171882 states and 217293 transitions. Second operand 3 states. [2019-09-09 05:57:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:57:04,450 INFO L93 Difference]: Finished difference Result 182517 states and 225189 transitions. [2019-09-09 05:57:04,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:57:04,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 559 [2019-09-09 05:57:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:57:04,627 INFO L225 Difference]: With dead ends: 182517 [2019-09-09 05:57:04,627 INFO L226 Difference]: Without dead ends: 182517 [2019-09-09 05:57:04,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1117 GetRequests, 1116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:57:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182517 states. [2019-09-09 05:57:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182517 to 181485. [2019-09-09 05:57:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181485 states. [2019-09-09 05:57:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181485 states to 181485 states and 224001 transitions. [2019-09-09 05:57:06,712 INFO L78 Accepts]: Start accepts. Automaton has 181485 states and 224001 transitions. Word has length 559 [2019-09-09 05:57:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:06,712 INFO L475 AbstractCegarLoop]: Abstraction has 181485 states and 224001 transitions. [2019-09-09 05:57:06,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:57:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 181485 states and 224001 transitions. [2019-09-09 05:57:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2019-09-09 05:57:06,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:06,744 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 12, 11, 11, 9, 9, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:57:06,744 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1667256003, now seen corresponding path program 2 times [2019-09-09 05:57:06,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:06,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:06,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:06,761 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:57:06,761 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:57:06,761 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:57:06,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:57:06,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:57:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:06,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:57:06,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:57:06,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:57:06,874 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:57:06,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:57:06,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:57:08,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-09 05:57:08,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:57:08,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-09 05:57:08,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:57:39,491 WARN L188 SmtUtils]: Spent 30.85 s on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-09-09 05:57:39,677 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-09-09 05:57:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:39,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:41,930 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 47 DAG size of output: 16 [2019-09-09 05:57:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3643 backedges. 1146 proven. 526 refuted. 0 times theorem prover too weak. 1971 trivial. 0 not checked. [2019-09-09 05:57:45,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:57:45,918 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-09-09 05:57:48,045 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-09 05:57:50,461 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-09 05:57:50,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:57:50,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms