java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:55:30,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:55:30,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:55:30,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:55:30,216 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:55:30,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:55:30,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:55:30,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:55:30,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:55:30,226 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:55:30,227 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:55:30,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:55:30,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:55:30,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:55:30,238 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:55:30,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:55:30,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:55:30,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:55:30,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:55:30,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:55:30,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:55:30,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:55:30,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:55:30,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:55:30,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:55:30,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:55:30,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:55:30,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:55:30,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:55:30,255 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:55:30,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:55:30,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:55:30,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:55:30,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:55:30,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:55:30,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:55:30,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 01:55:30,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:55:30,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:55:30,275 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:55:30,275 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:55:30,276 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:55:30,276 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:55:30,276 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:55:30,276 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:55:30,276 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:55:30,277 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:55:30,277 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:55:30,277 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:55:30,277 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:55:30,277 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:55:30,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:55:30,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:55:30,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:55:30,279 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:55:30,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:55:30,279 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:55:30,279 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:55:30,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:55:30,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:55:30,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:55:30,280 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:55:30,280 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:55:30,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:55:30,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:55:30,281 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:55:30,281 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:55:30,281 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:55:30,281 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:55:30,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:55:30,282 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:55:30,282 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:55:30,282 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:55:30,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:55:30,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:55:30,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:55:30,355 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:55:30,356 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:55:30,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label17_true-unreach-call.c [2018-10-25 01:55:30,423 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/80c00154a/dfbe401549d0453cb23a569e3a45b8c2/FLAG96e1539c1 [2018-10-25 01:55:31,205 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:55:31,206 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label17_true-unreach-call.c [2018-10-25 01:55:31,228 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/80c00154a/dfbe401549d0453cb23a569e3a45b8c2/FLAG96e1539c1 [2018-10-25 01:55:31,244 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/80c00154a/dfbe401549d0453cb23a569e3a45b8c2 [2018-10-25 01:55:31,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:55:31,258 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:55:31,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:55:31,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:55:31,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:55:31,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:55:31" (1/1) ... [2018-10-25 01:55:31,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31cb433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:31, skipping insertion in model container [2018-10-25 01:55:31,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:55:31" (1/1) ... [2018-10-25 01:55:31,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:55:31,386 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:55:32,373 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:55:32,378 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:55:32,789 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:55:32,815 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:55:32,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32 WrapperNode [2018-10-25 01:55:32,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:55:32,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:55:32,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:55:32,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:55:32,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:32,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:55:33,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:55:33,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:55:33,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:55:33,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... [2018-10-25 01:55:33,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:55:33,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:55:33,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:55:33,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:55:33,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:55:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:55:33,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:55:33,632 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:55:33,632 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:55:33,633 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:55:33,633 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:55:33,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:55:33,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:55:33,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:55:33,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:55:45,017 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:55:45,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:55:45 BoogieIcfgContainer [2018-10-25 01:55:45,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:55:45,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:55:45,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:55:45,023 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:55:45,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:55:31" (1/3) ... [2018-10-25 01:55:45,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9acdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:55:45, skipping insertion in model container [2018-10-25 01:55:45,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:55:32" (2/3) ... [2018-10-25 01:55:45,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9acdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:55:45, skipping insertion in model container [2018-10-25 01:55:45,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:55:45" (3/3) ... [2018-10-25 01:55:45,027 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label17_true-unreach-call.c [2018-10-25 01:55:45,037 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:55:45,045 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:55:45,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:55:45,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:55:45,105 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:55:45,105 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:55:45,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:55:45,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:55:45,106 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:55:45,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:55:45,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:55:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-25 01:55:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-25 01:55:45,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:45,152 INFO L375 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] [2018-10-25 01:55:45,155 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:45,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1741337806, now seen corresponding path program 1 times [2018-10-25 01:55:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:45,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:45,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:45,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:45,692 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-25 01:55:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:55:45,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:55:45,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:55:45,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:55:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:55:45,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:45,731 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-25 01:55:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:55:58,333 INFO L93 Difference]: Finished difference Result 2133 states and 3959 transitions. [2018-10-25 01:55:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:55:58,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-10-25 01:55:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:55:58,369 INFO L225 Difference]: With dead ends: 2133 [2018-10-25 01:55:58,370 INFO L226 Difference]: Without dead ends: 1523 [2018-10-25 01:55:58,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:55:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2018-10-25 01:55:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1516. [2018-10-25 01:55:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2018-10-25 01:55:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2287 transitions. [2018-10-25 01:55:58,542 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2287 transitions. Word has length 45 [2018-10-25 01:55:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:55:58,543 INFO L481 AbstractCegarLoop]: Abstraction has 1516 states and 2287 transitions. [2018-10-25 01:55:58,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:55:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2287 transitions. [2018-10-25 01:55:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-25 01:55:58,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:55:58,553 INFO L375 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, 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] [2018-10-25 01:55:58,553 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:55:58,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:55:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2085909177, now seen corresponding path program 1 times [2018-10-25 01:55:58,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:55:58,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:58,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:55:58,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:55:58,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:55:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:55:59,243 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-10-25 01:55:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:55:59,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:55:59,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:55:59,565 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2018-10-25 01:55:59,567 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [970], [972], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:55:59,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:55:59,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:56:01,469 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:56:01,471 INFO L272 AbstractInterpreter]: Visited 83 different actions 235 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:56:01,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:56:01,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:56:01,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:56:01,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:56:01,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:56:01,512 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:56:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:56:01,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:56:28,304 WARN L179 SmtUtils]: Spent 24.25 s on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2018-10-25 01:56:46,592 WARN L179 SmtUtils]: Spent 16.09 s on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2018-10-25 01:56:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:56:47,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:56:49,841 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 133 DAG size of output: 16 [2018-10-25 01:56:49,997 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2018-10-25 01:56:52,924 WARN L179 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 26 [2018-10-25 01:56:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:56:53,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 01:56:53,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2018-10-25 01:56:53,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:56:53,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:56:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:56:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=162, Unknown=2, NotChecked=0, Total=210 [2018-10-25 01:56:53,303 INFO L87 Difference]: Start difference. First operand 1516 states and 2287 transitions. Second operand 6 states. [2018-10-25 01:57:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:57:39,870 INFO L93 Difference]: Finished difference Result 5742 states and 8894 transitions. [2018-10-25 01:57:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:57:39,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-10-25 01:57:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:57:39,908 INFO L225 Difference]: With dead ends: 5742 [2018-10-25 01:57:39,908 INFO L226 Difference]: Without dead ends: 4232 [2018-10-25 01:57:39,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 51.3s TimeCoverageRelationStatistics Valid=46, Invalid=162, Unknown=2, NotChecked=0, Total=210 [2018-10-25 01:57:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4232 states. [2018-10-25 01:57:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4232 to 4196. [2018-10-25 01:57:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4196 states. [2018-10-25 01:57:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6323 transitions. [2018-10-25 01:57:40,052 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6323 transitions. Word has length 120 [2018-10-25 01:57:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:57:40,053 INFO L481 AbstractCegarLoop]: Abstraction has 4196 states and 6323 transitions. [2018-10-25 01:57:40,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:57:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6323 transitions. [2018-10-25 01:57:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-25 01:57:40,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:57:40,064 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:57:40,064 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:57:40,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:57:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1856812064, now seen corresponding path program 1 times [2018-10-25 01:57:40,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:57:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:57:40,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:57:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:57:40,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:57:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:57:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:57:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:57:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:57:40,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:57:40,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:57:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:57:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:57:40,391 INFO L87 Difference]: Start difference. First operand 4196 states and 6323 transitions. Second operand 6 states. [2018-10-25 01:57:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:57:47,069 INFO L93 Difference]: Finished difference Result 12519 states and 19797 transitions. [2018-10-25 01:57:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:57:47,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-10-25 01:57:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:57:47,129 INFO L225 Difference]: With dead ends: 12519 [2018-10-25 01:57:47,130 INFO L226 Difference]: Without dead ends: 8329 [2018-10-25 01:57:47,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:57:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8329 states. [2018-10-25 01:57:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8329 to 8260. [2018-10-25 01:57:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8260 states. [2018-10-25 01:57:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8260 states to 8260 states and 12003 transitions. [2018-10-25 01:57:47,387 INFO L78 Accepts]: Start accepts. Automaton has 8260 states and 12003 transitions. Word has length 187 [2018-10-25 01:57:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:57:47,387 INFO L481 AbstractCegarLoop]: Abstraction has 8260 states and 12003 transitions. [2018-10-25 01:57:47,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:57:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8260 states and 12003 transitions. [2018-10-25 01:57:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-25 01:57:47,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:57:47,394 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-25 01:57:47,394 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:57:47,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:57:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1605012379, now seen corresponding path program 1 times [2018-10-25 01:57:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:57:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:57:47,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:57:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:57:47,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:57:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:57:47,706 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:57:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 77 proven. 7 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-25 01:57:48,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:57:48,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:57:48,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-10-25 01:57:48,148 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [970], [972], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1262], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:57:48,158 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:57:48,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:57:49,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:57:49,328 INFO L272 AbstractInterpreter]: Visited 92 different actions 262 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:57:49,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:57:49,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:57:49,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:57:49,366 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:57:49,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:57:49,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:57:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:57:49,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:57:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:57:49,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:57:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:57:50,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:57:50,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 01:57:50,341 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:57:50,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 01:57:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 01:57:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-25 01:57:50,344 INFO L87 Difference]: Start difference. First operand 8260 states and 12003 transitions. Second operand 9 states. [2018-10-25 01:57:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:57:59,539 INFO L93 Difference]: Finished difference Result 20087 states and 29397 transitions. [2018-10-25 01:57:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 01:57:59,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-10-25 01:57:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:57:59,602 INFO L225 Difference]: With dead ends: 20087 [2018-10-25 01:57:59,603 INFO L226 Difference]: Without dead ends: 11833 [2018-10-25 01:57:59,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 404 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-25 01:57:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2018-10-25 01:57:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 11810. [2018-10-25 01:57:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11810 states. [2018-10-25 01:57:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 15142 transitions. [2018-10-25 01:57:59,930 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 15142 transitions. Word has length 203 [2018-10-25 01:57:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:57:59,930 INFO L481 AbstractCegarLoop]: Abstraction has 11810 states and 15142 transitions. [2018-10-25 01:57:59,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 01:57:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 15142 transitions. [2018-10-25 01:57:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-25 01:57:59,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:57:59,938 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-10-25 01:57:59,938 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:57:59,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:57:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -282876377, now seen corresponding path program 1 times [2018-10-25 01:57:59,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:57:59,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:57:59,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:57:59,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:57:59,940 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:57:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:00,259 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:58:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 110 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 01:58:00,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:58:00,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:58:00,427 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-10-25 01:58:00,427 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [970], [972], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:58:00,431 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:58:00,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:58:00,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:58:00,744 INFO L272 AbstractInterpreter]: Visited 97 different actions 190 times. Merged at 7 different actions 8 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:58:00,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:00,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:58:00,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:58:00,770 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:58:00,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:00,782 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:58:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:01,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:58:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-25 01:58:01,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:58:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-25 01:58:01,280 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:58:01,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-10-25 01:58:01,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:58:01,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:58:01,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:58:01,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:58:01,282 INFO L87 Difference]: Start difference. First operand 11810 states and 15142 transitions. Second operand 3 states. [2018-10-25 01:58:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:58:05,046 INFO L93 Difference]: Finished difference Result 23614 states and 30278 transitions. [2018-10-25 01:58:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:58:05,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-25 01:58:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:58:05,089 INFO L225 Difference]: With dead ends: 23614 [2018-10-25 01:58:05,089 INFO L226 Difference]: Without dead ends: 11810 [2018-10-25 01:58:05,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 440 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:58:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2018-10-25 01:58:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 11810. [2018-10-25 01:58:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11810 states. [2018-10-25 01:58:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 14385 transitions. [2018-10-25 01:58:05,343 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 14385 transitions. Word has length 220 [2018-10-25 01:58:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:58:05,344 INFO L481 AbstractCegarLoop]: Abstraction has 11810 states and 14385 transitions. [2018-10-25 01:58:05,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:58:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 14385 transitions. [2018-10-25 01:58:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-25 01:58:05,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:58:05,352 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:58:05,352 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:58:05,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1607590703, now seen corresponding path program 1 times [2018-10-25 01:58:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:58:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:05,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:05,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:58:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-25 01:58:05,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:58:05,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:58:05,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:58:05,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:58:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:58:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:58:05,734 INFO L87 Difference]: Start difference. First operand 11810 states and 14385 transitions. Second operand 4 states. [2018-10-25 01:58:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:58:13,119 INFO L93 Difference]: Finished difference Result 31568 states and 39008 transitions. [2018-10-25 01:58:13,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:58:13,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 275 [2018-10-25 01:58:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:58:13,185 INFO L225 Difference]: With dead ends: 31568 [2018-10-25 01:58:13,186 INFO L226 Difference]: Without dead ends: 19764 [2018-10-25 01:58:13,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:58:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19764 states. [2018-10-25 01:58:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19764 to 19751. [2018-10-25 01:58:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19751 states. [2018-10-25 01:58:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19751 states to 19751 states and 23523 transitions. [2018-10-25 01:58:13,586 INFO L78 Accepts]: Start accepts. Automaton has 19751 states and 23523 transitions. Word has length 275 [2018-10-25 01:58:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:58:13,587 INFO L481 AbstractCegarLoop]: Abstraction has 19751 states and 23523 transitions. [2018-10-25 01:58:13,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:58:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 19751 states and 23523 transitions. [2018-10-25 01:58:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-25 01:58:13,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:58:13,600 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:58:13,600 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:58:13,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash -25254690, now seen corresponding path program 1 times [2018-10-25 01:58:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:58:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:13,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:13,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:58:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-25 01:58:14,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:58:14,233 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:58:14,234 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 320 with the following transitions: [2018-10-25 01:58:14,234 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [970], [972], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1333], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:58:14,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:58:14,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:58:14,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:58:14,559 INFO L272 AbstractInterpreter]: Visited 109 different actions 220 times. Merged at 8 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 26 variables. [2018-10-25 01:58:14,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:14,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:58:14,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:58:14,597 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 01:58:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:14,611 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:58:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:14,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:58:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-25 01:58:14,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:58:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-25 01:58:15,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:58:15,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-10-25 01:58:15,722 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:58:15,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 01:58:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 01:58:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:58:15,724 INFO L87 Difference]: Start difference. First operand 19751 states and 23523 transitions. Second operand 7 states. [2018-10-25 01:58:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:58:27,799 INFO L93 Difference]: Finished difference Result 53697 states and 65568 transitions. [2018-10-25 01:58:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 01:58:27,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 319 [2018-10-25 01:58:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:58:27,886 INFO L225 Difference]: With dead ends: 53697 [2018-10-25 01:58:27,886 INFO L226 Difference]: Without dead ends: 30808 [2018-10-25 01:58:27,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 639 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-10-25 01:58:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30808 states. [2018-10-25 01:58:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30808 to 28983. [2018-10-25 01:58:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28983 states. [2018-10-25 01:58:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28983 states to 28983 states and 33258 transitions. [2018-10-25 01:58:28,454 INFO L78 Accepts]: Start accepts. Automaton has 28983 states and 33258 transitions. Word has length 319 [2018-10-25 01:58:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:58:28,455 INFO L481 AbstractCegarLoop]: Abstraction has 28983 states and 33258 transitions. [2018-10-25 01:58:28,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 01:58:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28983 states and 33258 transitions. [2018-10-25 01:58:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-25 01:58:28,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:58:28,474 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:58:28,474 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:58:28,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1822386049, now seen corresponding path program 1 times [2018-10-25 01:58:28,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:58:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:28,476 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:58:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-25 01:58:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:58:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:58:28,954 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:58:28,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:58:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:58:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:58:28,955 INFO L87 Difference]: Start difference. First operand 28983 states and 33258 transitions. Second operand 4 states. [2018-10-25 01:58:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:58:38,078 INFO L93 Difference]: Finished difference Result 96688 states and 113699 transitions. [2018-10-25 01:58:38,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:58:38,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2018-10-25 01:58:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:58:38,243 INFO L225 Difference]: With dead ends: 96688 [2018-10-25 01:58:38,243 INFO L226 Difference]: Without dead ends: 67716 [2018-10-25 01:58:38,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:58:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67716 states. [2018-10-25 01:58:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67716 to 65970. [2018-10-25 01:58:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65970 states. [2018-10-25 01:58:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65970 states to 65970 states and 75472 transitions. [2018-10-25 01:58:39,210 INFO L78 Accepts]: Start accepts. Automaton has 65970 states and 75472 transitions. Word has length 332 [2018-10-25 01:58:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:58:39,211 INFO L481 AbstractCegarLoop]: Abstraction has 65970 states and 75472 transitions. [2018-10-25 01:58:39,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:58:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 65970 states and 75472 transitions. [2018-10-25 01:58:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-25 01:58:39,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:58:39,299 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:58:39,299 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:58:39,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1357516723, now seen corresponding path program 1 times [2018-10-25 01:58:39,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:58:39,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:39,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:39,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:58:39,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:58:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 7 proven. 182 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2018-10-25 01:58:40,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:58:40,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:58:40,042 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 510 with the following transitions: [2018-10-25 01:58:40,045 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [970], [972], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1356], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1401], [1405], [1409], [1413], [1417], [1428], [1432], [1436], [1440], [1451], [1455], [1459], [1463], [1467], [1471], [1475], [1479], [1490], [1501], [1505], [1516], [1520], [1524], [1528], [1532], [1536], [1540], [1544], [1548], [1559], [1563], [1567], [1578], [1582], [1593], [1597], [1601], [1612], [1623], [1627], [1631], [1635], [1639], [1643], [1647], [1651], [1655], [1659], [1663], [1667], [1678], [1689], [1693], [1697], [1701], [1705], [1709], [1713], [1717], [1728], [1732], [1736], [1747], [1751], [1755], [1759], [1763], [1767], [1771], [1775], [1779], [1783], [1786], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 01:58:40,051 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:58:40,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:58:42,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:58:42,014 INFO L272 AbstractInterpreter]: Visited 197 different actions 605 times. Merged at 9 different actions 37 times. Widened at 1 different actions 3 times. Found 7 fixpoints after 3 different actions. Largest state had 26 variables. [2018-10-25 01:58:42,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:58:42,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:58:42,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:58:42,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:58:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:58:42,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:58:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:58:42,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:58:49,175 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 120 DAG size of output: 16 [2018-10-25 01:58:51,337 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_36 Int)) (let ((.cse1 (* 9 v_prenex_36))) (let ((.cse0 (div .cse1 10))) (and (<= (+ c_~a28~0 289060) (div .cse0 5)) (<= 0 .cse0) (= (mod (+ .cse0 1) 5) 0) (< 300 v_prenex_36) (<= v_prenex_36 |c_old(~a28~0)|) (<= 0 .cse1))))) (exists ((v_prenex_78 Int)) (let ((.cse2 (* 9 v_prenex_78))) (let ((.cse4 (div .cse2 10))) (let ((.cse3 (+ .cse4 1))) (and (not (= 0 (mod .cse2 10))) (= (mod .cse3 5) 0) (<= v_prenex_78 |c_old(~a28~0)|) (< .cse2 0) (<= (+ c_~a28~0 289060) (div .cse3 5)) (<= 0 .cse4) (<= v_prenex_78 134) (< 37 v_prenex_78)))))) (exists ((v_prenex_106 Int)) (let ((.cse5 (* 9 v_prenex_106))) (let ((.cse6 (div .cse5 10))) (and (<= 0 .cse5) (<= (+ c_~a28~0 289060) (div .cse6 5)) (<= v_prenex_106 37) (= 0 (mod .cse6 5)) (<= 0 (+ .cse6 1)) (<= v_prenex_106 |c_old(~a28~0)|))))) (exists ((v_prenex_47 Int)) (let ((.cse8 (* 9 v_prenex_47))) (let ((.cse7 (div .cse8 10))) (and (<= v_prenex_47 134) (<= (+ c_~a28~0 289060) (div .cse7 5)) (<= v_prenex_47 |c_old(~a28~0)|) (< 37 v_prenex_47) (<= 0 .cse7) (<= 0 (+ .cse7 1)) (= 0 (mod .cse8 10)))))) (exists ((v_prenex_88 Int)) (let ((.cse11 (* 9 v_prenex_88))) (let ((.cse10 (div .cse11 10))) (let ((.cse9 (+ .cse10 1))) (and (<= v_prenex_88 |c_old(~a28~0)|) (< 300 v_prenex_88) (< .cse9 0) (= 0 (mod .cse10 5)) (= 0 (mod .cse11 10)) (not (= (mod .cse9 5) 0)) (<= (+ c_~a28~0 289060) (div .cse10 5))))))) (exists ((v_prenex_68 Int)) (let ((.cse13 (* 9 v_prenex_68))) (let ((.cse12 (div .cse13 10))) (let ((.cse14 (+ .cse12 1))) (and (< .cse12 0) (< 37 v_prenex_68) (< .cse13 0) (not (= 0 (mod .cse12 5))) (not (= 0 (mod .cse13 10))) (<= v_prenex_68 |c_old(~a28~0)|) (= (mod .cse14 5) 0) (<= v_prenex_68 134) (<= (+ c_~a28~0 289060) (div .cse14 5))))))) (exists ((v_prenex_46 Int)) (let ((.cse16 (* 9 v_prenex_46))) (let ((.cse15 (div .cse16 10))) (let ((.cse17 (+ .cse15 1))) (and (<= (+ c_~a28~0 289060) (div .cse15 5)) (= 0 (mod .cse16 10)) (<= v_prenex_46 37) (<= v_prenex_46 |c_old(~a28~0)|) (= 0 (mod .cse15 5)) (< .cse17 0) (not (= (mod .cse17 5) 0))))))) (exists ((v_prenex_64 Int)) (let ((.cse18 (* 9 v_prenex_64))) (let ((.cse19 (div .cse18 10))) (and (<= v_prenex_64 134) (= 0 (mod .cse18 10)) (<= 0 (+ .cse19 1)) (not (= 0 (mod .cse19 5))) (< 37 v_prenex_64) (<= v_prenex_64 |c_old(~a28~0)|) (< .cse19 0) (<= (+ c_~a28~0 289059) (div .cse19 5)))))) (exists ((v_prenex_58 Int)) (let ((.cse22 (* 9 v_prenex_58))) (let ((.cse21 (div .cse22 10))) (let ((.cse20 (+ .cse21 1))) (and (not (= (mod .cse20 5) 0)) (<= (+ c_~a28~0 289060) (div .cse21 5)) (<= v_prenex_58 |c_old(~a28~0)|) (<= 0 .cse21) (< 37 v_prenex_58) (<= v_prenex_58 134) (< .cse20 0) (<= 0 .cse22)))))) (exists ((v_prenex_90 Int)) (let ((.cse24 (* 9 v_prenex_90))) (let ((.cse23 (div .cse24 10))) (and (<= 0 .cse23) (= (mod (+ .cse23 1) 5) 0) (<= v_prenex_90 |c_old(~a28~0)|) (<= 0 .cse24) (<= (+ c_~a28~0 289060) (div .cse23 5)) (<= v_prenex_90 37))))) (exists ((v_prenex_84 Int)) (let ((.cse26 (* 9 v_prenex_84))) (let ((.cse25 (div .cse26 10))) (and (= 0 (mod .cse25 5)) (= (mod (+ .cse25 1) 5) 0) (<= v_prenex_84 134) (< 37 v_prenex_84) (<= (+ c_~a28~0 289060) (div .cse25 5)) (<= v_prenex_84 |c_old(~a28~0)|) (= 0 (mod .cse26 10)))))) (exists ((v_prenex_92 Int)) (let ((.cse28 (* 9 v_prenex_92))) (let ((.cse29 (div .cse28 10))) (let ((.cse27 (+ .cse29 1))) (and (not (= (mod .cse27 5) 0)) (<= (+ c_~a28~0 289059) (div .cse27 5)) (< .cse27 0) (< .cse28 0) (<= v_prenex_92 |c_old(~a28~0)|) (<= 0 .cse29) (< 37 v_prenex_92) (not (= 0 (mod .cse28 10))) (<= v_prenex_92 134)))))) (exists ((v_prenex_42 Int)) (let ((.cse30 (* 9 v_prenex_42))) (let ((.cse31 (div .cse30 10))) (let ((.cse32 (+ .cse31 1))) (and (not (= 0 (mod .cse30 10))) (<= 0 .cse31) (= (mod .cse32 5) 0) (<= v_prenex_42 37) (<= (+ c_~a28~0 289060) (div .cse32 5)) (<= v_prenex_42 |c_old(~a28~0)|) (< .cse30 0)))))) (exists ((v_prenex_98 Int)) (let ((.cse34 (* 9 v_prenex_98))) (let ((.cse35 (div .cse34 10))) (let ((.cse33 (+ .cse35 1))) (and (<= v_prenex_98 37) (<= v_prenex_98 |c_old(~a28~0)|) (not (= (mod .cse33 5) 0)) (<= 0 .cse34) (<= (+ c_~a28~0 289060) (div .cse35 5)) (< .cse33 0) (<= 0 .cse35)))))) (exists ((v_prenex_44 Int)) (let ((.cse36 (* 9 v_prenex_44))) (let ((.cse37 (div .cse36 10))) (let ((.cse38 (+ .cse37 1))) (and (<= 0 .cse36) (<= v_prenex_44 |c_old(~a28~0)|) (< 300 v_prenex_44) (<= (+ c_~a28~0 289059) (div .cse37 5)) (< .cse37 0) (< .cse38 0) (not (= 0 (mod .cse37 5))) (not (= (mod .cse38 5) 0))))))) (exists ((v_prenex_65 Int)) (let ((.cse41 (* 9 v_prenex_65))) (let ((.cse40 (div .cse41 10))) (let ((.cse39 (+ .cse40 1))) (and (not (= (mod .cse39 5) 0)) (< 37 v_prenex_65) (= 0 (mod .cse40 5)) (<= (+ c_~a28~0 289060) (div .cse40 5)) (<= 0 .cse41) (< .cse39 0) (<= v_prenex_65 |c_old(~a28~0)|) (<= v_prenex_65 134)))))) (exists ((v_prenex_48 Int)) (let ((.cse44 (* 9 v_prenex_48))) (let ((.cse42 (div .cse44 10))) (let ((.cse43 (+ .cse42 1))) (and (= 0 (mod .cse42 5)) (<= v_prenex_48 37) (<= (+ c_~a28~0 289060) (div .cse43 5)) (<= 0 .cse43) (not (= 0 (mod .cse44 10))) (< .cse44 0) (<= v_prenex_48 |c_old(~a28~0)|)))))) (exists ((v_prenex_54 Int)) (let ((.cse46 (* 9 v_prenex_54))) (let ((.cse45 (div .cse46 10))) (and (<= v_prenex_54 |c_old(~a28~0)|) (= (mod (+ .cse45 1) 5) 0) (<= 0 .cse46) (<= v_prenex_54 134) (< 37 v_prenex_54) (= 0 (mod .cse45 5)) (<= (+ c_~a28~0 289060) (div .cse45 5)))))) (exists ((v_prenex_76 Int)) (let ((.cse49 (* 9 v_prenex_76))) (let ((.cse48 (div .cse49 10))) (let ((.cse47 (+ .cse48 1))) (and (<= (+ c_~a28~0 289060) (div .cse47 5)) (<= 0 .cse48) (< 37 v_prenex_76) (<= 0 .cse47) (not (= 0 (mod .cse49 10))) (<= v_prenex_76 |c_old(~a28~0)|) (< .cse49 0) (<= v_prenex_76 134)))))) (exists ((v_prenex_95 Int)) (let ((.cse50 (* 9 v_prenex_95))) (let ((.cse51 (div .cse50 10))) (let ((.cse52 (+ .cse51 1))) (and (< .cse50 0) (not (= 0 (mod .cse50 10))) (<= v_prenex_95 |c_old(~a28~0)|) (<= 0 .cse51) (<= (+ c_~a28~0 289060) (div .cse52 5)) (< 300 v_prenex_95) (<= 0 .cse52)))))) (exists ((v_prenex_103 Int)) (let ((.cse54 (* 9 v_prenex_103))) (let ((.cse55 (div .cse54 10))) (let ((.cse53 (+ .cse55 1))) (and (< .cse53 0) (not (= 0 (mod .cse54 10))) (not (= (mod .cse53 5) 0)) (= 0 (mod .cse55 5)) (<= v_prenex_103 |c_old(~a28~0)|) (<= (+ c_~a28~0 289059) (div .cse53 5)) (< .cse54 0) (< 300 v_prenex_103)))))) (exists ((v_prenex_80 Int)) (let ((.cse57 (* 9 v_prenex_80))) (let ((.cse56 (div .cse57 10))) (and (not (= 0 (mod .cse56 5))) (< .cse56 0) (< 37 v_prenex_80) (<= (+ c_~a28~0 289059) (div .cse56 5)) (<= v_prenex_80 134) (<= v_prenex_80 |c_old(~a28~0)|) (= (mod (+ .cse56 1) 5) 0) (= 0 (mod .cse57 10)))))) (exists ((v_prenex_105 Int)) (let ((.cse59 (* 9 v_prenex_105))) (let ((.cse58 (div .cse59 10))) (and (< .cse58 0) (= 0 (mod .cse59 10)) (= (mod (+ .cse58 1) 5) 0) (<= (+ c_~a28~0 289059) (div .cse58 5)) (<= v_prenex_105 |c_old(~a28~0)|) (< 300 v_prenex_105) (not (= 0 (mod .cse58 5))))))) (exists ((v_prenex_73 Int)) (let ((.cse61 (* 9 v_prenex_73))) (let ((.cse60 (div .cse61 10))) (and (= (mod (+ .cse60 1) 5) 0) (<= v_prenex_73 |c_old(~a28~0)|) (<= (+ c_~a28~0 289059) (div .cse60 5)) (< .cse60 0) (not (= 0 (mod .cse60 5))) (< 300 v_prenex_73) (<= 0 .cse61))))) (exists ((v_prenex_107 Int)) (let ((.cse63 (* 9 v_prenex_107))) (let ((.cse62 (div .cse63 10))) (let ((.cse64 (+ .cse62 1))) (and (< 300 v_prenex_107) (< .cse62 0) (not (= 0 (mod .cse63 10))) (< .cse63 0) (<= (+ c_~a28~0 289060) (div .cse64 5)) (<= v_prenex_107 |c_old(~a28~0)|) (not (= 0 (mod .cse62 5))) (= (mod .cse64 5) 0)))))) (exists ((v_prenex_81 Int)) (let ((.cse66 (* 9 v_prenex_81))) (let ((.cse65 (div .cse66 10))) (and (<= (+ c_~a28~0 289060) (div .cse65 5)) (< 300 v_prenex_81) (<= 0 (+ .cse65 1)) (= 0 (mod .cse66 10)) (<= 0 .cse65) (<= v_prenex_81 |c_old(~a28~0)|))))) (exists ((v_prenex_40 Int)) (let ((.cse68 (* 9 v_prenex_40))) (let ((.cse67 (div .cse68 10))) (and (<= 0 .cse67) (<= v_prenex_40 |c_old(~a28~0)|) (<= v_prenex_40 37) (<= 0 .cse68) (<= 0 (+ .cse67 1)) (<= (+ c_~a28~0 289060) (div .cse67 5)))))) (exists ((v_prenex_102 Int)) (let ((.cse71 (* 9 v_prenex_102))) (let ((.cse69 (div .cse71 10))) (let ((.cse70 (+ .cse69 1))) (and (<= 0 .cse69) (<= v_prenex_102 |c_old(~a28~0)|) (<= v_prenex_102 37) (not (= (mod .cse70 5) 0)) (<= (+ c_~a28~0 289060) (div .cse69 5)) (= 0 (mod .cse71 10)) (< .cse70 0)))))) (exists ((v_prenex_108 Int)) (let ((.cse73 (* 9 v_prenex_108))) (let ((.cse74 (div .cse73 10))) (let ((.cse72 (+ .cse74 1))) (and (<= v_prenex_108 |c_old(~a28~0)|) (< 37 v_prenex_108) (not (= (mod .cse72 5) 0)) (< .cse73 0) (not (= 0 (mod .cse74 5))) (< .cse74 0) (< .cse72 0) (<= v_prenex_108 134) (not (= 0 (mod .cse73 10))) (<= (+ c_~a28~0 289059) (div .cse72 5))))))) (exists ((v_prenex_57 Int)) (let ((.cse77 (* 9 v_prenex_57))) (let ((.cse76 (div .cse77 10))) (let ((.cse75 (+ .cse76 1))) (and (not (= (mod .cse75 5) 0)) (= 0 (mod .cse76 5)) (<= 0 .cse77) (< .cse75 0) (<= v_prenex_57 37) (<= (+ c_~a28~0 289060) (div .cse76 5)) (<= v_prenex_57 |c_old(~a28~0)|)))))) (exists ((v_prenex_112 Int)) (let ((.cse78 (* 9 v_prenex_112))) (let ((.cse79 (div .cse78 10))) (and (<= v_prenex_112 37) (<= 0 .cse78) (<= v_prenex_112 |c_old(~a28~0)|) (<= (+ c_~a28~0 289060) (div .cse79 5)) (= (mod (+ .cse79 1) 5) 0) (= 0 (mod .cse79 5)))))) (exists ((v_~a28~0_1363 Int)) (let ((.cse82 (* 9 v_~a28~0_1363))) (let ((.cse81 (div .cse82 10))) (let ((.cse80 (+ .cse81 1))) (and (<= (+ c_~a28~0 289059) (div .cse80 5)) (not (= (mod .cse80 5) 0)) (< .cse80 0) (<= v_~a28~0_1363 134) (< 37 v_~a28~0_1363) (= 0 (mod .cse81 5)) (not (= 0 (mod .cse82 10))) (< .cse82 0) (<= v_~a28~0_1363 |c_old(~a28~0)|)))))) (exists ((v_prenex_63 Int)) (let ((.cse84 (* 9 v_prenex_63))) (let ((.cse83 (div .cse84 10))) (let ((.cse85 (+ .cse83 1))) (and (<= v_prenex_63 |c_old(~a28~0)|) (< .cse83 0) (= 0 (mod .cse84 10)) (<= (+ c_~a28~0 289059) (div .cse83 5)) (not (= 0 (mod .cse83 5))) (not (= (mod .cse85 5) 0)) (< 300 v_prenex_63) (< .cse85 0)))))) (exists ((v_prenex_69 Int)) (let ((.cse88 (* 9 v_prenex_69))) (let ((.cse86 (div .cse88 10))) (let ((.cse87 (+ .cse86 1))) (and (< .cse86 0) (<= (+ c_~a28~0 289060) (div .cse87 5)) (not (= 0 (mod .cse86 5))) (< .cse88 0) (< 300 v_prenex_69) (not (= 0 (mod .cse88 10))) (<= v_prenex_69 |c_old(~a28~0)|) (<= 0 .cse87)))))) (exists ((v_prenex_56 Int)) (let ((.cse89 (* 9 v_prenex_56))) (let ((.cse90 (div .cse89 10))) (and (<= v_prenex_56 |c_old(~a28~0)|) (= 0 (mod .cse89 10)) (= 0 (mod .cse90 5)) (<= (+ c_~a28~0 289060) (div .cse90 5)) (< 300 v_prenex_56) (<= 0 (+ .cse90 1)))))) (exists ((v_prenex_61 Int)) (let ((.cse92 (* 9 v_prenex_61))) (let ((.cse91 (div .cse92 10))) (and (<= v_prenex_61 |c_old(~a28~0)|) (<= v_prenex_61 134) (= 0 (mod .cse91 5)) (<= 0 (+ .cse91 1)) (= 0 (mod .cse92 10)) (<= (+ c_~a28~0 289060) (div .cse91 5)) (< 37 v_prenex_61))))) (exists ((v_prenex_71 Int)) (let ((.cse94 (* 9 v_prenex_71))) (let ((.cse95 (div .cse94 10))) (let ((.cse93 (+ .cse95 1))) (and (< .cse93 0) (not (= 0 (mod .cse94 10))) (<= v_prenex_71 37) (<= 0 .cse95) (<= v_prenex_71 |c_old(~a28~0)|) (<= (+ c_~a28~0 289059) (div .cse93 5)) (< .cse94 0) (not (= (mod .cse93 5) 0))))))) (exists ((v_prenex_96 Int)) (let ((.cse97 (* 9 v_prenex_96))) (let ((.cse96 (div .cse97 10))) (and (<= 0 .cse96) (<= (+ c_~a28~0 289060) (div .cse96 5)) (= (mod (+ .cse96 1) 5) 0) (< 37 v_prenex_96) (<= 0 .cse97) (<= v_prenex_96 134) (<= v_prenex_96 |c_old(~a28~0)|))))) (exists ((v_prenex_60 Int)) (let ((.cse99 (* 9 v_prenex_60))) (let ((.cse98 (div .cse99 10))) (and (< .cse98 0) (<= (+ c_~a28~0 289059) (div .cse98 5)) (<= v_prenex_60 |c_old(~a28~0)|) (<= 0 .cse99) (<= v_prenex_60 134) (= (mod (+ .cse98 1) 5) 0) (not (= 0 (mod .cse98 5))) (< 37 v_prenex_60))))) (exists ((v_prenex_93 Int)) (let ((.cse101 (* 9 v_prenex_93))) (let ((.cse102 (div .cse101 10))) (let ((.cse100 (+ .cse102 1))) (and (<= (+ c_~a28~0 289060) (div .cse100 5)) (not (= 0 (mod .cse101 10))) (<= v_prenex_93 |c_old(~a28~0)|) (<= v_prenex_93 134) (= 0 (mod .cse102 5)) (< 37 v_prenex_93) (<= 0 .cse100) (< .cse101 0)))))) (exists ((v_prenex_39 Int)) (let ((.cse105 (* 9 v_prenex_39))) (let ((.cse104 (div .cse105 10))) (let ((.cse103 (+ .cse104 1))) (and (<= (+ c_~a28~0 289060) (div .cse103 5)) (<= v_prenex_39 |c_old(~a28~0)|) (<= 0 .cse104) (< 300 v_prenex_39) (< .cse105 0) (= (mod .cse103 5) 0) (not (= 0 (mod .cse105 10)))))))) (exists ((v_prenex_66 Int)) (let ((.cse106 (* 9 v_prenex_66))) (let ((.cse108 (div .cse106 10))) (let ((.cse107 (+ .cse108 1))) (and (<= v_prenex_66 37) (not (= 0 (mod .cse106 10))) (< .cse106 0) (<= v_prenex_66 |c_old(~a28~0)|) (<= (+ c_~a28~0 289060) (div .cse107 5)) (<= 0 .cse108) (<= 0 .cse107)))))) (exists ((v_prenex_83 Int)) (let ((.cse109 (* 9 v_prenex_83))) (let ((.cse111 (div .cse109 10))) (let ((.cse110 (+ .cse111 1))) (and (<= v_prenex_83 |c_old(~a28~0)|) (not (= 0 (mod .cse109 10))) (< 300 v_prenex_83) (= (mod .cse110 5) 0) (<= (+ c_~a28~0 289060) (div .cse110 5)) (= 0 (mod .cse111 5)) (< .cse109 0)))))) (exists ((v_prenex_43 Int)) (let ((.cse113 (* 9 v_prenex_43))) (let ((.cse112 (div .cse113 10))) (and (= 0 (mod .cse112 5)) (<= (+ c_~a28~0 289060) (div .cse112 5)) (= 0 (mod .cse113 10)) (<= v_prenex_43 |c_old(~a28~0)|) (= (mod (+ .cse112 1) 5) 0) (< 300 v_prenex_43))))) (exists ((v_prenex_72 Int)) (let ((.cse116 (* 9 v_prenex_72))) (let ((.cse115 (div .cse116 10))) (let ((.cse114 (+ .cse115 1))) (and (<= v_prenex_72 |c_old(~a28~0)|) (not (= (mod .cse114 5) 0)) (< .cse114 0) (< .cse115 0) (< 37 v_prenex_72) (= 0 (mod .cse116 10)) (not (= 0 (mod .cse115 5))) (<= v_prenex_72 134) (<= (+ c_~a28~0 289059) (div .cse115 5))))))) (exists ((v_prenex_94 Int)) (let ((.cse117 (* 9 v_prenex_94))) (let ((.cse118 (div .cse117 10))) (and (<= 0 .cse117) (<= v_prenex_94 |c_old(~a28~0)|) (<= (+ c_~a28~0 289060) (div .cse118 5)) (< 300 v_prenex_94) (= (mod (+ .cse118 1) 5) 0) (= 0 (mod .cse118 5)))))) (exists ((v_prenex_41 Int)) (let ((.cse119 (* 9 v_prenex_41))) (let ((.cse120 (div .cse119 10))) (let ((.cse121 (+ .cse120 1))) (and (< 300 v_prenex_41) (< .cse119 0) (= 0 (mod .cse120 5)) (not (= 0 (mod .cse119 10))) (<= (+ c_~a28~0 289060) (div .cse121 5)) (<= 0 .cse121) (<= v_prenex_41 |c_old(~a28~0)|)))))) (exists ((v_prenex_33 Int)) (let ((.cse124 (* 9 v_prenex_33))) (let ((.cse122 (div .cse124 10))) (let ((.cse123 (+ .cse122 1))) (and (< .cse122 0) (<= v_prenex_33 |c_old(~a28~0)|) (<= 0 .cse123) (<= v_prenex_33 134) (not (= 0 (mod .cse124 10))) (< 37 v_prenex_33) (not (= 0 (mod .cse122 5))) (< .cse124 0) (<= (+ c_~a28~0 289060) (div .cse123 5))))))) (exists ((v_prenex_89 Int)) (let ((.cse126 (* 9 v_prenex_89))) (let ((.cse125 (div .cse126 10))) (let ((.cse127 (+ .cse125 1))) (and (<= v_prenex_89 37) (<= v_prenex_89 |c_old(~a28~0)|) (< .cse125 0) (not (= 0 (mod .cse125 5))) (<= (+ c_~a28~0 289059) (div .cse125 5)) (<= 0 .cse126) (not (= (mod .cse127 5) 0)) (< .cse127 0)))))) (exists ((v_prenex_52 Int)) (let ((.cse128 (* 9 v_prenex_52))) (let ((.cse130 (div .cse128 10))) (let ((.cse129 (+ .cse130 1))) (and (not (= 0 (mod .cse128 10))) (<= 0 .cse129) (< .cse130 0) (<= (+ c_~a28~0 289060) (div .cse129 5)) (not (= 0 (mod .cse130 5))) (<= v_prenex_52 37) (< .cse128 0) (<= v_prenex_52 |c_old(~a28~0)|)))))) (exists ((v_prenex_70 Int)) (let ((.cse132 (* 9 v_prenex_70))) (let ((.cse131 (div .cse132 10))) (and (<= v_prenex_70 134) (<= v_prenex_70 |c_old(~a28~0)|) (<= (+ c_~a28~0 289060) (div .cse131 5)) (= 0 (mod .cse132 10)) (<= 0 .cse131) (< 37 v_prenex_70) (= (mod (+ .cse131 1) 5) 0))))) (exists ((v_prenex_50 Int)) (let ((.cse134 (* 9 v_prenex_50))) (let ((.cse133 (div .cse134 10))) (and (<= (+ c_~a28~0 289059) (div .cse133 5)) (<= 0 .cse134) (<= v_prenex_50 |c_old(~a28~0)|) (<= v_prenex_50 37) (not (= 0 (mod .cse133 5))) (< .cse133 0) (<= 0 (+ .cse133 1)))))) (exists ((v_prenex_110 Int)) (let ((.cse136 (* 9 v_prenex_110))) (let ((.cse135 (div .cse136 10))) (and (< 300 v_prenex_110) (not (= 0 (mod .cse135 5))) (<= v_prenex_110 |c_old(~a28~0)|) (= 0 (mod .cse136 10)) (<= (+ c_~a28~0 289059) (div .cse135 5)) (< .cse135 0) (<= 0 (+ .cse135 1)))))) (exists ((v_prenex_86 Int)) (let ((.cse137 (* 9 v_prenex_86))) (let ((.cse138 (div .cse137 10))) (and (<= 0 .cse137) (<= v_prenex_86 134) (= 0 (mod .cse138 5)) (<= v_prenex_86 |c_old(~a28~0)|) (< 37 v_prenex_86) (<= (+ c_~a28~0 289060) (div .cse138 5)) (<= 0 (+ .cse138 1)))))) (exists ((v_prenex_53 Int)) (let ((.cse139 (* 9 v_prenex_53))) (let ((.cse140 (div .cse139 10))) (and (<= v_prenex_53 |c_old(~a28~0)|) (= 0 (mod .cse139 10)) (<= 0 (+ .cse140 1)) (<= v_prenex_53 37) (<= 0 .cse140) (<= (+ c_~a28~0 289060) (div .cse140 5)))))) (exists ((v_prenex_99 Int)) (let ((.cse143 (* 9 v_prenex_99))) (let ((.cse142 (div .cse143 10))) (let ((.cse141 (+ .cse142 1))) (and (<= v_prenex_99 37) (< .cse141 0) (<= v_prenex_99 |c_old(~a28~0)|) (not (= 0 (mod .cse142 5))) (not (= (mod .cse141 5) 0)) (< .cse143 0) (<= (+ c_~a28~0 289059) (div .cse141 5)) (not (= 0 (mod .cse143 10))) (< .cse142 0)))))) (exists ((v_prenex_34 Int)) (let ((.cse145 (* 9 v_prenex_34))) (let ((.cse146 (div .cse145 10))) (let ((.cse144 (+ .cse146 1))) (and (<= v_prenex_34 |c_old(~a28~0)|) (< 300 v_prenex_34) (not (= (mod .cse144 5) 0)) (<= 0 .cse145) (< .cse144 0) (= 0 (mod .cse146 5)) (<= (+ c_~a28~0 289060) (div .cse146 5))))))) (exists ((v_prenex_100 Int)) (let ((.cse149 (* 9 v_prenex_100))) (let ((.cse148 (div .cse149 10))) (let ((.cse147 (+ .cse148 1))) (and (<= v_prenex_100 134) (= (mod .cse147 5) 0) (<= v_prenex_100 |c_old(~a28~0)|) (= 0 (mod .cse148 5)) (< .cse149 0) (< 37 v_prenex_100) (not (= 0 (mod .cse149 10))) (<= (+ c_~a28~0 289060) (div .cse147 5))))))) (exists ((v_prenex_38 Int)) (let ((.cse151 (* 9 v_prenex_38))) (let ((.cse150 (div .cse151 10))) (and (= (mod (+ .cse150 1) 5) 0) (<= 0 .cse151) (not (= 0 (mod .cse150 5))) (<= v_prenex_38 37) (< .cse150 0) (<= v_prenex_38 |c_old(~a28~0)|) (<= (+ c_~a28~0 289059) (div .cse150 5)))))) (exists ((v_prenex_91 Int)) (let ((.cse152 (* 9 v_prenex_91))) (let ((.cse153 (div .cse152 10))) (and (< 37 v_prenex_91) (<= 0 .cse152) (<= 0 (+ .cse153 1)) (<= 0 .cse153) (<= v_prenex_91 134) (<= v_prenex_91 |c_old(~a28~0)|) (<= (+ c_~a28~0 289060) (div .cse153 5)))))) (exists ((v_prenex_62 Int)) (let ((.cse155 (* 9 v_prenex_62))) (let ((.cse154 (div .cse155 10))) (and (< .cse154 0) (not (= 0 (mod .cse154 5))) (< 300 v_prenex_62) (<= 0 (+ .cse154 1)) (<= v_prenex_62 |c_old(~a28~0)|) (<= 0 .cse155) (<= (+ c_~a28~0 289059) (div .cse154 5)))))) (exists ((v_prenex_67 Int)) (let ((.cse157 (* 9 v_prenex_67))) (let ((.cse158 (div .cse157 10))) (let ((.cse156 (+ .cse158 1))) (and (<= (+ c_~a28~0 289060) (div .cse156 5)) (= (mod .cse156 5) 0) (not (= 0 (mod .cse157 10))) (< .cse158 0) (<= v_prenex_67 37) (not (= 0 (mod .cse158 5))) (<= v_prenex_67 |c_old(~a28~0)|) (< .cse157 0)))))) (exists ((v_prenex_75 Int)) (let ((.cse160 (* 9 v_prenex_75))) (let ((.cse161 (div .cse160 10))) (let ((.cse159 (+ .cse161 1))) (and (not (= (mod .cse159 5) 0)) (< 37 v_prenex_75) (<= v_prenex_75 |c_old(~a28~0)|) (<= 0 .cse160) (<= (+ c_~a28~0 289059) (div .cse161 5)) (not (= 0 (mod .cse161 5))) (<= v_prenex_75 134) (< .cse159 0) (< .cse161 0)))))) (exists ((v_prenex_51 Int)) (let ((.cse164 (* 9 v_prenex_51))) (let ((.cse163 (div .cse164 10))) (let ((.cse162 (+ .cse163 1))) (and (<= (+ c_~a28~0 289059) (div .cse162 5)) (= 0 (mod .cse163 5)) (not (= 0 (mod .cse164 10))) (<= v_prenex_51 37) (< .cse162 0) (not (= (mod .cse162 5) 0)) (< .cse164 0) (<= v_prenex_51 |c_old(~a28~0)|)))))) (exists ((v_prenex_77 Int)) (let ((.cse166 (* 9 v_prenex_77))) (let ((.cse165 (div .cse166 10))) (and (<= (+ c_~a28~0 289060) (div .cse165 5)) (= 0 (mod .cse166 10)) (= 0 (mod .cse165 5)) (<= v_prenex_77 |c_old(~a28~0)|) (<= v_prenex_77 37) (<= 0 (+ .cse165 1)))))) (exists ((v_prenex_59 Int)) (let ((.cse167 (* 9 v_prenex_59))) (let ((.cse168 (div .cse167 10))) (let ((.cse169 (+ .cse168 1))) (and (not (= 0 (mod .cse167 10))) (<= v_prenex_59 |c_old(~a28~0)|) (= 0 (mod .cse168 5)) (< .cse167 0) (= (mod .cse169 5) 0) (<= (+ c_~a28~0 289060) (div .cse169 5)) (<= v_prenex_59 37)))))) (exists ((v_prenex_74 Int)) (let ((.cse171 (* 9 v_prenex_74))) (let ((.cse170 (div .cse171 10))) (and (<= (+ c_~a28~0 289060) (div .cse170 5)) (<= v_prenex_74 |c_old(~a28~0)|) (< 300 v_prenex_74) (<= 0 (+ .cse170 1)) (= 0 (mod .cse170 5)) (<= 0 .cse171))))) (exists ((v_prenex_37 Int)) (let ((.cse174 (* 9 v_prenex_37))) (let ((.cse173 (div .cse174 10))) (let ((.cse172 (+ .cse173 1))) (and (< .cse172 0) (<= 0 .cse173) (<= v_prenex_37 |c_old(~a28~0)|) (not (= 0 (mod .cse174 10))) (< 300 v_prenex_37) (< .cse174 0) (not (= (mod .cse172 5) 0)) (<= (+ c_~a28~0 289059) (div .cse172 5))))))) (exists ((v_prenex_97 Int)) (let ((.cse176 (* 9 v_prenex_97))) (let ((.cse175 (div .cse176 10))) (and (= (mod (+ .cse175 1) 5) 0) (<= v_prenex_97 |c_old(~a28~0)|) (<= 0 .cse175) (= 0 (mod .cse176 10)) (< 300 v_prenex_97) (<= (+ c_~a28~0 289060) (div .cse175 5)))))) (exists ((v_prenex_111 Int)) (let ((.cse178 (* 9 v_prenex_111))) (let ((.cse177 (div .cse178 10))) (and (<= v_prenex_111 134) (< 37 v_prenex_111) (<= 0 (+ .cse177 1)) (<= v_prenex_111 |c_old(~a28~0)|) (<= 0 .cse178) (not (= 0 (mod .cse177 5))) (<= (+ c_~a28~0 289059) (div .cse177 5)) (< .cse177 0))))) (exists ((v_prenex_104 Int)) (let ((.cse180 (* 9 v_prenex_104))) (let ((.cse179 (div .cse180 10))) (and (<= v_prenex_104 |c_old(~a28~0)|) (= (mod (+ .cse179 1) 5) 0) (<= (+ c_~a28~0 289059) (div .cse179 5)) (<= v_prenex_104 37) (not (= 0 (mod .cse179 5))) (= 0 (mod .cse180 10)) (< .cse179 0))))) (exists ((v_prenex_49 Int)) (let ((.cse182 (* 9 v_prenex_49))) (let ((.cse181 (div .cse182 10))) (and (<= v_prenex_49 |c_old(~a28~0)|) (not (= 0 (mod .cse181 5))) (<= v_prenex_49 37) (< .cse181 0) (<= 0 (+ .cse181 1)) (= 0 (mod .cse182 10)) (<= (+ c_~a28~0 289059) (div .cse181 5)))))) (exists ((v_prenex_87 Int)) (let ((.cse183 (* 9 v_prenex_87))) (let ((.cse184 (div .cse183 10))) (and (= 0 (mod .cse183 10)) (= (mod (+ .cse184 1) 5) 0) (<= v_prenex_87 37) (<= (+ c_~a28~0 289060) (div .cse184 5)) (<= v_prenex_87 |c_old(~a28~0)|) (<= 0 .cse184))))) (exists ((v_prenex_109 Int)) (let ((.cse187 (* 9 v_prenex_109))) (let ((.cse185 (div .cse187 10))) (let ((.cse186 (+ .cse185 1))) (and (< 300 v_prenex_109) (<= 0 .cse185) (not (= (mod .cse186 5) 0)) (< .cse186 0) (<= (+ c_~a28~0 289060) (div .cse185 5)) (<= v_prenex_109 |c_old(~a28~0)|) (<= 0 .cse187)))))) (exists ((v_prenex_45 Int)) (let ((.cse190 (* 9 v_prenex_45))) (let ((.cse188 (div .cse190 10))) (let ((.cse189 (+ .cse188 1))) (and (not (= 0 (mod .cse188 5))) (<= v_prenex_45 37) (< .cse188 0) (not (= (mod .cse189 5) 0)) (<= (+ c_~a28~0 289059) (div .cse188 5)) (<= v_prenex_45 |c_old(~a28~0)|) (= 0 (mod .cse190 10)) (< .cse189 0)))))) (exists ((v_prenex_79 Int)) (let ((.cse192 (* 9 v_prenex_79))) (let ((.cse191 (div .cse192 10))) (and (<= 0 .cse191) (<= (+ c_~a28~0 289060) (div .cse191 5)) (<= 0 (+ .cse191 1)) (<= 0 .cse192) (< 300 v_prenex_79) (<= v_prenex_79 |c_old(~a28~0)|))))) (exists ((v_prenex_85 Int)) (let ((.cse195 (* 9 v_prenex_85))) (let ((.cse193 (div .cse195 10))) (let ((.cse194 (+ .cse193 1))) (and (<= 0 .cse193) (< .cse194 0) (<= v_prenex_85 |c_old(~a28~0)|) (= 0 (mod .cse195 10)) (<= (+ c_~a28~0 289060) (div .cse193 5)) (not (= (mod .cse194 5) 0)) (< 300 v_prenex_85)))))) (exists ((v_prenex_82 Int)) (let ((.cse197 (* 9 v_prenex_82))) (let ((.cse198 (div .cse197 10))) (let ((.cse196 (+ .cse198 1))) (and (<= (+ c_~a28~0 289059) (div .cse196 5)) (< .cse197 0) (not (= 0 (mod .cse197 10))) (< 300 v_prenex_82) (not (= 0 (mod .cse198 5))) (<= v_prenex_82 |c_old(~a28~0)|) (< .cse196 0) (not (= (mod .cse196 5) 0)) (< .cse198 0)))))) (exists ((v_prenex_101 Int)) (let ((.cse200 (* 9 v_prenex_101))) (let ((.cse199 (div .cse200 10))) (and (<= (+ c_~a28~0 289060) (div .cse199 5)) (= 0 (mod .cse200 10)) (= 0 (mod .cse199 5)) (<= v_prenex_101 37) (= (mod (+ .cse199 1) 5) 0) (<= v_prenex_101 |c_old(~a28~0)|))))) (exists ((v_prenex_55 Int)) (let ((.cse202 (* 9 v_prenex_55))) (let ((.cse201 (div .cse202 10))) (let ((.cse203 (+ .cse201 1))) (and (<= 0 .cse201) (<= (+ c_~a28~0 289060) (div .cse201 5)) (= 0 (mod .cse202 10)) (<= v_prenex_55 134) (not (= (mod .cse203 5) 0)) (< .cse203 0) (<= v_prenex_55 |c_old(~a28~0)|) (< 37 v_prenex_55)))))) (exists ((v_prenex_35 Int)) (let ((.cse204 (* 9 v_prenex_35))) (let ((.cse206 (div .cse204 10))) (let ((.cse205 (+ .cse206 1))) (and (<= v_prenex_35 134) (= 0 (mod .cse204 10)) (< .cse205 0) (< 37 v_prenex_35) (not (= (mod .cse205 5) 0)) (<= v_prenex_35 |c_old(~a28~0)|) (= 0 (mod .cse206 5)) (<= (+ c_~a28~0 289060) (div .cse206 5)))))))) is different from false [2018-10-25 01:58:53,678 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_135 Int) (v_prenex_50 Int)) (let ((.cse1 (* 9 v_prenex_50)) (.cse3 (* 9 v_prenex_135))) (let ((.cse2 (div .cse3 10)) (.cse0 (div .cse1 10))) (and (<= (+ c_~a28~0 289059) (div .cse0 5)) (<= 0 .cse1) (<= v_prenex_50 (+ (mod .cse2 82) 210)) (<= v_prenex_50 37) (<= 0 .cse2) (not (= 0 (mod .cse0 5))) (< .cse0 0) (<= 0 (+ .cse0 1)) (<= 0 .cse3))))) (exists ((v_prenex_48 Int) (v_prenex_232 Int)) (let ((.cse6 (* 9 v_prenex_48))) (let ((.cse8 (* 9 v_prenex_232)) (.cse4 (div .cse6 10))) (let ((.cse5 (+ .cse4 1)) (.cse7 (div .cse8 10))) (and (= 0 (mod .cse4 5)) (<= v_prenex_48 37) (<= (+ c_~a28~0 289060) (div .cse5 5)) (<= 0 .cse5) (not (= 0 (mod .cse6 10))) (<= v_prenex_48 (+ (mod .cse7 82) 210)) (< .cse6 0) (<= 0 .cse7) (<= 0 .cse8)))))) (exists ((v_prenex_89 Int) (v_prenex_178 Int)) (let ((.cse10 (* 9 v_prenex_89))) (let ((.cse12 (* 9 v_prenex_178)) (.cse9 (div .cse10 10))) (let ((.cse11 (+ .cse9 1)) (.cse13 (div .cse12 10))) (and (<= v_prenex_89 37) (< .cse9 0) (not (= 0 (mod .cse9 5))) (<= (+ c_~a28~0 289059) (div .cse9 5)) (<= 0 .cse10) (not (= (mod .cse11 5) 0)) (<= 0 .cse12) (<= v_prenex_89 (+ (mod .cse13 82) 210)) (< .cse11 0) (<= 0 .cse13)))))) (exists ((v_prenex_102 Int) (v_prenex_272 Int)) (let ((.cse18 (* 9 v_prenex_102))) (let ((.cse15 (div .cse18 10)) (.cse16 (* 9 v_prenex_272))) (let ((.cse14 (div .cse16 10)) (.cse17 (+ .cse15 1))) (and (<= v_prenex_102 (+ (mod .cse14 82) 210)) (<= 0 .cse15) (<= v_prenex_102 37) (<= 0 .cse16) (not (= (mod .cse17 5) 0)) (<= 0 .cse14) (<= (+ c_~a28~0 289060) (div .cse15 5)) (= 0 (mod .cse18 10)) (< .cse17 0)))))) (exists ((v_prenex_275 Int) (v_prenex_80 Int)) (let ((.cse22 (* 9 v_prenex_80)) (.cse21 (* 9 v_prenex_275))) (let ((.cse19 (div .cse21 10)) (.cse20 (div .cse22 10))) (and (<= 0 .cse19) (not (= 0 (mod .cse20 5))) (< .cse20 0) (< 37 v_prenex_80) (<= (+ c_~a28~0 289059) (div .cse20 5)) (<= v_prenex_80 (+ (mod .cse19 82) 210)) (<= v_prenex_80 134) (<= 0 .cse21) (= (mod (+ .cse20 1) 5) 0) (= 0 (mod .cse22 10)))))) (exists ((v_prenex_220 Int) (v_prenex_41 Int)) (let ((.cse23 (* 9 v_prenex_41))) (let ((.cse26 (div .cse23 10)) (.cse25 (* 9 v_prenex_220))) (let ((.cse24 (div .cse25 10)) (.cse27 (+ .cse26 1))) (and (< 300 v_prenex_41) (< .cse23 0) (<= v_prenex_41 (+ (mod .cse24 82) 210)) (<= 0 .cse25) (<= 0 .cse24) (= 0 (mod .cse26 5)) (not (= 0 (mod .cse23 10))) (<= (+ c_~a28~0 289060) (div .cse27 5)) (<= 0 .cse27)))))) (exists ((v_prenex_43 Int) (v_prenex_305 Int)) (let ((.cse28 (* 9 v_prenex_305)) (.cse30 (* 9 v_prenex_43))) (let ((.cse29 (div .cse30 10)) (.cse31 (div .cse28 10))) (and (<= 0 .cse28) (= 0 (mod .cse29 5)) (<= (+ c_~a28~0 289060) (div .cse29 5)) (= 0 (mod .cse30 10)) (= (mod (+ .cse29 1) 5) 0) (< 300 v_prenex_43) (<= 0 .cse31) (<= v_prenex_43 (+ (mod .cse31 82) 210)))))) (exists ((v_prenex_106 Int) (v_prenex_257 Int)) (let ((.cse32 (* 9 v_prenex_257)) (.cse33 (* 9 v_prenex_106))) (let ((.cse34 (div .cse33 10)) (.cse35 (div .cse32 10))) (and (<= 0 .cse32) (<= 0 .cse33) (<= (+ c_~a28~0 289060) (div .cse34 5)) (<= v_prenex_106 (+ (mod .cse35 82) 210)) (<= v_prenex_106 37) (= 0 (mod .cse34 5)) (<= 0 (+ .cse34 1)) (<= 0 .cse35))))) (exists ((v_prenex_311 Int) (v_prenex_57 Int)) (let ((.cse38 (* 9 v_prenex_57))) (let ((.cse39 (* 9 v_prenex_311)) (.cse37 (div .cse38 10))) (let ((.cse36 (+ .cse37 1)) (.cse40 (div .cse39 10))) (and (not (= (mod .cse36 5) 0)) (= 0 (mod .cse37 5)) (<= 0 .cse38) (< .cse36 0) (<= v_prenex_57 37) (<= 0 .cse39) (<= 0 .cse40) (<= v_prenex_57 (+ (mod .cse40 82) 210)) (<= (+ c_~a28~0 289060) (div .cse37 5))))))) (exists ((v_prenex_88 Int) (v_~a28~0_1362 Int)) (let ((.cse45 (* 9 v_prenex_88))) (let ((.cse44 (div .cse45 10)) (.cse42 (* 9 v_~a28~0_1362))) (let ((.cse41 (div .cse42 10)) (.cse43 (+ .cse44 1))) (and (<= 0 .cse41) (< 300 v_prenex_88) (<= v_prenex_88 (+ (mod .cse41 82) 210)) (<= 0 .cse42) (< .cse43 0) (= 0 (mod .cse44 5)) (= 0 (mod .cse45 10)) (not (= (mod .cse43 5) 0)) (<= (+ c_~a28~0 289060) (div .cse44 5))))))) (exists ((v_prenex_35 Int) (v_prenex_290 Int)) (let ((.cse47 (* 9 v_prenex_35))) (let ((.cse50 (div .cse47 10)) (.cse49 (* 9 v_prenex_290))) (let ((.cse46 (div .cse49 10)) (.cse48 (+ .cse50 1))) (and (<= v_prenex_35 (+ (mod .cse46 82) 210)) (<= 0 .cse46) (<= v_prenex_35 134) (= 0 (mod .cse47 10)) (< .cse48 0) (< 37 v_prenex_35) (not (= (mod .cse48 5) 0)) (<= 0 .cse49) (= 0 (mod .cse50 5)) (<= (+ c_~a28~0 289060) (div .cse50 5))))))) (exists ((v_prenex_97 Int) (v_prenex_181 Int)) (let ((.cse53 (* 9 v_prenex_97)) (.cse54 (* 9 v_prenex_181))) (let ((.cse52 (div .cse54 10)) (.cse51 (div .cse53 10))) (and (= (mod (+ .cse51 1) 5) 0) (<= v_prenex_97 (+ (mod .cse52 82) 210)) (<= 0 .cse51) (= 0 (mod .cse53 10)) (<= 0 .cse52) (< 300 v_prenex_97) (<= 0 .cse54) (<= (+ c_~a28~0 289060) (div .cse51 5)))))) (exists ((v_prenex_79 Int) (v_prenex_118 Int)) (let ((.cse55 (* 9 v_prenex_118)) (.cse58 (* 9 v_prenex_79))) (let ((.cse57 (div .cse58 10)) (.cse56 (div .cse55 10))) (and (<= 0 .cse55) (<= 0 .cse56) (<= 0 .cse57) (<= (+ c_~a28~0 289060) (div .cse57 5)) (<= 0 (+ .cse57 1)) (<= v_prenex_79 (+ (mod .cse56 82) 210)) (<= 0 .cse58) (< 300 v_prenex_79))))) (exists ((v_prenex_77 Int) (v_prenex_293 Int)) (let ((.cse60 (* 9 v_prenex_293)) (.cse61 (* 9 v_prenex_77))) (let ((.cse59 (div .cse61 10)) (.cse62 (div .cse60 10))) (and (<= (+ c_~a28~0 289060) (div .cse59 5)) (<= 0 .cse60) (= 0 (mod .cse61 10)) (= 0 (mod .cse59 5)) (<= v_prenex_77 (+ (mod .cse62 82) 210)) (<= v_prenex_77 37) (<= 0 (+ .cse59 1)) (<= 0 .cse62))))) (exists ((v_prenex_66 Int) (v_prenex_187 Int)) (let ((.cse63 (* 9 v_prenex_66))) (let ((.cse67 (div .cse63 10)) (.cse64 (* 9 v_prenex_187))) (let ((.cse66 (div .cse64 10)) (.cse65 (+ .cse67 1))) (and (<= v_prenex_66 37) (not (= 0 (mod .cse63 10))) (< .cse63 0) (<= 0 .cse64) (<= (+ c_~a28~0 289060) (div .cse65 5)) (<= v_prenex_66 (+ (mod .cse66 82) 210)) (<= 0 .cse66) (<= 0 .cse67) (<= 0 .cse65)))))) (exists ((v_prenex_55 Int) (v_prenex_160 Int)) (let ((.cse70 (* 9 v_prenex_55))) (let ((.cse68 (div .cse70 10)) (.cse72 (* 9 v_prenex_160))) (let ((.cse69 (div .cse72 10)) (.cse71 (+ .cse68 1))) (and (<= 0 .cse68) (<= (+ c_~a28~0 289060) (div .cse68 5)) (<= 0 .cse69) (= 0 (mod .cse70 10)) (<= v_prenex_55 134) (not (= (mod .cse71 5) 0)) (<= v_prenex_55 (+ (mod .cse69 82) 210)) (< .cse71 0) (<= 0 .cse72) (< 37 v_prenex_55)))))) (exists ((v_prenex_39 Int) (v_prenex_241 Int)) (let ((.cse77 (* 9 v_prenex_39))) (let ((.cse74 (* 9 v_prenex_241)) (.cse76 (div .cse77 10))) (let ((.cse73 (+ .cse76 1)) (.cse75 (div .cse74 10))) (and (<= (+ c_~a28~0 289060) (div .cse73 5)) (<= 0 .cse74) (<= 0 .cse75) (<= 0 .cse76) (< 300 v_prenex_39) (< .cse77 0) (= (mod .cse73 5) 0) (<= v_prenex_39 (+ (mod .cse75 82) 210)) (not (= 0 (mod .cse77 10)))))))) (exists ((v_prenex_59 Int) (v_prenex_317 Int)) (let ((.cse78 (* 9 v_prenex_59))) (let ((.cse80 (div .cse78 10)) (.cse82 (* 9 v_prenex_317))) (let ((.cse79 (div .cse82 10)) (.cse81 (+ .cse80 1))) (and (not (= 0 (mod .cse78 10))) (<= 0 .cse79) (<= v_prenex_59 (+ (mod .cse79 82) 210)) (= 0 (mod .cse80 5)) (< .cse78 0) (= (mod .cse81 5) 0) (<= 0 .cse82) (<= (+ c_~a28~0 289060) (div .cse81 5)) (<= v_prenex_59 37)))))) (exists ((v_prenex_332 Int) (v_prenex_76 Int)) (let ((.cse87 (* 9 v_prenex_76))) (let ((.cse83 (* 9 v_prenex_332)) (.cse86 (div .cse87 10))) (let ((.cse84 (+ .cse86 1)) (.cse85 (div .cse83 10))) (and (<= 0 .cse83) (<= (+ c_~a28~0 289060) (div .cse84 5)) (<= v_prenex_76 (+ (mod .cse85 82) 210)) (<= 0 .cse86) (< 37 v_prenex_76) (<= 0 .cse84) (<= 0 .cse85) (not (= 0 (mod .cse87 10))) (< .cse87 0) (<= v_prenex_76 134)))))) (exists ((v_~a28~0_1363 Int) (v_prenex_344 Int)) (let ((.cse91 (* 9 v_~a28~0_1363))) (let ((.cse89 (* 9 v_prenex_344)) (.cse90 (div .cse91 10))) (let ((.cse88 (+ .cse90 1)) (.cse92 (div .cse89 10))) (and (<= (+ c_~a28~0 289059) (div .cse88 5)) (not (= (mod .cse88 5) 0)) (< .cse88 0) (<= 0 .cse89) (<= v_~a28~0_1363 134) (< 37 v_~a28~0_1363) (= 0 (mod .cse90 5)) (not (= 0 (mod .cse91 10))) (< .cse91 0) (<= 0 .cse92) (<= v_~a28~0_1363 (+ (mod .cse92 82) 210))))))) (exists ((v_prenex_214 Int) (v_prenex_47 Int)) (let ((.cse95 (* 9 v_prenex_214)) (.cse96 (* 9 v_prenex_47))) (let ((.cse93 (div .cse96 10)) (.cse94 (div .cse95 10))) (and (<= v_prenex_47 134) (<= (+ c_~a28~0 289060) (div .cse93 5)) (<= 0 .cse94) (< 37 v_prenex_47) (<= 0 .cse95) (<= 0 .cse93) (<= 0 (+ .cse93 1)) (= 0 (mod .cse96 10)) (<= v_prenex_47 (+ (mod .cse94 82) 210)))))) (exists ((v_prenex_46 Int) (v_prenex_166 Int)) (let ((.cse98 (* 9 v_prenex_46))) (let ((.cse97 (div .cse98 10)) (.cse99 (* 9 v_prenex_166))) (let ((.cse100 (div .cse99 10)) (.cse101 (+ .cse97 1))) (and (<= (+ c_~a28~0 289060) (div .cse97 5)) (= 0 (mod .cse98 10)) (<= v_prenex_46 37) (<= 0 .cse99) (<= 0 .cse100) (= 0 (mod .cse97 5)) (<= v_prenex_46 (+ (mod .cse100 82) 210)) (< .cse101 0) (not (= (mod .cse101 5) 0))))))) (exists ((v_prenex_64 Int) (v_prenex_193 Int)) (let ((.cse105 (* 9 v_prenex_193)) (.cse102 (* 9 v_prenex_64))) (let ((.cse104 (div .cse102 10)) (.cse103 (div .cse105 10))) (and (<= v_prenex_64 134) (= 0 (mod .cse102 10)) (<= 0 .cse103) (<= 0 (+ .cse104 1)) (<= 0 .cse105) (not (= 0 (mod .cse104 5))) (< 37 v_prenex_64) (< .cse104 0) (<= (+ c_~a28~0 289059) (div .cse104 5)) (<= v_prenex_64 (+ (mod .cse103 82) 210)))))) (exists ((v_prenex_269 Int) (v_prenex_74 Int)) (let ((.cse109 (* 9 v_prenex_74)) (.cse106 (* 9 v_prenex_269))) (let ((.cse108 (div .cse106 10)) (.cse107 (div .cse109 10))) (and (<= 0 .cse106) (<= (+ c_~a28~0 289060) (div .cse107 5)) (<= v_prenex_74 (+ (mod .cse108 82) 210)) (<= 0 .cse108) (< 300 v_prenex_74) (<= 0 (+ .cse107 1)) (= 0 (mod .cse107 5)) (<= 0 .cse109))))) (exists ((v_prenex_244 Int) (v_prenex_71 Int)) (let ((.cse112 (* 9 v_prenex_71))) (let ((.cse111 (* 9 v_prenex_244)) (.cse114 (div .cse112 10))) (let ((.cse110 (+ .cse114 1)) (.cse113 (div .cse111 10))) (and (< .cse110 0) (<= 0 .cse111) (not (= 0 (mod .cse112 10))) (<= v_prenex_71 (+ (mod .cse113 82) 210)) (<= v_prenex_71 37) (<= 0 .cse114) (<= (+ c_~a28~0 289059) (div .cse110 5)) (< .cse112 0) (not (= (mod .cse110 5) 0)) (<= 0 .cse113)))))) (exists ((v_prenex_254 Int) (v_prenex_95 Int)) (let ((.cse115 (* 9 v_prenex_95))) (let ((.cse118 (div .cse115 10)) (.cse117 (* 9 v_prenex_254))) (let ((.cse116 (div .cse117 10)) (.cse119 (+ .cse118 1))) (and (< .cse115 0) (not (= 0 (mod .cse115 10))) (<= v_prenex_95 (+ (mod .cse116 82) 210)) (<= 0 .cse117) (<= 0 .cse116) (<= 0 .cse118) (<= (+ c_~a28~0 289060) (div .cse119 5)) (< 300 v_prenex_95) (<= 0 .cse119)))))) (exists ((v_prenex_296 Int) (v_prenex_91 Int)) (let ((.cse120 (* 9 v_prenex_296)) (.cse121 (* 9 v_prenex_91))) (let ((.cse122 (div .cse121 10)) (.cse123 (div .cse120 10))) (and (< 37 v_prenex_91) (<= 0 .cse120) (<= 0 .cse121) (<= 0 (+ .cse122 1)) (<= 0 .cse122) (<= v_prenex_91 134) (<= 0 .cse123) (<= (+ c_~a28~0 289060) (div .cse122 5)) (<= v_prenex_91 (+ (mod .cse123 82) 210)))))) (exists ((v_prenex_105 Int) (v_prenex_284 Int)) (let ((.cse126 (* 9 v_prenex_105)) (.cse127 (* 9 v_prenex_284))) (let ((.cse125 (div .cse127 10)) (.cse124 (div .cse126 10))) (and (< .cse124 0) (<= 0 .cse125) (= 0 (mod .cse126 10)) (= (mod (+ .cse124 1) 5) 0) (<= (+ c_~a28~0 289059) (div .cse124 5)) (<= v_prenex_105 (+ (mod .cse125 82) 210)) (<= 0 .cse127) (< 300 v_prenex_105) (not (= 0 (mod .cse124 5))))))) (exists ((v_prenex_121 Int) (v_prenex_40 Int)) (let ((.cse130 (* 9 v_prenex_121)) (.cse129 (* 9 v_prenex_40))) (let ((.cse128 (div .cse129 10)) (.cse131 (div .cse130 10))) (and (<= 0 .cse128) (<= v_prenex_40 37) (<= 0 .cse129) (<= 0 .cse130) (<= 0 (+ .cse128 1)) (<= (+ c_~a28~0 289060) (div .cse128 5)) (<= v_prenex_40 (+ (mod .cse131 82) 210)) (<= 0 .cse131))))) (exists ((v_prenex_37 Int) (v_prenex_326 Int)) (let ((.cse135 (* 9 v_prenex_37))) (let ((.cse133 (div .cse135 10)) (.cse136 (* 9 v_prenex_326))) (let ((.cse134 (div .cse136 10)) (.cse132 (+ .cse133 1))) (and (< .cse132 0) (<= 0 .cse133) (<= 0 .cse134) (<= v_prenex_37 (+ (mod .cse134 82) 210)) (not (= 0 (mod .cse135 10))) (< 300 v_prenex_37) (< .cse135 0) (not (= (mod .cse132 5) 0)) (<= 0 .cse136) (<= (+ c_~a28~0 289059) (div .cse132 5))))))) (exists ((v_prenex_238 Int) (v_prenex_86 Int)) (let ((.cse137 (* 9 v_prenex_86)) (.cse138 (* 9 v_prenex_238))) (let ((.cse139 (div .cse138 10)) (.cse140 (div .cse137 10))) (and (<= 0 .cse137) (<= 0 .cse138) (<= v_prenex_86 134) (<= 0 .cse139) (<= v_prenex_86 (+ (mod .cse139 82) 210)) (= 0 (mod .cse140 5)) (< 37 v_prenex_86) (<= (+ c_~a28~0 289060) (div .cse140 5)) (<= 0 (+ .cse140 1)))))) (exists ((v_prenex_226 Int) (v_prenex_72 Int)) (let ((.cse145 (* 9 v_prenex_72))) (let ((.cse144 (* 9 v_prenex_226)) (.cse143 (div .cse145 10))) (let ((.cse142 (+ .cse143 1)) (.cse141 (div .cse144 10))) (and (<= 0 .cse141) (not (= (mod .cse142 5) 0)) (< .cse142 0) (< .cse143 0) (< 37 v_prenex_72) (<= 0 .cse144) (= 0 (mod .cse145 10)) (not (= 0 (mod .cse143 5))) (<= v_prenex_72 134) (<= v_prenex_72 (+ (mod .cse141 82) 210)) (<= (+ c_~a28~0 289059) (div .cse143 5))))))) (exists ((v_prenex_96 Int) (v_prenex_329 Int)) (let ((.cse149 (* 9 v_prenex_329)) (.cse148 (* 9 v_prenex_96))) (let ((.cse146 (div .cse148 10)) (.cse147 (div .cse149 10))) (and (<= 0 .cse146) (<= v_prenex_96 (+ (mod .cse147 82) 210)) (<= (+ c_~a28~0 289060) (div .cse146 5)) (= (mod (+ .cse146 1) 5) 0) (< 37 v_prenex_96) (<= 0 .cse148) (<= v_prenex_96 134) (<= 0 .cse147) (<= 0 .cse149))))) (exists ((v_prenex_235 Int) (v_prenex_100 Int)) (let ((.cse154 (* 9 v_prenex_100))) (let ((.cse152 (div .cse154 10)) (.cse150 (* 9 v_prenex_235))) (let ((.cse153 (div .cse150 10)) (.cse151 (+ .cse152 1))) (and (<= v_prenex_100 134) (<= 0 .cse150) (= (mod .cse151 5) 0) (= 0 (mod .cse152 5)) (<= v_prenex_100 (+ (mod .cse153 82) 210)) (< .cse154 0) (<= 0 .cse153) (< 37 v_prenex_100) (not (= 0 (mod .cse154 10))) (<= (+ c_~a28~0 289060) (div .cse151 5))))))) (exists ((v_prenex_172 Int) (v_prenex_109 Int)) (let ((.cse159 (* 9 v_prenex_109))) (let ((.cse157 (* 9 v_prenex_172)) (.cse155 (div .cse159 10))) (let ((.cse156 (+ .cse155 1)) (.cse158 (div .cse157 10))) (and (< 300 v_prenex_109) (<= 0 .cse155) (not (= (mod .cse156 5) 0)) (< .cse156 0) (<= 0 .cse157) (<= (+ c_~a28~0 289060) (div .cse155 5)) (<= v_prenex_109 (+ (mod .cse158 82) 210)) (<= 0 .cse158) (<= 0 .cse159)))))) (exists ((v_prenex_68 Int) (v_prenex_163 Int)) (let ((.cse161 (* 9 v_prenex_68))) (let ((.cse160 (div .cse161 10)) (.cse164 (* 9 v_prenex_163))) (let ((.cse162 (div .cse164 10)) (.cse163 (+ .cse160 1))) (and (< .cse160 0) (< 37 v_prenex_68) (< .cse161 0) (not (= 0 (mod .cse160 5))) (not (= 0 (mod .cse161 10))) (<= v_prenex_68 (+ (mod .cse162 82) 210)) (<= 0 .cse162) (= (mod .cse163 5) 0) (<= 0 .cse164) (<= v_prenex_68 134) (<= (+ c_~a28~0 289060) (div .cse163 5))))))) (exists ((v_prenex_92 Int) (v_prenex_190 Int)) (let ((.cse167 (* 9 v_prenex_92))) (let ((.cse166 (* 9 v_prenex_190)) (.cse169 (div .cse167 10))) (let ((.cse165 (+ .cse169 1)) (.cse168 (div .cse166 10))) (and (not (= (mod .cse165 5) 0)) (<= (+ c_~a28~0 289059) (div .cse165 5)) (< .cse165 0) (<= 0 .cse166) (< .cse167 0) (<= v_prenex_92 (+ (mod .cse168 82) 210)) (<= 0 .cse169) (<= 0 .cse168) (< 37 v_prenex_92) (not (= 0 (mod .cse167 10))) (<= v_prenex_92 134)))))) (exists ((v_prenex_302 Int) (v_prenex_78 Int)) (let ((.cse171 (* 9 v_prenex_78))) (let ((.cse173 (div .cse171 10)) (.cse174 (* 9 v_prenex_302))) (let ((.cse170 (div .cse174 10)) (.cse172 (+ .cse173 1))) (and (<= 0 .cse170) (not (= 0 (mod .cse171 10))) (= (mod .cse172 5) 0) (<= v_prenex_78 (+ (mod .cse170 82) 210)) (< .cse171 0) (<= (+ c_~a28~0 289060) (div .cse172 5)) (<= 0 .cse173) (<= v_prenex_78 134) (<= 0 .cse174) (< 37 v_prenex_78)))))) (exists ((v_prenex_208 Int) (v_prenex_108 Int)) (let ((.cse178 (* 9 v_prenex_108))) (let ((.cse179 (div .cse178 10)) (.cse175 (* 9 v_prenex_208))) (let ((.cse177 (div .cse175 10)) (.cse176 (+ .cse179 1))) (and (<= 0 .cse175) (< 37 v_prenex_108) (not (= (mod .cse176 5) 0)) (<= v_prenex_108 (+ (mod .cse177 82) 210)) (< .cse178 0) (not (= 0 (mod .cse179 5))) (< .cse179 0) (< .cse176 0) (<= v_prenex_108 134) (<= 0 .cse177) (not (= 0 (mod .cse178 10))) (<= (+ c_~a28~0 289059) (div .cse176 5))))))) (exists ((v_prenex_314 Int) (v_prenex_101 Int)) (let ((.cse182 (* 9 v_prenex_101)) (.cse183 (* 9 v_prenex_314))) (let ((.cse181 (div .cse183 10)) (.cse180 (div .cse182 10))) (and (<= (+ c_~a28~0 289060) (div .cse180 5)) (<= v_prenex_101 (+ (mod .cse181 82) 210)) (= 0 (mod .cse182 10)) (<= 0 .cse181) (= 0 (mod .cse180 5)) (<= 0 .cse183) (<= v_prenex_101 37) (= (mod (+ .cse180 1) 5) 0))))) (exists ((v_prenex_49 Int) (v_prenex_320 Int)) (let ((.cse187 (* 9 v_prenex_49)) (.cse186 (* 9 v_prenex_320))) (let ((.cse184 (div .cse186 10)) (.cse185 (div .cse187 10))) (and (<= 0 .cse184) (not (= 0 (mod .cse185 5))) (<= v_prenex_49 (+ (mod .cse184 82) 210)) (<= v_prenex_49 37) (< .cse185 0) (<= 0 (+ .cse185 1)) (<= 0 .cse186) (= 0 (mod .cse187 10)) (<= (+ c_~a28~0 289059) (div .cse185 5)))))) (exists ((v_prenex_199 Int) (v_prenex_85 Int)) (let ((.cse191 (* 9 v_prenex_85))) (let ((.cse189 (div .cse191 10)) (.cse192 (* 9 v_prenex_199))) (let ((.cse188 (div .cse192 10)) (.cse190 (+ .cse189 1))) (and (<= 0 .cse188) (<= v_prenex_85 (+ (mod .cse188 82) 210)) (<= 0 .cse189) (< .cse190 0) (= 0 (mod .cse191 10)) (<= (+ c_~a28~0 289060) (div .cse189 5)) (not (= (mod .cse190 5) 0)) (< 300 v_prenex_85) (<= 0 .cse192)))))) (exists ((v_prenex_335 Int) (v_prenex_70 Int)) (let ((.cse195 (* 9 v_prenex_70)) (.cse196 (* 9 v_prenex_335))) (let ((.cse193 (div .cse196 10)) (.cse194 (div .cse195 10))) (and (<= v_prenex_70 134) (<= 0 .cse193) (<= v_prenex_70 (+ (mod .cse193 82) 210)) (<= (+ c_~a28~0 289060) (div .cse194 5)) (= 0 (mod .cse195 10)) (<= 0 .cse196) (<= 0 .cse194) (< 37 v_prenex_70) (= (mod (+ .cse194 1) 5) 0))))) (exists ((v_prenex_211 Int) (v_prenex_58 Int)) (let ((.cse201 (* 9 v_prenex_58))) (let ((.cse198 (div .cse201 10)) (.cse200 (* 9 v_prenex_211))) (let ((.cse199 (div .cse200 10)) (.cse197 (+ .cse198 1))) (and (not (= (mod .cse197 5) 0)) (<= (+ c_~a28~0 289060) (div .cse198 5)) (<= 0 .cse199) (<= 0 .cse198) (< 37 v_prenex_58) (<= v_prenex_58 (+ (mod .cse199 82) 210)) (<= v_prenex_58 134) (< .cse197 0) (<= 0 .cse200) (<= 0 .cse201)))))) (exists ((v_prenex_138 Int) (v_prenex_51 Int)) (let ((.cse205 (* 9 v_prenex_51))) (let ((.cse204 (div .cse205 10)) (.cse206 (* 9 v_prenex_138))) (let ((.cse202 (div .cse206 10)) (.cse203 (+ .cse204 1))) (and (<= 0 .cse202) (<= (+ c_~a28~0 289059) (div .cse203 5)) (= 0 (mod .cse204 5)) (<= v_prenex_51 (+ (mod .cse202 82) 210)) (not (= 0 (mod .cse205 10))) (<= 0 .cse206) (<= v_prenex_51 37) (< .cse203 0) (not (= (mod .cse203 5) 0)) (< .cse205 0)))))) (exists ((v_prenex_341 Int) (v_prenex_60 Int)) (let ((.cse209 (* 9 v_prenex_60)) (.cse210 (* 9 v_prenex_341))) (let ((.cse207 (div .cse210 10)) (.cse208 (div .cse209 10))) (and (<= v_prenex_60 (+ (mod .cse207 82) 210)) (<= 0 .cse207) (< .cse208 0) (<= (+ c_~a28~0 289059) (div .cse208 5)) (<= 0 .cse209) (<= 0 .cse210) (<= v_prenex_60 134) (= (mod (+ .cse208 1) 5) 0) (not (= 0 (mod .cse208 5))) (< 37 v_prenex_60))))) (exists ((v_prenex_33 Int) (v_prenex_350 Int)) (let ((.cse215 (* 9 v_prenex_33))) (let ((.cse212 (* 9 v_prenex_350)) (.cse211 (div .cse215 10))) (let ((.cse214 (+ .cse211 1)) (.cse213 (div .cse212 10))) (and (< .cse211 0) (<= 0 .cse212) (<= v_prenex_33 (+ (mod .cse213 82) 210)) (<= 0 .cse214) (<= v_prenex_33 134) (not (= 0 (mod .cse215 10))) (< 37 v_prenex_33) (not (= 0 (mod .cse211 5))) (< .cse215 0) (<= (+ c_~a28~0 289060) (div .cse214 5)) (<= 0 .cse213)))))) (exists ((v_prenex_141 Int) (v_prenex_81 Int)) (let ((.cse218 (* 9 v_prenex_81)) (.cse219 (* 9 v_prenex_141))) (let ((.cse217 (div .cse219 10)) (.cse216 (div .cse218 10))) (and (<= (+ c_~a28~0 289060) (div .cse216 5)) (<= v_prenex_81 (+ (mod .cse217 82) 210)) (<= 0 .cse217) (< 300 v_prenex_81) (<= 0 (+ .cse216 1)) (= 0 (mod .cse218 10)) (<= 0 .cse216) (<= 0 .cse219))))) (exists ((v_prenex_63 Int) (v_prenex_260 Int)) (let ((.cse221 (* 9 v_prenex_63))) (let ((.cse220 (div .cse221 10)) (.cse224 (* 9 v_prenex_260))) (let ((.cse223 (div .cse224 10)) (.cse222 (+ .cse220 1))) (and (< .cse220 0) (= 0 (mod .cse221 10)) (<= (+ c_~a28~0 289059) (div .cse220 5)) (not (= 0 (mod .cse220 5))) (not (= (mod .cse222 5) 0)) (< 300 v_prenex_63) (<= 0 .cse223) (<= 0 .cse224) (<= v_prenex_63 (+ (mod .cse223 82) 210)) (< .cse222 0)))))) (exists ((v_prenex_299 Int) (v_prenex_107 Int)) (let ((.cse226 (* 9 v_prenex_107))) (let ((.cse229 (* 9 v_prenex_299)) (.cse225 (div .cse226 10))) (let ((.cse228 (+ .cse225 1)) (.cse227 (div .cse229 10))) (and (< 300 v_prenex_107) (< .cse225 0) (not (= 0 (mod .cse226 10))) (<= v_prenex_107 (+ (mod .cse227 82) 210)) (< .cse226 0) (<= (+ c_~a28~0 289060) (div .cse228 5)) (<= 0 .cse229) (not (= 0 (mod .cse225 5))) (= (mod .cse228 5) 0) (<= 0 .cse227)))))) (exists ((v_prenex_124 Int) (v_prenex_75 Int)) (let ((.cse232 (* 9 v_prenex_75))) (let ((.cse234 (div .cse232 10)) (.cse231 (* 9 v_prenex_124))) (let ((.cse233 (div .cse231 10)) (.cse230 (+ .cse234 1))) (and (not (= (mod .cse230 5) 0)) (< 37 v_prenex_75) (<= 0 .cse231) (<= 0 .cse232) (<= 0 .cse233) (<= (+ c_~a28~0 289059) (div .cse234 5)) (not (= 0 (mod .cse234 5))) (<= v_prenex_75 (+ (mod .cse233 82) 210)) (<= v_prenex_75 134) (< .cse230 0) (< .cse234 0)))))) (exists ((v_prenex_347 Int) (v_prenex_45 Int)) (let ((.cse239 (* 9 v_prenex_45))) (let ((.cse235 (div .cse239 10)) (.cse238 (* 9 v_prenex_347))) (let ((.cse237 (div .cse238 10)) (.cse236 (+ .cse235 1))) (and (not (= 0 (mod .cse235 5))) (<= v_prenex_45 37) (< .cse235 0) (not (= (mod .cse236 5) 0)) (<= v_prenex_45 (+ (mod .cse237 82) 210)) (<= (+ c_~a28~0 289059) (div .cse235 5)) (<= 0 .cse237) (<= 0 .cse238) (= 0 (mod .cse239 10)) (< .cse236 0)))))) (exists ((v_prenex_94 Int) (v_prenex_338 Int)) (let ((.cse241 (* 9 v_prenex_338)) (.cse240 (* 9 v_prenex_94))) (let ((.cse242 (div .cse240 10)) (.cse243 (div .cse241 10))) (and (<= 0 .cse240) (<= 0 .cse241) (<= (+ c_~a28~0 289060) (div .cse242 5)) (< 300 v_prenex_94) (= (mod (+ .cse242 1) 5) 0) (= 0 (mod .cse242 5)) (<= v_prenex_94 (+ (mod .cse243 82) 210)) (<= 0 .cse243))))) (exists ((v_prenex_202 Int) (v_prenex_87 Int)) (let ((.cse245 (* 9 v_prenex_87)) (.cse246 (* 9 v_prenex_202))) (let ((.cse244 (div .cse246 10)) (.cse247 (div .cse245 10))) (and (<= 0 .cse244) (= 0 (mod .cse245 10)) (<= 0 .cse246) (= (mod (+ .cse247 1) 5) 0) (<= v_prenex_87 37) (<= v_prenex_87 (+ (mod .cse244 82) 210)) (<= (+ c_~a28~0 289060) (div .cse247 5)) (<= 0 .cse247))))) (exists ((v_prenex_112 Int) (v_prenex_229 Int)) (let ((.cse248 (* 9 v_prenex_229)) (.cse250 (* 9 v_prenex_112))) (let ((.cse251 (div .cse250 10)) (.cse249 (div .cse248 10))) (and (<= 0 .cse248) (<= v_prenex_112 (+ (mod .cse249 82) 210)) (<= v_prenex_112 37) (<= 0 .cse250) (<= (+ c_~a28~0 289060) (div .cse251 5)) (= (mod (+ .cse251 1) 5) 0) (= 0 (mod .cse251 5)) (<= 0 .cse249))))) (exists ((v_prenex_115 Int) (v_prenex_56 Int)) (let ((.cse253 (* 9 v_prenex_56)) (.cse252 (* 9 v_prenex_115))) (let ((.cse255 (div .cse252 10)) (.cse254 (div .cse253 10))) (and (<= 0 .cse252) (= 0 (mod .cse253 10)) (= 0 (mod .cse254 5)) (<= (+ c_~a28~0 289060) (div .cse254 5)) (<= v_prenex_56 (+ (mod .cse255 82) 210)) (< 300 v_prenex_56) (<= 0 .cse255) (<= 0 (+ .cse254 1)))))) (exists ((v_prenex_99 Int) (v_prenex_287 Int)) (let ((.cse259 (* 9 v_prenex_99))) (let ((.cse258 (div .cse259 10)) (.cse260 (* 9 v_prenex_287))) (let ((.cse256 (div .cse260 10)) (.cse257 (+ .cse258 1))) (and (<= v_prenex_99 37) (<= 0 .cse256) (<= v_prenex_99 (+ (mod .cse256 82) 210)) (< .cse257 0) (not (= 0 (mod .cse258 5))) (not (= (mod .cse257 5) 0)) (< .cse259 0) (<= 0 .cse260) (<= (+ c_~a28~0 289059) (div .cse257 5)) (not (= 0 (mod .cse259 10))) (< .cse258 0)))))) (exists ((v_prenex_154 Int) (v_prenex_83 Int)) (let ((.cse261 (* 9 v_prenex_83))) (let ((.cse263 (* 9 v_prenex_154)) (.cse265 (div .cse261 10))) (let ((.cse264 (+ .cse265 1)) (.cse262 (div .cse263 10))) (and (not (= 0 (mod .cse261 10))) (<= 0 .cse262) (<= 0 .cse263) (< 300 v_prenex_83) (= (mod .cse264 5) 0) (<= (+ c_~a28~0 289060) (div .cse264 5)) (= 0 (mod .cse265 5)) (< .cse261 0) (<= v_prenex_83 (+ (mod .cse262 82) 210))))))) (exists ((v_prenex_148 Int) (v_prenex_69 Int)) (let ((.cse268 (* 9 v_prenex_69))) (let ((.cse270 (* 9 v_prenex_148)) (.cse266 (div .cse268 10))) (let ((.cse267 (+ .cse266 1)) (.cse269 (div .cse270 10))) (and (< .cse266 0) (<= (+ c_~a28~0 289060) (div .cse267 5)) (not (= 0 (mod .cse266 5))) (< .cse268 0) (< 300 v_prenex_69) (<= v_prenex_69 (+ (mod .cse269 82) 210)) (not (= 0 (mod .cse268 10))) (<= 0 .cse267) (<= 0 .cse269) (<= 0 .cse270)))))) (exists ((v_prenex_103 Int) (v_prenex_308 Int)) (let ((.cse273 (* 9 v_prenex_103))) (let ((.cse271 (* 9 v_prenex_308)) (.cse274 (div .cse273 10))) (let ((.cse272 (+ .cse274 1)) (.cse275 (div .cse271 10))) (and (<= 0 .cse271) (< .cse272 0) (not (= 0 (mod .cse273 10))) (not (= (mod .cse272 5) 0)) (= 0 (mod .cse274 5)) (<= (+ c_~a28~0 289059) (div .cse272 5)) (<= v_prenex_103 (+ (mod .cse275 82) 210)) (< .cse273 0) (<= 0 .cse275) (< 300 v_prenex_103)))))) (exists ((v_prenex_144 Int) (v_prenex_65 Int)) (let ((.cse278 (* 9 v_prenex_65))) (let ((.cse279 (* 9 v_prenex_144)) (.cse277 (div .cse278 10))) (let ((.cse276 (+ .cse277 1)) (.cse280 (div .cse279 10))) (and (not (= (mod .cse276 5) 0)) (< 37 v_prenex_65) (= 0 (mod .cse277 5)) (<= (+ c_~a28~0 289060) (div .cse277 5)) (<= 0 .cse278) (< .cse276 0) (<= 0 .cse279) (<= v_prenex_65 (+ (mod .cse280 82) 210)) (<= 0 .cse280) (<= v_prenex_65 134)))))) (exists ((v_prenex_90 Int) (v_prenex_266 Int)) (let ((.cse284 (* 9 v_prenex_90)) (.cse282 (* 9 v_prenex_266))) (let ((.cse283 (div .cse282 10)) (.cse281 (div .cse284 10))) (and (<= 0 .cse281) (= (mod (+ .cse281 1) 5) 0) (<= 0 .cse282) (<= 0 .cse283) (<= v_prenex_90 (+ (mod .cse283 82) 210)) (<= 0 .cse284) (<= (+ c_~a28~0 289060) (div .cse281 5)) (<= v_prenex_90 37))))) (exists ((v_prenex_278 Int) (v_prenex_53 Int)) (let ((.cse287 (* 9 v_prenex_278)) (.cse285 (* 9 v_prenex_53))) (let ((.cse286 (div .cse285 10)) (.cse288 (div .cse287 10))) (and (= 0 (mod .cse285 10)) (<= 0 (+ .cse286 1)) (<= 0 .cse287) (<= v_prenex_53 37) (<= 0 .cse286) (<= 0 .cse288) (<= (+ c_~a28~0 289060) (div .cse286 5)) (<= v_prenex_53 (+ (mod .cse288 82) 210)))))) (exists ((v_prenex_110 Int) (v_prenex_175 Int)) (let ((.cse291 (* 9 v_prenex_110)) (.cse292 (* 9 v_prenex_175))) (let ((.cse289 (div .cse292 10)) (.cse290 (div .cse291 10))) (and (<= 0 .cse289) (< 300 v_prenex_110) (not (= 0 (mod .cse290 5))) (= 0 (mod .cse291 10)) (<= (+ c_~a28~0 289059) (div .cse290 5)) (< .cse290 0) (<= v_prenex_110 (+ (mod .cse289 82) 210)) (<= 0 (+ .cse290 1)) (<= 0 .cse292))))) (exists ((v_prenex_44 Int) (v_prenex_263 Int)) (let ((.cse293 (* 9 v_prenex_44))) (let ((.cse295 (div .cse293 10)) (.cse297 (* 9 v_prenex_263))) (let ((.cse294 (div .cse297 10)) (.cse296 (+ .cse295 1))) (and (<= 0 .cse293) (<= v_prenex_44 (+ (mod .cse294 82) 210)) (< 300 v_prenex_44) (<= (+ c_~a28~0 289059) (div .cse295 5)) (< .cse295 0) (< .cse296 0) (<= 0 .cse294) (<= 0 .cse297) (not (= 0 (mod .cse295 5))) (not (= (mod .cse296 5) 0))))))) (exists ((v_prenex_253 Int) (v_prenex_111 Int)) (let ((.cse300 (* 9 v_prenex_111)) (.cse301 (* 9 v_prenex_253))) (let ((.cse298 (div .cse301 10)) (.cse299 (div .cse300 10))) (and (<= v_prenex_111 (+ (mod .cse298 82) 210)) (<= v_prenex_111 134) (< 37 v_prenex_111) (<= 0 .cse298) (<= 0 (+ .cse299 1)) (<= 0 .cse300) (not (= 0 (mod .cse299 5))) (<= (+ c_~a28~0 289059) (div .cse299 5)) (<= 0 .cse301) (< .cse299 0))))) (exists ((v_prenex_157 Int) (v_prenex_52 Int)) (let ((.cse303 (* 9 v_prenex_52))) (let ((.cse302 (* 9 v_prenex_157)) (.cse305 (div .cse303 10))) (let ((.cse304 (+ .cse305 1)) (.cse306 (div .cse302 10))) (and (<= 0 .cse302) (not (= 0 (mod .cse303 10))) (<= 0 .cse304) (< .cse305 0) (<= v_prenex_52 (+ (mod .cse306 82) 210)) (<= (+ c_~a28~0 289060) (div .cse304 5)) (not (= 0 (mod .cse305 5))) (<= v_prenex_52 37) (< .cse303 0) (<= 0 .cse306)))))) (exists ((v_prenex_84 Int) (v_prenex_129 Int)) (let ((.cse308 (* 9 v_prenex_129)) (.cse310 (* 9 v_prenex_84))) (let ((.cse307 (div .cse310 10)) (.cse309 (div .cse308 10))) (and (= 0 (mod .cse307 5)) (= (mod (+ .cse307 1) 5) 0) (<= 0 .cse308) (<= v_prenex_84 134) (< 37 v_prenex_84) (<= (+ c_~a28~0 289060) (div .cse307 5)) (<= v_prenex_84 (+ (mod .cse309 82) 210)) (<= 0 .cse309) (= 0 (mod .cse310 10)))))) (exists ((v_prenex_223 Int) (v_prenex_73 Int)) (let ((.cse314 (* 9 v_prenex_73)) (.cse313 (* 9 v_prenex_223))) (let ((.cse311 (div .cse313 10)) (.cse312 (div .cse314 10))) (and (<= v_prenex_73 (+ (mod .cse311 82) 210)) (= (mod (+ .cse312 1) 5) 0) (<= 0 .cse311) (<= 0 .cse313) (<= (+ c_~a28~0 289059) (div .cse312 5)) (< .cse312 0) (not (= 0 (mod .cse312 5))) (< 300 v_prenex_73) (<= 0 .cse314))))) (exists ((v_prenex_36 Int) (v_prenex_132 Int)) (let ((.cse317 (* 9 v_prenex_132)) (.cse318 (* 9 v_prenex_36))) (let ((.cse315 (div .cse318 10)) (.cse316 (div .cse317 10))) (and (<= (+ c_~a28~0 289060) (div .cse315 5)) (<= 0 .cse315) (<= v_prenex_36 (+ (mod .cse316 82) 210)) (= (mod (+ .cse315 1) 5) 0) (< 300 v_prenex_36) (<= 0 .cse316) (<= 0 .cse317) (<= 0 .cse318))))) (exists ((v_prenex_98 Int) (v_prenex_184 Int)) (let ((.cse321 (* 9 v_prenex_98))) (let ((.cse323 (* 9 v_prenex_184)) (.cse322 (div .cse321 10))) (let ((.cse320 (+ .cse322 1)) (.cse319 (div .cse323 10))) (and (<= v_prenex_98 (+ (mod .cse319 82) 210)) (<= v_prenex_98 37) (not (= (mod .cse320 5) 0)) (<= 0 .cse321) (<= (+ c_~a28~0 289060) (div .cse322 5)) (< .cse320 0) (<= 0 .cse323) (<= 0 .cse322) (<= 0 .cse319)))))) (exists ((v_prenex_169 Int) (v_prenex_62 Int)) (let ((.cse327 (* 9 v_prenex_62)) (.cse325 (* 9 v_prenex_169))) (let ((.cse326 (div .cse325 10)) (.cse324 (div .cse327 10))) (and (< .cse324 0) (<= 0 .cse325) (not (= 0 (mod .cse324 5))) (< 300 v_prenex_62) (<= 0 .cse326) (<= 0 (+ .cse324 1)) (<= v_prenex_62 (+ (mod .cse326 82) 210)) (<= 0 .cse327) (<= (+ c_~a28~0 289059) (div .cse324 5)))))) (exists ((v_prenex_38 Int) (v_prenex_281 Int)) (let ((.cse331 (* 9 v_prenex_38)) (.cse328 (* 9 v_prenex_281))) (let ((.cse330 (div .cse328 10)) (.cse329 (div .cse331 10))) (and (<= 0 .cse328) (= (mod (+ .cse329 1) 5) 0) (<= 0 .cse330) (<= 0 .cse331) (not (= 0 (mod .cse329 5))) (<= v_prenex_38 (+ (mod .cse330 82) 210)) (<= v_prenex_38 37) (< .cse329 0) (<= (+ c_~a28~0 289059) (div .cse329 5)))))) (exists ((v_prenex_127 Int) (v_prenex_34 Int)) (let ((.cse334 (* 9 v_prenex_34))) (let ((.cse336 (* 9 v_prenex_127)) (.cse335 (div .cse334 10))) (let ((.cse333 (+ .cse335 1)) (.cse332 (div .cse336 10))) (and (< 300 v_prenex_34) (<= v_prenex_34 (+ (mod .cse332 82) 210)) (not (= (mod .cse333 5) 0)) (<= 0 .cse334) (< .cse333 0) (= 0 (mod .cse335 5)) (<= 0 .cse336) (<= 0 .cse332) (<= (+ c_~a28~0 289060) (div .cse335 5))))))) (exists ((v_prenex_104 Int) (v_prenex_151 Int)) (let ((.cse338 (* 9 v_prenex_151)) (.cse339 (* 9 v_prenex_104))) (let ((.cse337 (div .cse339 10)) (.cse340 (div .cse338 10))) (and (= (mod (+ .cse337 1) 5) 0) (<= (+ c_~a28~0 289059) (div .cse337 5)) (<= v_prenex_104 37) (<= 0 .cse338) (not (= 0 (mod .cse337 5))) (= 0 (mod .cse339 10)) (<= v_prenex_104 (+ (mod .cse340 82) 210)) (< .cse337 0) (<= 0 .cse340))))) (exists ((v_prenex_196 Int) (v_prenex_93 Int)) (let ((.cse343 (* 9 v_prenex_93))) (let ((.cse344 (* 9 v_prenex_196)) (.cse345 (div .cse343 10))) (let ((.cse341 (+ .cse345 1)) (.cse342 (div .cse344 10))) (and (<= (+ c_~a28~0 289060) (div .cse341 5)) (<= v_prenex_93 (+ (mod .cse342 82) 210)) (not (= 0 (mod .cse343 10))) (<= v_prenex_93 134) (<= 0 .cse344) (= 0 (mod .cse345 5)) (< 37 v_prenex_93) (<= 0 .cse341) (< .cse343 0) (<= 0 .cse342)))))) (exists ((v_prenex_67 Int) (v_prenex_250 Int)) (let ((.cse347 (* 9 v_prenex_67))) (let ((.cse349 (* 9 v_prenex_250)) (.cse348 (div .cse347 10))) (let ((.cse346 (+ .cse348 1)) (.cse350 (div .cse349 10))) (and (<= (+ c_~a28~0 289060) (div .cse346 5)) (= (mod .cse346 5) 0) (not (= 0 (mod .cse347 10))) (< .cse348 0) (<= v_prenex_67 37) (not (= 0 (mod .cse348 5))) (<= 0 .cse349) (< .cse347 0) (<= 0 .cse350) (<= v_prenex_67 (+ (mod .cse350 82) 210))))))) (exists ((v_prenex_217 Int) (v_prenex_82 Int)) (let ((.cse352 (* 9 v_prenex_82))) (let ((.cse355 (* 9 v_prenex_217)) (.cse353 (div .cse352 10))) (let ((.cse351 (+ .cse353 1)) (.cse354 (div .cse355 10))) (and (<= (+ c_~a28~0 289059) (div .cse351 5)) (< .cse352 0) (not (= 0 (mod .cse352 10))) (< 300 v_prenex_82) (not (= 0 (mod .cse353 5))) (< .cse351 0) (not (= (mod .cse351 5) 0)) (< .cse353 0) (<= 0 .cse354) (<= 0 .cse355) (<= v_prenex_82 (+ (mod .cse354 82) 210))))))) (exists ((v_prenex_205 Int) (v_prenex_61 Int)) (let ((.cse359 (* 9 v_prenex_205)) (.cse358 (* 9 v_prenex_61))) (let ((.cse357 (div .cse358 10)) (.cse356 (div .cse359 10))) (and (<= v_prenex_61 134) (<= v_prenex_61 (+ (mod .cse356 82) 210)) (= 0 (mod .cse357 5)) (<= 0 (+ .cse357 1)) (= 0 (mod .cse358 10)) (<= (+ c_~a28~0 289060) (div .cse357 5)) (<= 0 .cse359) (<= 0 .cse356) (< 37 v_prenex_61))))) (exists ((v_prenex_247 Int) (v_prenex_42 Int)) (let ((.cse360 (* 9 v_prenex_42))) (let ((.cse364 (* 9 v_prenex_247)) (.cse361 (div .cse360 10))) (let ((.cse362 (+ .cse361 1)) (.cse363 (div .cse364 10))) (and (not (= 0 (mod .cse360 10))) (<= 0 .cse361) (= (mod .cse362 5) 0) (<= 0 .cse363) (<= v_prenex_42 37) (<= (+ c_~a28~0 289060) (div .cse362 5)) (<= 0 .cse364) (< .cse360 0) (<= v_prenex_42 (+ (mod .cse363 82) 210))))))) (exists ((v_prenex_323 Int) (v_prenex_54 Int)) (let ((.cse366 (* 9 v_prenex_54)) (.cse368 (* 9 v_prenex_323))) (let ((.cse367 (div .cse368 10)) (.cse365 (div .cse366 10))) (and (= (mod (+ .cse365 1) 5) 0) (<= 0 .cse366) (<= v_prenex_54 (+ (mod .cse367 82) 210)) (<= v_prenex_54 134) (<= 0 .cse367) (< 37 v_prenex_54) (= 0 (mod .cse365 5)) (<= 0 .cse368) (<= (+ c_~a28~0 289060) (div .cse365 5))))))) is different from false [2018-10-25 01:59:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 41 not checked. [2018-10-25 01:59:15,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:59:20,831 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 398 DAG size of output: 18 [2018-10-25 01:59:20,884 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 54 [2018-10-25 01:59:21,866 WARN L179 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 28 [2018-10-25 01:59:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 434 proven. 2 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-10-25 01:59:22,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:59:22,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 19 [2018-10-25 01:59:22,932 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:59:22,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 01:59:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 01:59:22,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=217, Unknown=5, NotChecked=62, Total=342 [2018-10-25 01:59:22,934 INFO L87 Difference]: Start difference. First operand 65970 states and 75472 transitions. Second operand 15 states. Received shutdown request... [2018-10-25 01:59:31,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-25 01:59:31,529 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 01:59:31,536 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 01:59:31,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 01:59:31 BoogieIcfgContainer [2018-10-25 01:59:31,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 01:59:31,537 INFO L168 Benchmark]: Toolchain (without parser) took 240280.22 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 187.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:59:31,538 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:59:31,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1557.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:59:31,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 475.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -932.1 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:59:31,540 INFO L168 Benchmark]: Boogie Preprocessor took 264.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2018-10-25 01:59:31,541 INFO L168 Benchmark]: RCFGBuilder took 11461.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 459.5 MB). Peak memory consumption was 459.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:59:31,542 INFO L168 Benchmark]: TraceAbstraction took 226516.48 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 3.8 GB in the end (delta: -2.1 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:59:31,547 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1557.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 475.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 779.1 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -932.1 MB). Peak memory consumption was 56.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 264.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11461.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 459.5 MB). Peak memory consumption was 459.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226516.48 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 3.8 GB in the end (delta: -2.1 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 122). Cancelled while BasicCegarLoop was constructing difference of abstraction (65970states) and FLOYD_HOARE automaton (currently 22 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (6220 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 226.4s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 116.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3508 SDtfs, 15964 SDslu, 2144 SDs, 0 SdLazy, 27295 SolverSat, 6775 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 105.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2864 GetRequests, 2758 SyntacticMatches, 13 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 71.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65970occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 3719 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 98.6s InterpolantComputationTime, 3581 NumberOfCodeBlocks, 3581 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4933 ConstructedInterpolants, 355 QuantifiedInterpolants, 131676180 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2417 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 4266/4626 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown