java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:31:28,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:31:28,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:31:28,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:31:28,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:31:28,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:31:28,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:31:28,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:31:28,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:31:28,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:31:28,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:31:28,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:31:28,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:31:28,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:31:28,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:31:28,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:31:28,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:31:28,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:31:28,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:31:28,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:31:28,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:31:28,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:31:28,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:31:28,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:31:28,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:31:28,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:31:28,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:31:28,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:31:28,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:31:28,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:31:28,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:31:28,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:31:28,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:31:28,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:31:28,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:31:28,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:31:28,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:31:28,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:31:28,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:31:28,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:31:28,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:31:28,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:31:28,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:31:28,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:31:28,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:31:28,856 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:31:28,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:31:28,857 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:31:28,857 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:31:28,857 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:31:28,857 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:31:28,858 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:31:28,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:31:28,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:31:28,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:31:28,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:31:28,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:31:28,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:31:28,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:31:28,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:31:28,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:31:28,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:31:28,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:31:28,861 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:31:28,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:31:28,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:31:28,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:31:28,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:31:28,862 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:31:28,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:31:28,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:31:28,863 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:31:28,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:31:28,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:31:28,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:31:28,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:31:28,920 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:31:28,921 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-03 02:31:28,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ace296bc/aaa98e14b3334e3ab97d356d3ffc067a/FLAG6923edb52 [2019-10-03 02:31:29,447 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:31:29,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2019-10-03 02:31:29,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ace296bc/aaa98e14b3334e3ab97d356d3ffc067a/FLAG6923edb52 [2019-10-03 02:31:29,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ace296bc/aaa98e14b3334e3ab97d356d3ffc067a [2019-10-03 02:31:29,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:31:29,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:31:29,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:29,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:31:29,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:31:29,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:29" (1/1) ... [2019-10-03 02:31:29,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbd8e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:29, skipping insertion in model container [2019-10-03 02:31:29,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:31:29" (1/1) ... [2019-10-03 02:31:29,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:31:29,901 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:31:30,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:30,087 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:31:30,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:31:30,114 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:31:30,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30 WrapperNode [2019-10-03 02:31:30,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:31:30,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:31:30,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:31:30,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:31:30,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (1/1) ... [2019-10-03 02:31:30,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:31:30,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:31:30,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:31:30,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:31:30,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (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-03 02:31:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:31:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:31:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:31:30,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:31:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:31:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:31:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-03 02:31:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:31:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:31:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:31:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:31:30,495 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:31:30,496 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:31:30,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:30 BoogieIcfgContainer [2019-10-03 02:31:30,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:31:30,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:31:30,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:31:30,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:31:30,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:31:29" (1/3) ... [2019-10-03 02:31:30,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419aaeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:30, skipping insertion in model container [2019-10-03 02:31:30,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:31:30" (2/3) ... [2019-10-03 02:31:30,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419aaeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:31:30, skipping insertion in model container [2019-10-03 02:31:30,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:31:30" (3/3) ... [2019-10-03 02:31:30,507 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_2-2.c [2019-10-03 02:31:30,518 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:31:30,528 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:31:30,546 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:31:30,616 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:31:30,617 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:31:30,617 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:31:30,617 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:31:30,617 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:31:30,617 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:31:30,617 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:31:30,618 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:31:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-03 02:31:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-03 02:31:30,646 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:30,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:30,651 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash -133618162, now seen corresponding path program 1 times [2019-10-03 02:31:30,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:30,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:30,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:30,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:30,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:30,773 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-03 02:31:30,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:30,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:31:30,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:30,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:31:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:31:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:31:30,794 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-03 02:31:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:30,812 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-10-03 02:31:30,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:31:30,814 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-03 02:31:30,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:30,824 INFO L225 Difference]: With dead ends: 19 [2019-10-03 02:31:30,825 INFO L226 Difference]: Without dead ends: 13 [2019-10-03 02:31:30,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:31:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-03 02:31:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-03 02:31:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-03 02:31:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-03 02:31:30,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-10-03 02:31:30,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:30,866 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-03 02:31:30,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:31:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-03 02:31:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-03 02:31:30,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:30,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:30,868 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:30,868 INFO L82 PathProgramCache]: Analyzing trace with hash -142853372, now seen corresponding path program 1 times [2019-10-03 02:31:30,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:30,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:31,175 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-03 02:31:31,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:31,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:31:31,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:31,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:31:31,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:31:31,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:31:31,179 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-10-03 02:31:31,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:31,419 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-10-03 02:31:31,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:31:31,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-03 02:31:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:31,422 INFO L225 Difference]: With dead ends: 18 [2019-10-03 02:31:31,422 INFO L226 Difference]: Without dead ends: 15 [2019-10-03 02:31:31,423 INFO L640 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-03 02:31:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-03 02:31:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-03 02:31:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-03 02:31:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-03 02:31:31,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-10-03 02:31:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:31,429 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-03 02:31:31,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:31:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-03 02:31:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:31:31,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:31,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:31,431 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1232195137, now seen corresponding path program 1 times [2019-10-03 02:31:31,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:31,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:31,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:31,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:31,440 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:31:31,440 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:31:31,441 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:31:31,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:31,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:31:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:31,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-10-03 02:31:31,478 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [15], [17], [20], [29], [32], [34], [40], [41], [42], [44] [2019-10-03 02:31:31,513 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:31:31,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:31:31,579 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:31:31,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:31:31,656 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 11 root evaluator evaluations with a maximum evaluation depth of 11. Performed 11 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2019-10-03 02:31:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:31,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:31:31,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:31:31,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:31:31,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:31,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:31:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:31,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:31:31,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:31:31,756 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-03 02:31:31,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:31:33,879 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~y~0 Int)) (let ((.cse0 (mod main_~y~0 4294967296))) (or (< (mod (* c_main_~x~0 c_main_~x~0) 4294967296) .cse0) (<= .cse0 (mod c_main_~x~0 4294967296))))) is different from true [2019-10-03 02:31:33,907 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-03 02:31:33,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:31:33,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-03 02:31:33,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:33,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:31:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:31:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=18, Unknown=2, NotChecked=8, Total=42 [2019-10-03 02:31:33,913 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2019-10-03 02:31:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:35,985 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-10-03 02:31:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:31:35,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-03 02:31:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:35,987 INFO L225 Difference]: With dead ends: 16 [2019-10-03 02:31:35,987 INFO L226 Difference]: Without dead ends: 16 [2019-10-03 02:31:35,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=14, Invalid=18, Unknown=2, NotChecked=8, Total=42 [2019-10-03 02:31:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-03 02:31:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-03 02:31:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-03 02:31:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-03 02:31:35,992 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2019-10-03 02:31:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:35,992 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-03 02:31:35,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:31:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-10-03 02:31:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:31:35,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:35,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:35,994 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1289453439, now seen corresponding path program 1 times [2019-10-03 02:31:35,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:35,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:35,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:35,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:35,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:36,002 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:31:36,002 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:31:36,002 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:31:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:36,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:31:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:36,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-10-03 02:31:36,036 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [15], [17], [22], [29], [32], [34], [40], [41], [42], [44] [2019-10-03 02:31:36,038 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:31:36,038 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:31:36,041 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:31:36,218 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:31:36,220 INFO L272 AbstractInterpreter]: Visited 13 different actions 41 times. Merged at 3 different actions 12 times. Widened at 1 different actions 2 times. Performed 66 root evaluator evaluations with a maximum evaluation depth of 12. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2019-10-03 02:31:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:36,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:31:36,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:31:36,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:31:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:36,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:31:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:36,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-03 02:31:36,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:31:36,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:36,391 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:31:36,517 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-03 02:31:36,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:31:36,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-10-03 02:31:36,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:36,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:31:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:31:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:31:36,523 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-10-03 02:31:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:39,257 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-10-03 02:31:39,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:31:39,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-10-03 02:31:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:39,258 INFO L225 Difference]: With dead ends: 19 [2019-10-03 02:31:39,258 INFO L226 Difference]: Without dead ends: 16 [2019-10-03 02:31:39,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:31:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-03 02:31:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-03 02:31:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-03 02:31:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-03 02:31:39,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-10-03 02:31:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:39,264 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-03 02:31:39,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:31:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-03 02:31:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:31:39,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:39,266 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:39,266 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:39,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:39,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1005461508, now seen corresponding path program 1 times [2019-10-03 02:31:39,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:39,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:39,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:39,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:39,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:39,280 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-03 02:31:39,280 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-03 02:31:39,280 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-03 02:31:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:39,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-10-03 02:31:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:39,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2019-10-03 02:31:39,320 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [15], [17], [20], [22], [29], [32], [34], [40], [41], [42], [44] [2019-10-03 02:31:39,322 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:31:39,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:31:39,324 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:31:39,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:31:39,407 INFO L272 AbstractInterpreter]: Visited 14 different actions 46 times. Merged at 4 different actions 12 times. Widened at 1 different actions 2 times. Performed 82 root evaluator evaluations with a maximum evaluation depth of 12. Performed 82 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 6 fixpoints after 2 different actions. Largest state had 4 variables. [2019-10-03 02:31:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:39,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:31:39,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:31:39,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-03 02:31:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:39,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:31:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:39,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:31:39,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:31:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:39,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:31:39,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:31:39,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:39,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:31:41,862 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse32 (mod c_main_~x~0 4294967296))) (let ((.cse1 (forall ((main_~y~0 Int)) (let ((.cse60 (mod main_~y~0 4294967296)) (.cse61 (mod c_main_~x~0 4294967296))) (let ((.cse62 (div .cse60 .cse61))) (or (<= .cse60 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse61 (mod .cse62 4294967296)) (not (= (mod .cse60 .cse61) 0)) (< .cse61 (mod (+ .cse62 4294967295) 4294967296))))))) (.cse5 (forall ((main_~y~0 Int)) (let ((.cse57 (mod main_~y~0 4294967296)) (.cse58 (mod c_main_~x~0 4294967296))) (let ((.cse59 (div .cse57 .cse58))) (or (<= .cse57 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse58 (mod .cse59 4294967296)) (<= 0 .cse57) (= (mod .cse57 .cse58) 0) (< .cse58 (mod (+ .cse59 1) 4294967296)) (< .cse58 (mod (+ .cse59 4294967295) 4294967296))))))) (.cse18 (forall ((main_~y~0 Int)) (let ((.cse55 (mod main_~y~0 4294967296)) (.cse56 (mod c_main_~x~0 4294967296))) (or (<= .cse55 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse56 (mod (div .cse55 .cse56) 4294967296)) (not (= (mod .cse55 .cse56) 0)))))) (.cse10 (forall ((main_~y~0 Int)) (let ((.cse52 (mod main_~y~0 4294967296)) (.cse53 (mod c_main_~x~0 4294967296))) (let ((.cse54 (div .cse52 .cse53))) (or (<= .cse52 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse53 (mod .cse54 4294967296)) (< .cse53 (mod (+ .cse54 1) 4294967296)) (< .cse53 (mod (+ .cse54 4294967295) 4294967296)) (< .cse52 0)))))) (.cse25 (forall ((main_~y~0 Int)) (let ((.cse49 (mod main_~y~0 4294967296)) (.cse50 (mod c_main_~x~0 4294967296))) (let ((.cse51 (div .cse49 .cse50))) (or (<= .cse49 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse50 (mod .cse51 4294967296)) (< .cse50 (mod (+ .cse51 4294967295) 4294967296)) (< .cse49 0)))))) (.cse26 (forall ((main_~y~0 Int)) (let ((.cse46 (mod main_~y~0 4294967296)) (.cse47 (mod c_main_~x~0 4294967296))) (let ((.cse48 (div .cse46 .cse47))) (or (<= .cse46 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse47 (mod .cse48 4294967296)) (not (= (mod .cse46 .cse47) 0)) (< .cse47 (mod (+ .cse48 1) 4294967296))))))) (.cse17 (forall ((main_~y~0 Int)) (let ((.cse45 (mod c_main_~x~0 4294967296)) (.cse44 (mod main_~y~0 4294967296))) (or (<= .cse44 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse45 (mod (div .cse44 .cse45) 4294967296)) (not (= (mod .cse44 .cse45) 0)) (< .cse44 0))))) (.cse12 (forall ((main_~y~0 Int)) (let ((.cse41 (mod main_~y~0 4294967296)) (.cse42 (mod c_main_~x~0 4294967296))) (let ((.cse43 (div .cse41 .cse42))) (or (<= .cse41 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse42 (mod .cse43 4294967296)) (< .cse42 (mod (+ .cse43 1) 4294967296)) (< .cse42 (mod (+ .cse43 4294967295) 4294967296))))))) (.cse11 (forall ((main_~y~0 Int)) (let ((.cse39 (mod main_~y~0 4294967296))) (or (<= .cse39 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse40 (mod c_main_~x~0 4294967296))) (< .cse40 (mod (div .cse39 .cse40) 4294967296))) (< .cse39 0))))) (.cse9 (< .cse32 0)) (.cse13 (forall ((main_~y~0 Int)) (let ((.cse36 (mod main_~y~0 4294967296)) (.cse37 (mod c_main_~x~0 4294967296))) (let ((.cse38 (div .cse36 .cse37))) (or (<= .cse36 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse37 (mod .cse38 4294967296)) (< .cse37 (mod (+ .cse38 1) 4294967296)) (< .cse36 0)))))) (.cse6 (forall ((main_~y~0 Int)) (let ((.cse33 (mod main_~y~0 4294967296)) (.cse34 (mod c_main_~x~0 4294967296))) (let ((.cse35 (div .cse33 .cse34))) (or (<= .cse33 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse34 (mod .cse35 4294967296)) (not (= (mod .cse33 .cse34) 0)) (< .cse34 (mod (+ .cse35 1) 4294967296)) (< .cse34 (mod (+ .cse35 4294967295) 4294967296))))))) (.cse0 (<= 0 .cse32))) (and (or .cse0 .cse1) (forall ((main_~y~0 Int)) (let ((.cse2 (mod main_~y~0 4294967296)) (.cse3 (mod c_main_~x~0 4294967296))) (let ((.cse4 (div .cse2 .cse3))) (or (<= .cse2 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse3 (mod .cse4 4294967296)) (not (= (mod .cse2 .cse3) 0)) (< .cse3 (mod (+ .cse4 1) 4294967296)) (< .cse2 0))))) (or .cse0 .cse5) .cse6 (or (forall ((main_~y~0 Int)) (let ((.cse7 (mod main_~y~0 4294967296)) (.cse8 (mod c_main_~x~0 4294967296))) (or (<= .cse7 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse7) (= (mod .cse7 .cse8) 0) (< .cse8 (mod (+ (div .cse7 .cse8) 1) 4294967296))))) .cse9) (or .cse10 .cse0) .cse11 (or .cse12 .cse9) (or .cse11 .cse0) .cse1 .cse13 (forall ((main_~y~0 Int)) (let ((.cse14 (mod main_~y~0 4294967296)) (.cse15 (mod c_main_~x~0 4294967296))) (let ((.cse16 (div .cse14 .cse15))) (or (<= .cse14 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse14) (= (mod .cse14 .cse15) 0) (< .cse15 (mod (+ .cse16 1) 4294967296)) (< .cse15 (mod (+ .cse16 4294967295) 4294967296)))))) .cse17 (or .cse0 .cse18) .cse18 .cse5 (or .cse9 .cse5) (or .cse9 .cse18) (or .cse12 .cse0) .cse10 (or (forall ((main_~y~0 Int)) (let ((.cse19 (mod main_~y~0 4294967296)) (.cse20 (mod c_main_~x~0 4294967296))) (let ((.cse21 (div .cse19 .cse20))) (or (<= .cse19 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse20 (mod .cse21 4294967296)) (< .cse20 (mod (+ .cse21 1) 4294967296)))))) .cse9) (or (forall ((main_~y~0 Int)) (let ((.cse22 (mod main_~y~0 4294967296)) (.cse23 (mod c_main_~x~0 4294967296))) (let ((.cse24 (div .cse22 .cse23))) (or (<= .cse22 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse23 (mod .cse24 4294967296)) (<= 0 .cse22) (= (mod .cse22 .cse23) 0) (< .cse23 (mod (+ .cse24 1) 4294967296)))))) .cse9) (or .cse25 .cse0) (or .cse9 .cse26) .cse25 .cse26 (or .cse0 .cse17) .cse12 (or (forall ((main_~y~0 Int)) (let ((.cse27 (mod main_~y~0 4294967296)) (.cse28 (mod c_main_~x~0 4294967296))) (let ((.cse29 (div .cse27 .cse28))) (or (<= .cse27 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse28 (mod .cse29 4294967296)) (< .cse28 (mod (+ .cse29 4294967295) 4294967296)))))) .cse0) (or .cse11 .cse9) (or .cse9 .cse13) (or .cse6 .cse0) (or (forall ((main_~y~0 Int)) (let ((.cse30 (mod main_~y~0 4294967296)) (.cse31 (mod c_main_~x~0 4294967296))) (or (<= .cse30 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse30) (= (mod .cse30 .cse31) 0) (< .cse31 (mod (+ (div .cse30 .cse31) 4294967295) 4294967296))))) .cse0)))) is different from false [2019-10-03 02:31:44,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse91 (mod c_main_~x~0 4294967296))) (let ((.cse18 (< .cse91 0)) (.cse0 (<= 0 .cse91))) (and (or .cse0 (forall ((main_~y~0 Int)) (let ((.cse1 (mod main_~y~0 4294967296)) (.cse2 (mod c_main_~x~0 4294967296))) (let ((.cse3 (div .cse1 .cse2))) (or (<= .cse1 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse2 (mod .cse3 4294967296)) (not (= (mod .cse1 .cse2) 0)) (< .cse2 (mod (+ .cse3 4294967295) 4294967296))))))) (or (forall ((v_prenex_18 Int)) (let ((.cse4 (mod v_prenex_18 4294967296)) (.cse5 (mod c_main_~x~0 4294967296))) (let ((.cse6 (div .cse4 .cse5))) (or (<= .cse4 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse5 (mod .cse6 4294967296)) (< .cse5 (mod (+ .cse6 1) 4294967296)) (< .cse5 (mod (+ .cse6 4294967295) 4294967296)))))) .cse0) (forall ((v_prenex_12 Int)) (let ((.cse7 (mod v_prenex_12 4294967296)) (.cse8 (mod c_main_~x~0 4294967296))) (or (<= .cse7 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse7 0) (< .cse8 (mod (div .cse7 .cse8) 4294967296)) (not (= (mod .cse7 .cse8) 0))))) (forall ((v_prenex_19 Int)) (let ((.cse11 (mod v_prenex_19 4294967296)) (.cse9 (mod c_main_~x~0 4294967296))) (let ((.cse10 (div .cse11 .cse9))) (or (< .cse9 (mod (+ .cse10 1) 4294967296)) (< .cse11 0) (< .cse9 (mod .cse10 4294967296)) (<= .cse11 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse9 (mod (+ .cse10 4294967295) 4294967296)))))) (or .cse0 (forall ((v_prenex_26 Int)) (let ((.cse12 (mod c_main_~x~0 4294967296)) (.cse13 (mod v_prenex_26 4294967296))) (or (< .cse12 (mod (div .cse13 .cse12) 4294967296)) (not (= (mod .cse13 .cse12) 0)) (< .cse13 0) (<= .cse13 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_13 Int)) (let ((.cse15 (mod v_prenex_13 4294967296)) (.cse14 (mod c_main_~x~0 4294967296))) (or (< .cse14 (mod (div .cse15 .cse14) 4294967296)) (<= .cse15 (mod (+ c_main_~x~0 1) 4294967296)) (not (= (mod .cse15 .cse14) 0))))) .cse0) (or .cse0 (forall ((v_prenex_32 Int)) (let ((.cse16 (mod v_prenex_32 4294967296)) (.cse17 (mod c_main_~x~0 4294967296))) (or (= (mod .cse16 .cse17) 0) (<= 0 .cse16) (<= .cse16 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse17 (mod (+ (div .cse16 .cse17) 4294967295) 4294967296)))))) (or .cse18 (forall ((v_prenex_23 Int)) (let ((.cse19 (mod v_prenex_23 4294967296)) (.cse20 (mod c_main_~x~0 4294967296))) (let ((.cse21 (div .cse19 .cse20))) (or (not (= (mod .cse19 .cse20) 0)) (<= .cse19 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse20 (mod .cse21 4294967296)) (< .cse20 (mod (+ .cse21 1) 4294967296))))))) (forall ((v_prenex_10 Int)) (let ((.cse22 (mod v_prenex_10 4294967296)) (.cse23 (mod c_main_~x~0 4294967296))) (let ((.cse24 (div .cse22 .cse23))) (or (<= .cse22 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse23 (mod (+ .cse24 1) 4294967296)) (< .cse23 (mod .cse24 4294967296)) (< .cse22 0))))) (forall ((v_prenex_15 Int)) (let ((.cse25 (mod v_prenex_15 4294967296)) (.cse26 (mod c_main_~x~0 4294967296))) (let ((.cse27 (div .cse25 .cse26))) (or (<= 0 .cse25) (< .cse26 (mod (+ .cse27 4294967295) 4294967296)) (< .cse26 (mod (+ .cse27 1) 4294967296)) (= (mod .cse25 .cse26) 0) (<= .cse25 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse26 (mod .cse27 4294967296)))))) (or (forall ((v_prenex_31 Int)) (let ((.cse28 (mod v_prenex_31 4294967296)) (.cse29 (mod c_main_~x~0 4294967296))) (let ((.cse30 (div .cse28 .cse29))) (or (not (= (mod .cse28 .cse29) 0)) (< .cse29 (mod (+ .cse30 4294967295) 4294967296)) (< .cse29 (mod .cse30 4294967296)) (<= .cse28 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse29 (mod (+ .cse30 1) 4294967296)))))) .cse0) (or .cse0 (forall ((v_prenex_22 Int)) (let ((.cse31 (mod v_prenex_22 4294967296)) (.cse32 (mod c_main_~x~0 4294967296))) (let ((.cse33 (div .cse31 .cse32))) (or (< .cse31 0) (< .cse32 (mod (+ .cse33 4294967295) 4294967296)) (<= .cse31 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse32 (mod .cse33 4294967296))))))) (or .cse18 (forall ((v_prenex_4 Int)) (let ((.cse34 (mod v_prenex_4 4294967296)) (.cse35 (mod c_main_~x~0 4294967296))) (or (<= .cse34 (mod (+ c_main_~x~0 1) 4294967296)) (= (mod .cse34 .cse35) 0) (<= 0 .cse34) (< .cse35 (mod (+ (div .cse34 .cse35) 1) 4294967296)))))) (or (forall ((v_prenex_30 Int)) (let ((.cse36 (mod v_prenex_30 4294967296)) (.cse37 (mod c_main_~x~0 4294967296))) (let ((.cse38 (div .cse36 .cse37))) (or (< .cse36 0) (< .cse37 (mod (+ .cse38 1) 4294967296)) (<= .cse36 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse37 (mod .cse38 4294967296)))))) .cse18) (or .cse18 (forall ((v_prenex_16 Int)) (let ((.cse39 (mod v_prenex_16 4294967296)) (.cse40 (mod c_main_~x~0 4294967296))) (let ((.cse41 (div .cse39 .cse40))) (or (= (mod .cse39 .cse40) 0) (<= .cse39 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse39) (< .cse40 (mod .cse41 4294967296)) (< .cse40 (mod (+ .cse41 4294967295) 4294967296)) (< .cse40 (mod (+ .cse41 1) 4294967296))))))) (or .cse0 (forall ((v_prenex_5 Int)) (let ((.cse44 (mod v_prenex_5 4294967296)) (.cse42 (mod c_main_~x~0 4294967296))) (let ((.cse43 (div .cse44 .cse42))) (or (< .cse42 (mod .cse43 4294967296)) (<= .cse44 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse42 (mod (+ .cse43 4294967295) 4294967296)) (< .cse44 0) (< .cse42 (mod (+ .cse43 1) 4294967296))))))) (or (forall ((v_prenex_2 Int)) (let ((.cse45 (mod v_prenex_2 4294967296)) (.cse46 (mod c_main_~x~0 4294967296))) (let ((.cse47 (div .cse45 .cse46))) (or (<= 0 .cse45) (< .cse46 (mod (+ .cse47 1) 4294967296)) (= (mod .cse45 .cse46) 0) (< .cse46 (mod (+ .cse47 4294967295) 4294967296)) (<= .cse45 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse46 (mod .cse47 4294967296)))))) .cse0) (forall ((v_prenex_27 Int)) (let ((.cse50 (mod v_prenex_27 4294967296)) (.cse48 (mod c_main_~x~0 4294967296))) (let ((.cse49 (div .cse50 .cse48))) (or (< .cse48 (mod (+ .cse49 1) 4294967296)) (<= .cse50 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse48 (mod .cse49 4294967296)) (< .cse48 (mod (+ .cse49 4294967295) 4294967296)))))) (forall ((v_prenex_25 Int)) (let ((.cse53 (mod v_prenex_25 4294967296)) (.cse51 (mod c_main_~x~0 4294967296))) (let ((.cse52 (div .cse53 .cse51))) (or (< .cse51 (mod .cse52 4294967296)) (not (= (mod .cse53 .cse51) 0)) (< .cse51 (mod (+ .cse52 1) 4294967296)) (<= .cse53 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_20 Int)) (let ((.cse54 (mod v_prenex_20 4294967296)) (.cse55 (mod c_main_~x~0 4294967296))) (let ((.cse56 (div .cse54 .cse55))) (or (<= .cse54 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse55 (mod (+ .cse56 1) 4294967296)) (< .cse55 (mod .cse56 4294967296)))))) .cse18) (forall ((v_prenex_24 Int)) (let ((.cse57 (mod v_prenex_24 4294967296)) (.cse58 (mod c_main_~x~0 4294967296))) (let ((.cse59 (div .cse57 .cse58))) (or (<= .cse57 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse57 0) (< .cse58 (mod .cse59 4294967296)) (< .cse58 (mod (+ .cse59 4294967295) 4294967296)))))) (or (forall ((v_prenex_7 Int)) (let ((.cse60 (mod v_prenex_7 4294967296)) (.cse61 (mod c_main_~x~0 4294967296))) (let ((.cse62 (div .cse60 .cse61))) (or (<= .cse60 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse61 (mod .cse62 4294967296)) (< .cse61 (mod (+ .cse62 4294967295) 4294967296)) (< .cse61 (mod (+ .cse62 1) 4294967296)))))) .cse18) (forall ((v_prenex_11 Int)) (let ((.cse65 (mod v_prenex_11 4294967296)) (.cse63 (mod c_main_~x~0 4294967296))) (let ((.cse64 (div .cse65 .cse63))) (or (< .cse63 (mod (+ .cse64 4294967295) 4294967296)) (< .cse63 (mod (+ .cse64 1) 4294967296)) (= (mod .cse65 .cse63) 0) (<= 0 .cse65) (<= .cse65 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_21 Int)) (let ((.cse66 (mod v_prenex_21 4294967296)) (.cse67 (mod c_main_~x~0 4294967296))) (let ((.cse68 (div .cse66 .cse67))) (or (<= .cse66 (mod (+ c_main_~x~0 1) 4294967296)) (<= 0 .cse66) (< .cse67 (mod (+ .cse68 1) 4294967296)) (= (mod .cse66 .cse67) 0) (< .cse67 (mod .cse68 4294967296)))))) .cse18) (forall ((v_prenex_14 Int)) (let ((.cse69 (mod c_main_~x~0 4294967296)) (.cse70 (mod v_prenex_14 4294967296))) (or (< .cse69 (mod (div .cse70 .cse69) 4294967296)) (not (= (mod .cse70 .cse69) 0)) (<= .cse70 (mod (+ c_main_~x~0 1) 4294967296))))) (forall ((v_prenex_9 Int)) (let ((.cse71 (mod v_prenex_9 4294967296)) (.cse72 (mod c_main_~x~0 4294967296))) (let ((.cse73 (div .cse71 .cse72))) (or (not (= (mod .cse71 .cse72) 0)) (< .cse72 (mod .cse73 4294967296)) (< .cse72 (mod (+ .cse73 4294967295) 4294967296)) (<= .cse71 (mod (+ c_main_~x~0 1) 4294967296)))))) (forall ((v_prenex_6 Int)) (let ((.cse74 (mod v_prenex_6 4294967296))) (or (<= .cse74 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse75 (mod c_main_~x~0 4294967296))) (< .cse75 (mod (div .cse74 .cse75) 4294967296))) (< .cse74 0)))) (or (forall ((v_prenex_8 Int)) (let ((.cse77 (mod v_prenex_8 4294967296))) (or (let ((.cse76 (mod c_main_~x~0 4294967296))) (< .cse76 (mod (div .cse77 .cse76) 4294967296))) (<= .cse77 (mod (+ c_main_~x~0 1) 4294967296)) (< .cse77 0)))) .cse0) (forall ((v_prenex_3 Int)) (let ((.cse80 (mod v_prenex_3 4294967296)) (.cse78 (mod c_main_~x~0 4294967296))) (let ((.cse79 (div .cse80 .cse78))) (or (< .cse78 (mod (+ .cse79 1) 4294967296)) (< .cse78 (mod (+ .cse79 4294967295) 4294967296)) (not (= (mod .cse80 .cse78) 0)) (< .cse78 (mod .cse79 4294967296)) (<= .cse80 (mod (+ c_main_~x~0 1) 4294967296)))))) (or .cse18 (forall ((v_prenex_17 Int)) (let ((.cse81 (mod c_main_~x~0 4294967296)) (.cse82 (mod v_prenex_17 4294967296))) (or (< .cse81 (mod (div .cse82 .cse81) 4294967296)) (not (= (mod .cse82 .cse81) 0)) (<= .cse82 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_29 Int)) (let ((.cse83 (mod v_prenex_29 4294967296))) (or (<= .cse83 (mod (+ c_main_~x~0 1) 4294967296)) (let ((.cse84 (mod c_main_~x~0 4294967296))) (< .cse84 (mod (div .cse83 .cse84) 4294967296))) (< .cse83 0)))) .cse18) (forall ((v_prenex_1 Int)) (let ((.cse85 (mod v_prenex_1 4294967296)) (.cse86 (mod c_main_~x~0 4294967296))) (let ((.cse87 (div .cse85 .cse86))) (or (< .cse85 0) (< .cse86 (mod (+ .cse87 1) 4294967296)) (not (= (mod .cse85 .cse86) 0)) (< .cse86 (mod .cse87 4294967296)) (<= .cse85 (mod (+ c_main_~x~0 1) 4294967296)))))) (or (forall ((v_prenex_28 Int)) (let ((.cse90 (mod v_prenex_28 4294967296)) (.cse88 (mod c_main_~x~0 4294967296))) (let ((.cse89 (div .cse90 .cse88))) (or (< .cse88 (mod (+ .cse89 4294967295) 4294967296)) (< .cse88 (mod .cse89 4294967296)) (<= .cse90 (mod (+ c_main_~x~0 1) 4294967296)))))) .cse0)))) is different from false [2019-10-03 02:31:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-10-03 02:31:44,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-03 02:31:44,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-03 02:31:44,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:31:44,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:31:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:31:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2019-10-03 02:31:44,671 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-10-03 02:31:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:44,757 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-10-03 02:31:44,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:31:44,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-03 02:31:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:44,758 INFO L225 Difference]: With dead ends: 9 [2019-10-03 02:31:44,758 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:31:44,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2019-10-03 02:31:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:31:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:31:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:31:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:31:44,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-10-03 02:31:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:44,760 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:31:44,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:31:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:31:44,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:31:44,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:31:44 BoogieIcfgContainer [2019-10-03 02:31:44,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:31:44,769 INFO L168 Benchmark]: Toolchain (without parser) took 14914.14 ms. Allocated memory was 137.9 MB in the beginning and 267.9 MB in the end (delta: 130.0 MB). Free memory was 85.2 MB in the beginning and 154.8 MB in the end (delta: -69.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:44,770 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:31:44,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.56 ms. Allocated memory is still 137.9 MB. Free memory was 85.0 MB in the beginning and 75.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:44,772 INFO L168 Benchmark]: Boogie Preprocessor took 135.08 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 75.7 MB in the beginning and 176.1 MB in the end (delta: -100.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:44,773 INFO L168 Benchmark]: RCFGBuilder took 246.93 ms. Allocated memory is still 198.7 MB. Free memory was 176.1 MB in the beginning and 163.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:44,774 INFO L168 Benchmark]: TraceAbstraction took 14267.08 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 163.8 MB in the beginning and 154.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 78.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:44,778 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.56 ms. Allocated memory is still 137.9 MB. Free memory was 85.0 MB in the beginning and 75.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.08 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 75.7 MB in the beginning and 176.1 MB in the end (delta: -100.4 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 246.93 ms. Allocated memory is still 198.7 MB. Free memory was 176.1 MB in the beginning and 163.8 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14267.08 ms. Allocated memory was 198.7 MB in the beginning and 267.9 MB in the end (delta: 69.2 MB). Free memory was 163.8 MB in the beginning and 154.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 78.3 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 9 SDslu, 77 SDs, 0 SdLazy, 72 SolverSat, 3 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 5 QuantifiedInterpolants, 75442 SizeOfPredicates, 7 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...