java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:01:09,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:01:09,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:01:09,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:01:09,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:01:09,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:01:09,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:01:09,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:01:09,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:01:09,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:01:09,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:01:09,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:01:09,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:01:09,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:01:09,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:01:09,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:01:09,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:01:09,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:01:09,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:01:09,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:01:09,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:01:09,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:01:09,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:01:09,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:01:09,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:01:09,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:01:09,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:01:09,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:01:09,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:01:09,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:01:09,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:01:09,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:01:09,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:01:09,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:01:09,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:01:09,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:01:09,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:01:09,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:01:09,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:01:09,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:01:09,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:01:09,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:01:09,762 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:01:09,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:01:09,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:01:09,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:01:09,767 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:01:09,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:01:09,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:01:09,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:01:09,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:01:09,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:01:09,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:01:09,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:01:09,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:01:09,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:01:09,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:01:09,769 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:01:09,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:01:09,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:01:09,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:01:09,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:01:09,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:01:09,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:01:09,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:01:09,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:01:09,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:01:09,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:01:09,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:01:09,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:01:09,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:01:10,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:01:10,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:01:10,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:01:10,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:01:10,140 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:01:10,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2019-10-15 03:01:10,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4574df64f/c5bbae19283b4645a5be2f9dc67ada06/FLAG6d93087a2 [2019-10-15 03:01:10,704 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:01:10,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2019-10-15 03:01:10,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4574df64f/c5bbae19283b4645a5be2f9dc67ada06/FLAG6d93087a2 [2019-10-15 03:01:11,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4574df64f/c5bbae19283b4645a5be2f9dc67ada06 [2019-10-15 03:01:11,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:01:11,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:01:11,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:11,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:01:11,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:01:11,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb457ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11, skipping insertion in model container [2019-10-15 03:01:11,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,148 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:01:11,164 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:01:11,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:11,339 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:01:11,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:01:11,367 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:01:11,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11 WrapperNode [2019-10-15 03:01:11,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:01:11,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:01:11,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:01:11,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:01:11,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... [2019-10-15 03:01:11,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:01:11,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:01:11,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:01:11,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:01:11,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:01:11,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:01:11,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:01:11,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:01:11,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:01:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:01:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:01:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-15 03:01:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:01:11,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:01:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:01:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:01:13,195 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:01:13,196 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:01:13,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:13 BoogieIcfgContainer [2019-10-15 03:01:13,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:01:13,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:01:13,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:01:13,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:01:13,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:01:11" (1/3) ... [2019-10-15 03:01:13,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a11d0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:13, skipping insertion in model container [2019-10-15 03:01:13,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:01:11" (2/3) ... [2019-10-15 03:01:13,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a11d0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:01:13, skipping insertion in model container [2019-10-15 03:01:13,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:01:13" (3/3) ... [2019-10-15 03:01:13,206 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_2-2.c [2019-10-15 03:01:13,214 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:01:13,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:01:13,230 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:01:13,255 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:01:13,255 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:01:13,255 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:01:13,255 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:01:13,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:01:13,256 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:01:13,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:01:13,256 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:01:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-15 03:01:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:01:13,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:13,282 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:13,283 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:13,290 INFO L82 PathProgramCache]: Analyzing trace with hash -114224221, now seen corresponding path program 1 times [2019-10-15 03:01:13,298 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:13,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081972583] [2019-10-15 03:01:13,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:13,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:13,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:13,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081972583] [2019-10-15 03:01:13,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:01:13,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:01:13,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257135561] [2019-10-15 03:01:13,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:01:13,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:13,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:01:13,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:01:13,746 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-10-15 03:01:15,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:15,896 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-15 03:01:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:01:15,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-15 03:01:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:15,906 INFO L225 Difference]: With dead ends: 36 [2019-10-15 03:01:15,906 INFO L226 Difference]: Without dead ends: 13 [2019-10-15 03:01:15,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:01:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-15 03:01:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-15 03:01:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-15 03:01:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-10-15 03:01:15,944 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-10-15 03:01:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:15,945 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-10-15 03:01:15,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:01:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-10-15 03:01:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:01:15,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:01:15,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:01:15,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:01:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:01:15,947 INFO L82 PathProgramCache]: Analyzing trace with hash 813565743, now seen corresponding path program 1 times [2019-10-15 03:01:15,947 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:01:15,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662990992] [2019-10-15 03:01:15,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:15,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:01:15,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:01:15,954 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-15 03:01:15,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769143221] [2019-10-15 03:01:15,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:01:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:01:15,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 03:01:15,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:01:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:01:16,047 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:01:16,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:01:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:01:17,273 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse51 (mod c_main_~x~0 4294967296))) (let ((.cse3 (forall ((v_prenex_1 Int)) (let ((.cse95 (mod v_prenex_1 4294967296)) (.cse97 (mod c_main_~x~0 4294967296))) (let ((.cse96 (mod (+ c_main_~x~0 1) 4294967296)) (.cse98 (div .cse95 .cse97))) (or (= .cse95 .cse96) (<= .cse95 .cse97) (< .cse96 .cse95) (< .cse95 0) (< .cse97 (mod (+ .cse98 1) 4294967296)) (< .cse97 (mod .cse98 4294967296))))))) (.cse1 (forall ((v_prenex_1 Int)) (let ((.cse93 (mod v_prenex_1 4294967296)) (.cse91 (mod c_main_~x~0 4294967296))) (let ((.cse94 (mod (+ c_main_~x~0 1) 4294967296)) (.cse92 (div .cse93 .cse91))) (or (< .cse91 (mod (+ .cse92 4294967295) 4294967296)) (= .cse93 .cse94) (<= .cse93 .cse91) (< .cse94 .cse93) (< .cse93 0) (< .cse91 (mod (+ .cse92 1) 4294967296)) (< .cse91 (mod .cse92 4294967296))))))) (.cse33 (forall ((main_~y~0 Int)) (let ((.cse88 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse90 (mod c_main_~x~0 4294967296)) (.cse89 (mod main_~y~0 4294967296))) (or (< .cse88 .cse89) (<= (mod (div .cse89 .cse90) 4294967296) .cse90) (= .cse89 .cse88) (not (= (mod .cse89 .cse90) 0)) (<= .cse89 .cse90) (< .cse89 0))))) (.cse17 (forall ((v_prenex_1 Int)) (let ((.cse86 (mod v_prenex_1 4294967296)) (.cse84 (mod c_main_~x~0 4294967296))) (let ((.cse87 (mod (+ c_main_~x~0 1) 4294967296)) (.cse85 (div .cse86 .cse84))) (or (< .cse84 (mod (+ .cse85 4294967295) 4294967296)) (= .cse86 .cse87) (<= .cse86 .cse84) (< .cse87 .cse86) (< .cse86 0) (< .cse84 (mod .cse85 4294967296))))))) (.cse24 (forall ((v_prenex_1 Int)) (let ((.cse80 (mod v_prenex_1 4294967296)) (.cse82 (mod c_main_~x~0 4294967296))) (let ((.cse81 (mod (+ c_main_~x~0 1) 4294967296)) (.cse83 (div .cse80 .cse82))) (or (= .cse80 .cse81) (<= .cse80 .cse82) (< .cse81 .cse80) (< .cse82 (mod (+ .cse83 1) 4294967296)) (not (= (mod .cse80 .cse82) 0)) (< .cse82 (mod .cse83 4294967296))))))) (.cse18 (forall ((v_prenex_1 Int)) (let ((.cse78 (mod v_prenex_1 4294967296)) (.cse76 (mod c_main_~x~0 4294967296))) (let ((.cse79 (mod (+ c_main_~x~0 1) 4294967296)) (.cse77 (div .cse78 .cse76))) (or (< .cse76 (mod (+ .cse77 4294967295) 4294967296)) (= .cse78 .cse79) (<= .cse78 .cse76) (< .cse79 .cse78) (< .cse76 (mod (+ .cse77 1) 4294967296)) (not (= (mod .cse78 .cse76) 0)) (< .cse76 (mod .cse77 4294967296))))))) (.cse4 (forall ((v_prenex_1 Int)) (let ((.cse74 (mod v_prenex_1 4294967296)) (.cse72 (mod c_main_~x~0 4294967296))) (let ((.cse75 (mod (+ c_main_~x~0 1) 4294967296)) (.cse73 (div .cse74 .cse72))) (or (< .cse72 (mod (+ .cse73 4294967295) 4294967296)) (= .cse74 .cse75) (<= .cse74 .cse72) (< .cse75 .cse74) (< .cse72 (mod (+ .cse73 1) 4294967296)) (< .cse72 (mod .cse73 4294967296))))))) (.cse12 (forall ((v_prenex_1 Int)) (let ((.cse70 (mod (+ c_main_~x~0 1) 4294967296)) (.cse69 (mod v_prenex_1 4294967296)) (.cse71 (mod c_main_~x~0 4294967296))) (or (= .cse69 .cse70) (<= .cse69 .cse71) (< .cse70 .cse69) (< .cse69 0) (not (= (mod .cse69 .cse71) 0)) (< .cse71 (mod (div .cse69 .cse71) 4294967296)))))) (.cse28 (forall ((v_prenex_1 Int)) (let ((.cse67 (mod (+ c_main_~x~0 1) 4294967296)) (.cse66 (mod v_prenex_1 4294967296)) (.cse68 (mod c_main_~x~0 4294967296))) (or (= .cse66 .cse67) (<= .cse66 .cse68) (< .cse67 .cse66) (not (= (mod .cse66 .cse68) 0)) (< .cse68 (mod (div .cse66 .cse68) 4294967296)))))) (.cse23 (forall ((v_prenex_1 Int)) (let ((.cse64 (mod v_prenex_1 4294967296)) (.cse62 (mod c_main_~x~0 4294967296))) (let ((.cse65 (mod (+ c_main_~x~0 1) 4294967296)) (.cse63 (div .cse64 .cse62))) (or (< .cse62 (mod (+ .cse63 4294967295) 4294967296)) (= .cse64 .cse65) (<= .cse64 .cse62) (< .cse65 .cse64) (not (= (mod .cse64 .cse62) 0)) (< .cse62 (mod .cse63 4294967296))))))) (.cse7 (forall ((v_prenex_1 Int)) (let ((.cse58 (mod v_prenex_1 4294967296)) (.cse59 (mod c_main_~x~0 4294967296))) (let ((.cse61 (mod (+ c_main_~x~0 1) 4294967296)) (.cse60 (div .cse58 .cse59))) (or (<= 0 .cse58) (< .cse59 (mod (+ .cse60 4294967295) 4294967296)) (= .cse58 .cse61) (<= .cse58 .cse59) (< .cse61 .cse58) (= (mod .cse58 .cse59) 0) (< .cse59 (mod (+ .cse60 1) 4294967296)) (< .cse59 (mod .cse60 4294967296))))))) (.cse5 (< .cse51 0)) (.cse6 (forall ((main_~y~0 Int)) (let ((.cse55 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse56 (mod main_~y~0 4294967296)) (.cse57 (mod c_main_~x~0 4294967296))) (or (< .cse55 .cse56) (<= (mod (div .cse56 .cse57) 4294967296) .cse57) (= .cse56 .cse55) (not (= (mod .cse56 .cse57) 0)) (<= .cse56 .cse57))))) (.cse41 (forall ((main_~y~0 Int)) (let ((.cse52 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse54 (mod c_main_~x~0 4294967296)) (.cse53 (mod main_~y~0 4294967296))) (or (< .cse52 .cse53) (<= (mod (div .cse53 .cse54) 4294967296) .cse54) (= .cse53 .cse52) (<= .cse53 .cse54) (< .cse53 0))))) (.cse0 (<= 0 .cse51)) (.cse2 (forall ((v_prenex_1 Int)) (let ((.cse49 (mod (+ c_main_~x~0 1) 4294967296)) (.cse48 (mod v_prenex_1 4294967296)) (.cse50 (mod c_main_~x~0 4294967296))) (or (= .cse48 .cse49) (<= .cse48 .cse50) (< .cse49 .cse48) (< .cse48 0) (< .cse50 (mod (div .cse48 .cse50) 4294967296))))))) (and (or .cse0 .cse1) (or .cse0 .cse2) .cse3 (or .cse0 .cse4) (or .cse5 .cse6) .cse7 (or .cse5 .cse4) (or .cse0 (forall ((v_prenex_1 Int)) (let ((.cse10 (mod v_prenex_1 4294967296)) (.cse8 (mod c_main_~x~0 4294967296))) (let ((.cse11 (mod (+ c_main_~x~0 1) 4294967296)) (.cse9 (div .cse10 .cse8))) (or (< .cse8 (mod (+ .cse9 4294967295) 4294967296)) (= .cse10 .cse11) (<= .cse10 .cse8) (< .cse11 .cse10) (< .cse8 (mod .cse9 4294967296))))))) .cse12 (forall ((v_prenex_1 Int)) (let ((.cse13 (mod v_prenex_1 4294967296)) (.cse15 (mod c_main_~x~0 4294967296))) (let ((.cse14 (mod (+ c_main_~x~0 1) 4294967296)) (.cse16 (div .cse13 .cse15))) (or (= .cse13 .cse14) (<= .cse13 .cse15) (< .cse14 .cse13) (< .cse13 0) (< .cse15 (mod (+ .cse16 1) 4294967296)) (not (= (mod .cse13 .cse15) 0)) (< .cse15 (mod .cse16 4294967296)))))) .cse17 (or .cse0 .cse18) (forall ((v_prenex_1 Int)) (let ((.cse19 (mod v_prenex_1 4294967296)) (.cse20 (mod c_main_~x~0 4294967296))) (let ((.cse22 (mod (+ c_main_~x~0 1) 4294967296)) (.cse21 (div .cse19 .cse20))) (or (<= 0 .cse19) (< .cse20 (mod (+ .cse21 4294967295) 4294967296)) (= .cse19 .cse22) (<= .cse19 .cse20) (< .cse22 .cse19) (= (mod .cse19 .cse20) 0) (< .cse20 (mod (+ .cse21 1) 4294967296)))))) (or .cse3 .cse5) (or .cse7 .cse0) (or .cse23 .cse0) (or .cse5 .cse24) (or (forall ((v_prenex_1 Int)) (let ((.cse26 (mod (+ c_main_~x~0 1) 4294967296)) (.cse25 (mod v_prenex_1 4294967296)) (.cse27 (mod c_main_~x~0 4294967296))) (or (<= 0 .cse25) (= .cse25 .cse26) (<= .cse25 .cse27) (< .cse26 .cse25) (= (mod .cse25 .cse27) 0) (< .cse27 (mod (+ (div .cse25 .cse27) 1) 4294967296))))) .cse5) (or .cse0 .cse28) .cse1 (or .cse5 .cse2) (or (forall ((v_prenex_1 Int)) (let ((.cse29 (mod v_prenex_1 4294967296)) (.cse31 (mod c_main_~x~0 4294967296))) (let ((.cse30 (mod (+ c_main_~x~0 1) 4294967296)) (.cse32 (div .cse29 .cse31))) (or (= .cse29 .cse30) (<= .cse29 .cse31) (< .cse30 .cse29) (< .cse31 (mod (+ .cse32 1) 4294967296)) (< .cse31 (mod .cse32 4294967296)))))) .cse5) (or .cse0 .cse33) (or .cse0 (forall ((main_~y~0 Int)) (let ((.cse35 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse34 (mod main_~y~0 4294967296)) (.cse36 (mod c_main_~x~0 4294967296))) (or (<= 0 .cse34) (< .cse35 .cse34) (= (mod .cse34 .cse36) 0) (= .cse34 .cse35) (<= (mod (+ (div .cse34 .cse36) 4294967295) 4294967296) .cse36) (<= .cse34 .cse36))))) (or .cse5 (forall ((v_prenex_1 Int)) (let ((.cse37 (mod v_prenex_1 4294967296)) (.cse39 (mod c_main_~x~0 4294967296))) (let ((.cse38 (mod (+ c_main_~x~0 1) 4294967296)) (.cse40 (div .cse37 .cse39))) (or (<= 0 .cse37) (= .cse37 .cse38) (<= .cse37 .cse39) (< .cse38 .cse37) (= (mod .cse37 .cse39) 0) (< .cse39 (mod (+ .cse40 1) 4294967296)) (< .cse39 (mod .cse40 4294967296))))))) (or .cse5 .cse33) (or .cse17 .cse0) .cse28 .cse24 .cse18 .cse4 (or .cse0 .cse12) (or .cse28 .cse5) (or .cse41 .cse5) (or (forall ((main_~y~0 Int)) (let ((.cse43 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse42 (mod main_~y~0 4294967296)) (.cse44 (mod c_main_~x~0 4294967296))) (or (<= 0 .cse42) (< .cse43 .cse42) (= (mod .cse42 .cse44) 0) (= .cse42 .cse43) (<= (mod (+ (div .cse42 .cse44) 1) 4294967296) .cse44) (<= .cse42 .cse44)))) .cse5) .cse23 (or .cse7 .cse5) (or .cse0 .cse6) (or .cse0 (forall ((v_prenex_1 Int)) (let ((.cse47 (mod (+ c_main_~x~0 1) 4294967296)) (.cse45 (mod v_prenex_1 4294967296)) (.cse46 (mod c_main_~x~0 4294967296))) (or (<= 0 .cse45) (< .cse46 (mod (+ (div .cse45 .cse46) 4294967295) 4294967296)) (= .cse45 .cse47) (<= .cse45 .cse46) (< .cse47 .cse45) (= (mod .cse45 .cse46) 0))))) (or .cse41 .cse0) .cse2))) is different from true [2019-10-15 03:01:19,363 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse148 (mod c_main_~x~0 4294967296))) (let ((.cse3 (<= 0 .cse148)) (.cse11 (< .cse148 0))) (and (or (forall ((v_prenex_37 Int)) (let ((.cse1 (mod c_main_~x~0 4294967296)) (.cse0 (mod v_prenex_37 4294967296)) (.cse2 (mod (* c_main_~x~0 c_main_~x~0) 4294967296))) (or (<= .cse0 .cse1) (<= (mod (div .cse0 .cse1) 4294967296) .cse1) (< .cse2 .cse0) (not (= (mod .cse0 .cse1) 0)) (= .cse0 .cse2)))) .cse3) (or .cse3 (forall ((v_prenex_1 Int)) (let ((.cse6 (mod v_prenex_1 4294967296)) (.cse4 (mod c_main_~x~0 4294967296))) (let ((.cse7 (mod (+ c_main_~x~0 1) 4294967296)) (.cse5 (div .cse6 .cse4))) (or (< .cse4 (mod (+ .cse5 4294967295) 4294967296)) (= .cse6 .cse7) (<= .cse6 .cse4) (< .cse7 .cse6) (< .cse6 0) (< .cse4 (mod (+ .cse5 1) 4294967296)) (< .cse4 (mod .cse5 4294967296))))))) (or (forall ((v_prenex_32 Int)) (let ((.cse9 (mod c_main_~x~0 4294967296)) (.cse8 (mod v_prenex_32 4294967296)) (.cse10 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (= (mod .cse8 .cse9) 0)) (<= .cse8 .cse9) (< .cse9 (mod (div .cse8 .cse9) 4294967296)) (< .cse10 .cse8) (= .cse8 .cse10)))) .cse11) (or .cse11 (forall ((main_~y~0 Int)) (let ((.cse12 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse13 (mod main_~y~0 4294967296)) (.cse14 (mod c_main_~x~0 4294967296))) (or (< .cse12 .cse13) (<= (mod (div .cse13 .cse14) 4294967296) .cse14) (= .cse13 .cse12) (not (= (mod .cse13 .cse14) 0)) (<= .cse13 .cse14))))) (forall ((v_prenex_5 Int)) (let ((.cse15 (mod v_prenex_5 4294967296)) (.cse17 (mod c_main_~x~0 4294967296))) (let ((.cse16 (mod (+ c_main_~x~0 1) 4294967296)) (.cse18 (div .cse15 .cse17))) (or (<= 0 .cse15) (= .cse15 .cse16) (< .cse17 (mod .cse18 4294967296)) (<= .cse15 .cse17) (= (mod .cse15 .cse17) 0) (< .cse16 .cse15) (< .cse17 (mod (+ .cse18 4294967295) 4294967296)) (< .cse17 (mod (+ .cse18 1) 4294967296)))))) (or .cse3 (forall ((v_prenex_38 Int)) (let ((.cse20 (mod (+ c_main_~x~0 1) 4294967296)) (.cse21 (mod c_main_~x~0 4294967296)) (.cse19 (mod v_prenex_38 4294967296))) (or (= .cse19 .cse20) (<= .cse19 .cse21) (< .cse20 .cse19) (< .cse21 (mod (+ (div .cse19 .cse21) 4294967295) 4294967296)) (= (mod .cse19 .cse21) 0) (<= 0 .cse19))))) (forall ((v_prenex_12 Int)) (let ((.cse22 (mod v_prenex_12 4294967296)) (.cse24 (mod c_main_~x~0 4294967296))) (let ((.cse23 (mod (+ c_main_~x~0 1) 4294967296)) (.cse25 (div .cse22 .cse24))) (or (= .cse22 .cse23) (< .cse24 (mod (+ .cse25 4294967295) 4294967296)) (< .cse23 .cse22) (< .cse24 (mod (+ .cse25 1) 4294967296)) (= (mod .cse22 .cse24) 0) (<= .cse22 .cse24) (<= 0 .cse22))))) (or (forall ((v_prenex_21 Int)) (let ((.cse26 (mod v_prenex_21 4294967296)) (.cse27 (mod c_main_~x~0 4294967296))) (let ((.cse29 (mod (+ c_main_~x~0 1) 4294967296)) (.cse28 (div .cse26 .cse27))) (or (<= .cse26 .cse27) (< .cse27 (mod (+ .cse28 1) 4294967296)) (= .cse26 .cse29) (< .cse29 .cse26) (< .cse27 (mod .cse28 4294967296)))))) .cse11) (forall ((v_prenex_10 Int)) (let ((.cse31 (mod v_prenex_10 4294967296)) (.cse32 (mod c_main_~x~0 4294967296))) (let ((.cse30 (mod (+ c_main_~x~0 1) 4294967296)) (.cse33 (div .cse31 .cse32))) (or (< .cse30 .cse31) (<= .cse31 .cse32) (< .cse32 (mod .cse33 4294967296)) (= .cse31 .cse30) (< .cse31 0) (< .cse32 (mod (+ .cse33 4294967295) 4294967296)))))) (or .cse11 (forall ((v_prenex_13 Int)) (let ((.cse35 (mod v_prenex_13 4294967296)) (.cse36 (mod c_main_~x~0 4294967296))) (let ((.cse34 (mod (+ c_main_~x~0 1) 4294967296)) (.cse37 (div .cse35 .cse36))) (or (< .cse34 .cse35) (<= .cse35 .cse36) (< .cse35 0) (< .cse36 (mod .cse37 4294967296)) (= .cse35 .cse34) (< .cse36 (mod (+ .cse37 1) 4294967296))))))) (or (forall ((v_prenex_26 Int)) (let ((.cse39 (mod v_prenex_26 4294967296)) (.cse40 (mod c_main_~x~0 4294967296))) (let ((.cse41 (div .cse39 .cse40)) (.cse38 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse38 .cse39) (< .cse40 (mod (+ .cse41 4294967295) 4294967296)) (< .cse40 (mod .cse41 4294967296)) (= .cse39 .cse38) (< .cse39 0) (<= .cse39 .cse40))))) .cse3) (forall ((v_prenex_29 Int)) (let ((.cse45 (mod v_prenex_29 4294967296)) (.cse42 (mod c_main_~x~0 4294967296))) (let ((.cse44 (mod (+ c_main_~x~0 1) 4294967296)) (.cse43 (div .cse45 .cse42))) (or (< .cse42 (mod (+ .cse43 4294967295) 4294967296)) (< .cse44 .cse45) (< .cse42 (mod (+ .cse43 1) 4294967296)) (not (= (mod .cse45 .cse42) 0)) (= .cse45 .cse44) (<= .cse45 .cse42) (< .cse42 (mod .cse43 4294967296)))))) (forall ((v_prenex_3 Int)) (let ((.cse48 (mod v_prenex_3 4294967296)) (.cse46 (mod c_main_~x~0 4294967296))) (let ((.cse47 (div .cse48 .cse46)) (.cse49 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse46 (mod (+ .cse47 1) 4294967296)) (= .cse48 .cse49) (<= .cse48 .cse46) (< .cse48 0) (< .cse46 (mod .cse47 4294967296)) (< .cse49 .cse48))))) (or .cse11 (forall ((v_prenex_36 Int)) (let ((.cse52 (mod v_prenex_36 4294967296)) (.cse50 (mod c_main_~x~0 4294967296))) (let ((.cse53 (mod (+ c_main_~x~0 1) 4294967296)) (.cse51 (div .cse52 .cse50))) (or (< .cse50 (mod (+ .cse51 4294967295) 4294967296)) (<= .cse52 .cse50) (<= 0 .cse52) (< .cse50 (mod (+ .cse51 1) 4294967296)) (< .cse53 .cse52) (= .cse52 .cse53) (= (mod .cse52 .cse50) 0) (< .cse50 (mod .cse51 4294967296))))))) (forall ((v_prenex_28 Int)) (let ((.cse54 (mod v_prenex_28 4294967296)) (.cse55 (mod c_main_~x~0 4294967296))) (let ((.cse57 (div .cse54 .cse55)) (.cse56 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (= (mod .cse54 .cse55) 0)) (= .cse54 .cse56) (<= .cse54 .cse55) (< .cse55 (mod .cse57 4294967296)) (< .cse55 (mod (+ .cse57 1) 4294967296)) (< .cse56 .cse54))))) (forall ((v_prenex_35 Int)) (let ((.cse61 (mod v_prenex_35 4294967296)) (.cse58 (mod c_main_~x~0 4294967296))) (let ((.cse59 (div .cse61 .cse58)) (.cse60 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse58 (mod (+ .cse59 4294967295) 4294967296)) (< .cse60 .cse61) (< .cse58 (mod .cse59 4294967296)) (<= .cse61 .cse58) (not (= (mod .cse61 .cse58) 0)) (= .cse61 .cse60))))) (forall ((v_prenex_19 Int)) (let ((.cse64 (mod v_prenex_19 4294967296)) (.cse62 (mod c_main_~x~0 4294967296))) (let ((.cse65 (mod (+ c_main_~x~0 1) 4294967296)) (.cse63 (div .cse64 .cse62))) (or (< .cse62 (mod (+ .cse63 1) 4294967296)) (= .cse64 .cse65) (< .cse64 0) (< .cse62 (mod .cse63 4294967296)) (< .cse65 .cse64) (<= .cse64 .cse62) (< .cse62 (mod (+ .cse63 4294967295) 4294967296)))))) (forall ((v_prenex_8 Int)) (let ((.cse66 (mod c_main_~x~0 4294967296)) (.cse67 (mod v_prenex_8 4294967296)) (.cse68 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse66 (mod (div .cse67 .cse66) 4294967296)) (< .cse68 .cse67) (<= .cse67 .cse66) (not (= (mod .cse67 .cse66) 0)) (< .cse67 0) (= .cse67 .cse68)))) (forall ((v_prenex_27 Int)) (let ((.cse70 (mod c_main_~x~0 4294967296)) (.cse71 (mod (+ c_main_~x~0 1) 4294967296)) (.cse69 (mod v_prenex_27 4294967296))) (or (not (= (mod .cse69 .cse70) 0)) (< .cse70 (mod (div .cse69 .cse70) 4294967296)) (<= .cse69 .cse70) (= .cse69 .cse71) (< .cse71 .cse69)))) (or (forall ((v_prenex_16 Int)) (let ((.cse72 (mod v_prenex_16 4294967296)) (.cse74 (mod c_main_~x~0 4294967296))) (let ((.cse73 (mod (+ c_main_~x~0 1) 4294967296)) (.cse75 (div .cse72 .cse74))) (or (= .cse72 .cse73) (< .cse73 .cse72) (not (= (mod .cse72 .cse74) 0)) (< .cse74 (mod .cse75 4294967296)) (< .cse74 (mod (+ .cse75 1) 4294967296)) (<= .cse72 .cse74))))) .cse11) (or .cse3 (forall ((v_prenex_15 Int)) (let ((.cse76 (mod v_prenex_15 4294967296)) (.cse78 (mod c_main_~x~0 4294967296))) (let ((.cse77 (mod (+ c_main_~x~0 1) 4294967296)) (.cse79 (div .cse76 .cse78))) (or (= .cse76 .cse77) (< .cse78 (mod (+ .cse79 4294967295) 4294967296)) (not (= (mod .cse76 .cse78) 0)) (< .cse77 .cse76) (< .cse78 (mod .cse79 4294967296)) (<= .cse76 .cse78)))))) (or .cse3 (forall ((v_prenex_4 Int)) (let ((.cse81 (mod v_prenex_4 4294967296)) (.cse82 (mod c_main_~x~0 4294967296))) (let ((.cse80 (mod (+ c_main_~x~0 1) 4294967296)) (.cse83 (div .cse81 .cse82))) (or (< .cse80 .cse81) (< .cse82 (mod .cse83 4294967296)) (<= .cse81 .cse82) (= .cse81 .cse80) (< .cse82 (mod (+ .cse83 1) 4294967296)) (< .cse82 (mod (+ .cse83 4294967295) 4294967296))))))) (or .cse3 (forall ((v_prenex_11 Int)) (let ((.cse86 (mod v_prenex_11 4294967296)) (.cse84 (mod c_main_~x~0 4294967296))) (let ((.cse85 (div .cse86 .cse84)) (.cse87 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse84 (mod .cse85 4294967296)) (< .cse84 (mod (+ .cse85 4294967295) 4294967296)) (not (= (mod .cse86 .cse84) 0)) (< .cse84 (mod (+ .cse85 1) 4294967296)) (<= .cse86 .cse84) (= .cse86 .cse87) (< .cse87 .cse86)))))) (or .cse11 (forall ((v_prenex_33 Int)) (let ((.cse90 (mod c_main_~x~0 4294967296)) (.cse89 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse88 (mod v_prenex_33 4294967296))) (or (= .cse88 .cse89) (<= (mod (div .cse88 .cse90) 4294967296) .cse90) (<= .cse88 .cse90) (< .cse89 .cse88) (< .cse88 0))))) (or (forall ((v_prenex_18 Int)) (let ((.cse92 (mod c_main_~x~0 4294967296)) (.cse93 (mod (+ c_main_~x~0 1) 4294967296)) (.cse91 (mod v_prenex_18 4294967296))) (or (not (= (mod .cse91 .cse92) 0)) (= .cse91 .cse93) (<= .cse91 .cse92) (< .cse92 (mod (div .cse91 .cse92) 4294967296)) (< .cse93 .cse91)))) .cse3) (or (forall ((v_prenex_23 Int)) (let ((.cse96 (mod c_main_~x~0 4294967296)) (.cse95 (mod v_prenex_23 4294967296)) (.cse94 (mod (* c_main_~x~0 c_main_~x~0) 4294967296))) (or (< .cse94 .cse95) (<= .cse95 .cse96) (<= 0 .cse95) (<= (mod (+ (div .cse95 .cse96) 4294967295) 4294967296) .cse96) (= (mod .cse95 .cse96) 0) (= .cse95 .cse94)))) .cse3) (or .cse3 (forall ((v_prenex_2 Int)) (let ((.cse98 (mod (+ c_main_~x~0 1) 4294967296)) (.cse97 (mod v_prenex_2 4294967296)) (.cse99 (mod c_main_~x~0 4294967296))) (or (< .cse97 0) (< .cse98 .cse97) (= .cse97 .cse98) (<= .cse97 .cse99) (< .cse99 (mod (div .cse97 .cse99) 4294967296)))))) (or (forall ((v_prenex_22 Int)) (let ((.cse101 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse100 (mod v_prenex_22 4294967296)) (.cse102 (mod c_main_~x~0 4294967296))) (or (= .cse100 .cse101) (< .cse100 0) (not (= (mod .cse100 .cse102) 0)) (< .cse101 .cse100) (<= .cse100 .cse102) (<= (mod (div .cse100 .cse102) 4294967296) .cse102)))) .cse3) (or .cse11 (forall ((v_prenex_17 Int)) (let ((.cse104 (mod (+ c_main_~x~0 1) 4294967296)) (.cse105 (mod c_main_~x~0 4294967296)) (.cse103 (mod v_prenex_17 4294967296))) (or (= .cse103 .cse104) (< .cse104 .cse103) (< .cse105 (mod (+ (div .cse103 .cse105) 1) 4294967296)) (<= .cse103 .cse105) (= (mod .cse103 .cse105) 0) (<= 0 .cse103))))) (or .cse11 (forall ((v_prenex_25 Int)) (let ((.cse108 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse106 (mod v_prenex_25 4294967296)) (.cse107 (mod c_main_~x~0 4294967296))) (or (not (= (mod .cse106 .cse107) 0)) (< .cse108 .cse106) (< .cse106 0) (<= .cse106 .cse107) (= .cse106 .cse108) (<= (mod (div .cse106 .cse107) 4294967296) .cse107))))) (forall ((v_prenex_9 Int)) (let ((.cse109 (mod v_prenex_9 4294967296)) (.cse110 (mod c_main_~x~0 4294967296))) (let ((.cse112 (div .cse109 .cse110)) (.cse111 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (= (mod .cse109 .cse110) 0)) (< .cse111 .cse109) (< .cse110 (mod .cse112 4294967296)) (<= .cse109 .cse110) (< .cse110 (mod (+ .cse112 1) 4294967296)) (< .cse109 0) (= .cse109 .cse111))))) (or .cse11 (forall ((v_prenex_24 Int)) (let ((.cse113 (mod v_prenex_24 4294967296)) (.cse114 (mod c_main_~x~0 4294967296))) (let ((.cse116 (div .cse113 .cse114)) (.cse115 (mod (+ c_main_~x~0 1) 4294967296))) (or (<= .cse113 .cse114) (= (mod .cse113 .cse114) 0) (= .cse113 .cse115) (< .cse114 (mod .cse116 4294967296)) (<= 0 .cse113) (< .cse114 (mod (+ .cse116 1) 4294967296)) (< .cse115 .cse113)))))) (forall ((v_prenex_40 Int)) (let ((.cse118 (mod c_main_~x~0 4294967296)) (.cse119 (mod (+ c_main_~x~0 1) 4294967296)) (.cse117 (mod v_prenex_40 4294967296))) (or (<= .cse117 .cse118) (< .cse118 (mod (div .cse117 .cse118) 4294967296)) (< .cse119 .cse117) (= .cse117 .cse119) (< .cse117 0)))) (or .cse11 (forall ((v_prenex_6 Int)) (let ((.cse122 (mod v_prenex_6 4294967296)) (.cse120 (mod c_main_~x~0 4294967296))) (let ((.cse121 (div .cse122 .cse120)) (.cse123 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse120 (mod (+ .cse121 4294967295) 4294967296)) (< .cse120 (mod .cse121 4294967296)) (<= .cse122 .cse120) (= .cse122 .cse123) (< .cse120 (mod (+ .cse121 1) 4294967296)) (< .cse123 .cse122)))))) (or (forall ((v_prenex_31 Int)) (let ((.cse126 (mod (+ c_main_~x~0 1) 4294967296)) (.cse124 (mod v_prenex_31 4294967296)) (.cse125 (mod c_main_~x~0 4294967296))) (or (not (= (mod .cse124 .cse125) 0)) (< .cse124 0) (< .cse125 (mod (div .cse124 .cse125) 4294967296)) (< .cse126 .cse124) (= .cse124 .cse126) (<= .cse124 .cse125)))) .cse3) (forall ((v_prenex_30 Int)) (let ((.cse127 (mod v_prenex_30 4294967296)) (.cse129 (mod c_main_~x~0 4294967296))) (let ((.cse128 (mod (+ c_main_~x~0 1) 4294967296)) (.cse130 (div .cse127 .cse129))) (or (= .cse127 .cse128) (< .cse129 (mod (+ .cse130 1) 4294967296)) (<= .cse127 .cse129) (< .cse129 (mod (+ .cse130 4294967295) 4294967296)) (< .cse128 .cse127) (< .cse129 (mod .cse130 4294967296)))))) (or .cse3 (forall ((v_prenex_39 Int)) (let ((.cse131 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse133 (mod c_main_~x~0 4294967296)) (.cse132 (mod v_prenex_39 4294967296))) (or (< .cse131 .cse132) (<= .cse132 .cse133) (= .cse132 .cse131) (<= (mod (div .cse132 .cse133) 4294967296) .cse133) (< .cse132 0))))) (or .cse3 (forall ((v_prenex_14 Int)) (let ((.cse134 (mod v_prenex_14 4294967296)) (.cse135 (mod c_main_~x~0 4294967296))) (let ((.cse137 (mod (+ c_main_~x~0 1) 4294967296)) (.cse136 (div .cse134 .cse135))) (or (<= 0 .cse134) (<= .cse134 .cse135) (< .cse135 (mod (+ .cse136 4294967295) 4294967296)) (< .cse135 (mod .cse136 4294967296)) (< .cse137 .cse134) (= .cse134 .cse137) (< .cse135 (mod (+ .cse136 1) 4294967296)) (= (mod .cse134 .cse135) 0)))))) (or (forall ((v_prenex_7 Int)) (let ((.cse140 (mod v_prenex_7 4294967296)) (.cse138 (mod c_main_~x~0 4294967296))) (let ((.cse141 (mod (+ c_main_~x~0 1) 4294967296)) (.cse139 (div .cse140 .cse138))) (or (< .cse138 (mod .cse139 4294967296)) (= .cse140 .cse141) (< .cse141 .cse140) (< .cse138 (mod (+ .cse139 4294967295) 4294967296)) (<= .cse140 .cse138))))) .cse3) (or .cse11 (forall ((v_prenex_34 Int)) (let ((.cse144 (mod c_main_~x~0 4294967296)) (.cse143 (mod (* c_main_~x~0 c_main_~x~0) 4294967296)) (.cse142 (mod v_prenex_34 4294967296))) (or (= .cse142 .cse143) (<= .cse142 .cse144) (<= 0 .cse142) (= (mod .cse142 .cse144) 0) (<= (mod (+ (div .cse142 .cse144) 1) 4294967296) .cse144) (< .cse143 .cse142))))) (or .cse11 (forall ((v_prenex_20 Int)) (let ((.cse147 (mod c_main_~x~0 4294967296)) (.cse145 (mod v_prenex_20 4294967296)) (.cse146 (mod (+ c_main_~x~0 1) 4294967296))) (or (< .cse145 0) (< .cse146 .cse145) (< .cse147 (mod (div .cse145 .cse147) 4294967296)) (<= .cse145 .cse147) (= .cse145 .cse146)))))))) is different from true [2019-10-15 03:01:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-10-15 03:01:19,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662990992] [2019-10-15 03:01:19,467 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 03:01:19,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769143221] [2019-10-15 03:01:19,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:01:19,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-10-15 03:01:19,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756506664] [2019-10-15 03:01:19,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:01:19,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:01:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:01:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2019-10-15 03:01:19,471 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-10-15 03:01:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:01:21,502 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-10-15 03:01:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:01:21,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:01:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:01:21,507 INFO L225 Difference]: With dead ends: 13 [2019-10-15 03:01:21,507 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:01:21,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2019-10-15 03:01:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:01:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:01:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:01:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:01:21,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-10-15 03:01:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:01:21,509 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:01:21,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:01:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:01:21,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:01:21,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:01:21,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:01:21,880 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:01:21,880 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:01:21,880 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:01:21,880 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:01:21,880 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:01:21,880 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:01:21,881 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2019-10-15 03:01:21,881 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2019-10-15 03:01:21,881 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) [2019-10-15 03:01:21,881 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-10-15 03:01:21,882 INFO L439 ceAbstractionStarter]: At program point L18-2(lines 18 24) the Hoare annotation is: (let ((.cse2 (div main_~x~0 4294967296))) (let ((.cse1 (+ main_~y~0 (* 4294967296 .cse2))) (.cse0 (* 4294967296 (div main_~y~0 4294967296)))) (and (<= (+ .cse0 main_~x~0) .cse1) (< .cse1 (+ .cse0 main_~x~0 1)) (< 0 (+ .cse2 1))))) [2019-10-15 03:01:21,882 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2019-10-15 03:01:21,882 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2019-10-15 03:01:21,882 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2019-10-15 03:01:21,883 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-10-15 03:01:21,883 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-10-15 03:01:21,883 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-10-15 03:01:21,883 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2019-10-15 03:01:21,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:01:21 BoogieIcfgContainer [2019-10-15 03:01:21,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:01:21,901 INFO L168 Benchmark]: Toolchain (without parser) took 10767.22 ms. Allocated memory was 136.3 MB in the beginning and 246.9 MB in the end (delta: 110.6 MB). Free memory was 100.7 MB in the beginning and 165.8 MB in the end (delta: -65.1 MB). Peak memory consumption was 45.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:21,903 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-15 03:01:21,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.52 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 91.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:21,905 INFO L168 Benchmark]: Boogie Preprocessor took 102.98 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 178.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:21,906 INFO L168 Benchmark]: RCFGBuilder took 1726.01 ms. Allocated memory is still 200.3 MB. Free memory was 178.5 MB in the beginning and 165.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:21,907 INFO L168 Benchmark]: TraceAbstraction took 8699.62 ms. Allocated memory was 200.3 MB in the beginning and 246.9 MB in the end (delta: 46.7 MB). Free memory was 165.2 MB in the beginning and 165.8 MB in the end (delta: -572.6 kB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:01:21,911 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 234.52 ms. Allocated memory is still 136.3 MB. Free memory was 100.4 MB in the beginning and 91.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.98 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 178.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1726.01 ms. Allocated memory is still 200.3 MB. Free memory was 178.5 MB in the beginning and 165.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8699.62 ms. Allocated memory was 200.3 MB in the beginning and 246.9 MB in the end (delta: 46.7 MB). Free memory was 165.2 MB in the beginning and 165.8 MB in the end (delta: -572.6 kB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x == 1 && 4294967296 * (y / 4294967296) + x <= y + 4294967296 * (x / 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 21 SDtfs, 13 SDslu, 46 SDs, 0 SdLazy, 29 SolverSat, 3 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 10 NumberOfFragments, 63 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 17 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 2 QuantifiedInterpolants, 60618 SizeOfPredicates, 2 NumberOfNonLiveVariables, 27 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...