java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:05:32,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:05:32,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:05:32,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:05:32,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:05:32,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:05:32,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:05:32,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:05:32,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:05:32,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:05:32,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:05:32,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:05:32,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:05:32,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:05:32,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:05:32,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:05:32,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:05:32,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:05:32,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:05:32,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:05:32,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:05:32,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:05:32,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:05:32,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:05:32,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:05:32,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:05:32,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:05:32,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:05:32,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:05:32,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:05:32,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:05:32,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:05:32,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:05:32,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:05:32,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:05:32,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:05:32,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:05:32,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:05:32,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:05:32,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:05:32,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:05:32,363 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:05:32,381 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:05:32,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:05:32,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:05:32,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:05:32,383 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:05:32,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:05:32,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:05:32,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:05:32,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:05:32,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:05:32,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:05:32,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:05:32,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:05:32,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:05:32,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:05:32,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:05:32,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:05:32,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:05:32,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:05:32,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:05:32,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:05:32,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:05:32,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:05:32,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:05:32,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:05:32,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:05:32,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:05:32,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:05:32,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:05:32,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:05:32,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:05:32,682 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:05:32,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:05:32,684 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:05:32,684 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-13 21:05:32,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eb0a72f/90556be07a524133be4016d8f0bcbe23/FLAG4beeb6bd8 [2019-10-13 21:05:33,267 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:05:33,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2019-10-13 21:05:33,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eb0a72f/90556be07a524133be4016d8f0bcbe23/FLAG4beeb6bd8 [2019-10-13 21:05:33,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5eb0a72f/90556be07a524133be4016d8f0bcbe23 [2019-10-13 21:05:33,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:05:33,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:05:33,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:33,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:05:33,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:05:33,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c329617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33, skipping insertion in model container [2019-10-13 21:05:33,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,650 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:05:33,664 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:05:33,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:33,843 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:05:33,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:05:33,871 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:05:33,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33 WrapperNode [2019-10-13 21:05:33,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:05:33,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:05:33,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:05:33,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:05:33,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (1/1) ... [2019-10-13 21:05:33,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:05:33,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:05:33,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:05:33,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:05:33,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (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-13 21:05:34,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:05:34,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:05:34,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:05:34,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:05:34,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:05:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:05:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 21:05:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:05:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:05:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:05:34,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:05:34,221 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:05:34,222 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:05:34,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:34 BoogieIcfgContainer [2019-10-13 21:05:34,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:05:34,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:05:34,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:05:34,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:05:34,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:05:33" (1/3) ... [2019-10-13 21:05:34,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3804cf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:34, skipping insertion in model container [2019-10-13 21:05:34,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:05:33" (2/3) ... [2019-10-13 21:05:34,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3804cf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:05:34, skipping insertion in model container [2019-10-13 21:05:34,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:05:34" (3/3) ... [2019-10-13 21:05:34,239 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_2-2.c [2019-10-13 21:05:34,254 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:05:34,263 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:05:34,275 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:05:34,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:05:34,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:05:34,326 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:05:34,327 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:05:34,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:05:34,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:05:34,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:05:34,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:05:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:05:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 21:05:34,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:34,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:34,379 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash -133618162, now seen corresponding path program 1 times [2019-10-13 21:05:34,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:34,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318793691] [2019-10-13 21:05:34,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:34,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:34,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:34,494 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-13 21:05:34,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318793691] [2019-10-13 21:05:34,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:34,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:05:34,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504004091] [2019-10-13 21:05:34,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:05:34,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:05:34,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:05:34,514 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-13 21:05:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:34,536 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-10-13 21:05:34,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:05:34,537 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-13 21:05:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:34,546 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:05:34,547 INFO L226 Difference]: Without dead ends: 13 [2019-10-13 21:05:34,550 INFO L600 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-13 21:05:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-13 21:05:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-13 21:05:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-13 21:05:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-13 21:05:34,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-10-13 21:05:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:34,590 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-13 21:05:34,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:05:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-13 21:05:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 21:05:34,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:34,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:34,592 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:34,592 INFO L82 PathProgramCache]: Analyzing trace with hash -142853372, now seen corresponding path program 1 times [2019-10-13 21:05:34,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:34,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212490616] [2019-10-13 21:05:34,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:34,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:34,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:34,912 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-13 21:05:34,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212490616] [2019-10-13 21:05:34,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:05:34,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:05:34,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639251711] [2019-10-13 21:05:34,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:05:34,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:05:34,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:05:34,918 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-10-13 21:05:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:37,023 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-13 21:05:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:05:37,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-10-13 21:05:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:37,028 INFO L225 Difference]: With dead ends: 20 [2019-10-13 21:05:37,029 INFO L226 Difference]: Without dead ends: 15 [2019-10-13 21:05:37,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:05:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-13 21:05:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-13 21:05:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 21:05:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-13 21:05:37,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-10-13 21:05:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:37,037 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-13 21:05:37,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:05:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-13 21:05:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:05:37,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:37,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:37,039 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1232195137, now seen corresponding path program 1 times [2019-10-13 21:05:37,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:37,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563917426] [2019-10-13 21:05:37,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:37,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:37,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:37,055 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:05:37,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80015723] [2019-10-13 21:05:37,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:05:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:37,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:05:37,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:05:37,167 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-13 21:05:37,167 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:05:37,316 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-13 21:05:37,333 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-13 21:05:37,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563917426] [2019-10-13 21:05:37,335 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:05:37,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80015723] [2019-10-13 21:05:37,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:05:37,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-13 21:05:37,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024915685] [2019-10-13 21:05:37,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:05:37,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:05:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2019-10-13 21:05:37,338 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2019-10-13 21:05:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:39,380 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-13 21:05:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:05:39,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:05:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:39,384 INFO L225 Difference]: With dead ends: 21 [2019-10-13 21:05:39,385 INFO L226 Difference]: Without dead ends: 16 [2019-10-13 21:05:39,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2019-10-13 21:05:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-13 21:05:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-13 21:05:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-13 21:05:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-13 21:05:39,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2019-10-13 21:05:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:39,390 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-13 21:05:39,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:05:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-10-13 21:05:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:05:39,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:39,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:39,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:05:39,593 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:39,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1289453439, now seen corresponding path program 1 times [2019-10-13 21:05:39,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:39,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534180777] [2019-10-13 21:05:39,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:39,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:39,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:39,599 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:05:39,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70727233] [2019-10-13 21:05:39,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:05:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:39,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:05:39,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:05:39,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:39,740 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-13 21:05:39,740 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:05:39,855 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-13 21:05:39,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534180777] [2019-10-13 21:05:39,856 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:05:39,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70727233] [2019-10-13 21:05:39,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:05:39,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2019-10-13 21:05:39,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803468601] [2019-10-13 21:05:39,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:05:39,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:39,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:05:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:05:39,858 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-10-13 21:05:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:46,080 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-13 21:05:46,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:05:46,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-10-13 21:05:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:46,083 INFO L225 Difference]: With dead ends: 21 [2019-10-13 21:05:46,084 INFO L226 Difference]: Without dead ends: 16 [2019-10-13 21:05:46,084 INFO L600 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-13 21:05:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-13 21:05:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-13 21:05:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 21:05:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-13 21:05:46,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-10-13 21:05:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:46,091 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-13 21:05:46,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:05:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-13 21:05:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:05:46,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:05:46,094 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:05:46,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:05:46,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:05:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1005461508, now seen corresponding path program 1 times [2019-10-13 21:05:46,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:05:46,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29087457] [2019-10-13 21:05:46,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,300 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:05:46,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:05:46,305 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:05:46,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116134300] [2019-10-13 21:05:46,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 21:05:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:05:46,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:05:46,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:05:46,421 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-13 21:05:46,421 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:05:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:05:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:05:48,729 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-13 21:05:50,797 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-13 21:05:51,204 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-13 21:05:51,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29087457] [2019-10-13 21:05:51,205 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:05:51,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116134300] [2019-10-13 21:05:51,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [867306478] [2019-10-13 21:05:51,215 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 16 [2019-10-13 21:05:51,255 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:05:51,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:05:51,331 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:05:51,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:05:51,619 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-13 21:05:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:05:51,624 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:05:51,624 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:05:51,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-13 21:05:51,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620858777] [2019-10-13 21:05:51,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:05:51,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:05:51,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:05:51,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2019-10-13 21:05:51,627 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-10-13 21:05:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:05:52,672 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-10-13 21:05:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:05:52,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-10-13 21:05:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:05:52,673 INFO L225 Difference]: With dead ends: 17 [2019-10-13 21:05:52,673 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:05:52,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=12, Invalid=14, Unknown=2, NotChecked=14, Total=42 [2019-10-13 21:05:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:05:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:05:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:05:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:05:52,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-10-13 21:05:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:05:52,675 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:05:52,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:05:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:05:52,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:05:52,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:05:52,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:05:52,980 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 21:05:52,980 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:52,981 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:05:52,981 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:05:52,981 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:05:52,981 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:05:52,981 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2019-10-13 21:05:52,982 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2019-10-13 21:05:52,982 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-10-13 21:05:52,982 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 18 24) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) [2019-10-13 21:05:52,982 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-10-13 21:05:52,982 INFO L439 ceAbstractionStarter]: At program point L18-2(lines 18 24) the Hoare annotation is: (= (mod main_~y~0 4294967296) (mod main_~x~0 4294967296)) [2019-10-13 21:05:52,982 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2019-10-13 21:05:52,983 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2019-10-13 21:05:52,983 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-10-13 21:05:52,983 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2019-10-13 21:05:52,983 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-10-13 21:05:52,983 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-10-13 21:05:52,983 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2019-10-13 21:05:53,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:05:53 BoogieIcfgContainer [2019-10-13 21:05:53,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:05:53,014 INFO L168 Benchmark]: Toolchain (without parser) took 19381.22 ms. Allocated memory was 138.4 MB in the beginning and 244.3 MB in the end (delta: 105.9 MB). Free memory was 102.5 MB in the beginning and 148.5 MB in the end (delta: -46.1 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:53,015 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 138.4 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 21:05:53,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.78 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 92.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:53,017 INFO L168 Benchmark]: Boogie Preprocessor took 103.02 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 181.1 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:53,017 INFO L168 Benchmark]: RCFGBuilder took 250.55 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 170.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:53,018 INFO L168 Benchmark]: TraceAbstraction took 18783.81 ms. Allocated memory was 202.4 MB in the beginning and 244.3 MB in the end (delta: 41.9 MB). Free memory was 169.4 MB in the beginning and 148.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:05:53,023 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28 ms. Allocated memory is still 138.4 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.78 ms. Allocated memory is still 138.4 MB. Free memory was 102.1 MB in the beginning and 92.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.02 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 181.1 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 250.55 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 170.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18783.81 ms. Allocated memory was 202.4 MB in the beginning and 244.3 MB in the end (delta: 41.9 MB). Free memory was 169.4 MB in the beginning and 148.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x == 1 && 4294967296 * (y / 4294967296) + x <= y + 4294967296 * (x / 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 18.6s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 56 SDtfs, 9 SDslu, 84 SDs, 0 SdLazy, 76 SolverSat, 3 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 6.0s 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.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 31 HoareAnnotationTreeSize, 11 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 95 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 5 QuantifiedInterpolants, 75442 SizeOfPredicates, 7 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 8/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...