java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:30:57,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:30:57,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:30:57,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:30:57,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:30:57,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:30:57,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:30:57,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:30:57,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:30:57,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:30:57,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:30:57,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:30:57,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:30:57,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:30:57,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:30:57,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:30:57,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:30:57,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:30:57,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:30:57,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:30:57,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:30:57,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:30:57,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:30:57,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:30:57,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:30:57,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:30:57,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:30:57,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:30:57,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:30:57,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:30:57,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:30:57,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:30:57,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:30:57,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:30:57,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:30:57,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:30:57,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:30:57,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:30:57,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:30:57,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:30:57,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:30:57,506 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-07 13:30:57,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:30:57,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:30:57,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:30:57,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:30:57,545 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:30:57,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:30:57,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:30:57,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:30:57,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:30:57,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:30:57,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:30:57,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:30:57,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:30:57,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:30:57,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:30:57,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:30:57,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:30:57,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:30:57,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:30:57,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:30:57,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:30:57,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:30:57,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:30:57,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:30:57,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:30:57,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:30:57,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:30:57,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:30:57,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:30:57,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:30:57,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:30:57,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:30:57,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:30:57,831 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:30:57,831 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2019-10-07 13:30:57,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abea5cb3/f47a925a80594faeb1a71094ad0abff5/FLAG6e4d2b544 [2019-10-07 13:30:58,317 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:30:58,317 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2019-10-07 13:30:58,323 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abea5cb3/f47a925a80594faeb1a71094ad0abff5/FLAG6e4d2b544 [2019-10-07 13:30:58,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abea5cb3/f47a925a80594faeb1a71094ad0abff5 [2019-10-07 13:30:58,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:30:58,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:30:58,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:30:58,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:30:58,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:30:58,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:58,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6581bd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58, skipping insertion in model container [2019-10-07 13:30:58,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:58,748 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:30:58,765 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:30:58,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:30:58,941 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:30:58,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:30:58,970 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:30:58,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58 WrapperNode [2019-10-07 13:30:58,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:30:58,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:30:58,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:30:58,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:30:59,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (1/1) ... [2019-10-07 13:30:59,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:30:59,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:30:59,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:30:59,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:30:59,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (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-07 13:30:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:30:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:30:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:30:59,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:30:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:30:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:30:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:30:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:30:59,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:30:59,325 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:30:59,325 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:30:59,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:30:59 BoogieIcfgContainer [2019-10-07 13:30:59,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:30:59,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:30:59,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:30:59,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:30:59,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:30:58" (1/3) ... [2019-10-07 13:30:59,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2d1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:30:59, skipping insertion in model container [2019-10-07 13:30:59,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:58" (2/3) ... [2019-10-07 13:30:59,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2d1487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:30:59, skipping insertion in model container [2019-10-07 13:30:59,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:30:59" (3/3) ... [2019-10-07 13:30:59,334 INFO L109 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2019-10-07 13:30:59,343 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:30:59,350 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:30:59,361 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:30:59,383 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:30:59,383 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:30:59,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:30:59,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:30:59,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:30:59,384 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:30:59,384 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:30:59,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:30:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:30:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:30:59,405 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:59,406 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:59,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1869232855, now seen corresponding path program 1 times [2019-10-07 13:30:59,421 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:59,422 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:59,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:59,422 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:59,683 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-10-07 13:30:59,686 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-07 13:30:59,686 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:59,687 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:30:59,687 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:30:59,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:30:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:30:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:30:59,709 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:30:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:59,755 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-07 13:30:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:30:59,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:30:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:59,766 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:30:59,766 INFO L226 Difference]: Without dead ends: 12 [2019-10-07 13:30:59,769 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:30:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-07 13:30:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-07 13:30:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:30:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-07 13:30:59,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-07 13:30:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:59,809 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-07 13:30:59,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:30:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-07 13:30:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:30:59,810 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:59,811 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:59,811 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1455464170, now seen corresponding path program 1 times [2019-10-07 13:30:59,812 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:59,812 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:59,812 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:59,813 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:59,976 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-07 13:30:59,976 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:59,977 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:59,977 INFO L95 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-07 13:31:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:00,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-07 13:31:00,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:00,073 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-07 13:31:00,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:31:00,117 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-07 13:31:00,117 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:31:00,140 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:31:00,140 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:31:00,149 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:31:00,160 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:31:00,161 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:31:00,225 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:31:00,473 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2019-10-07 13:31:00,515 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:31:00,523 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:31:00,523 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:31:00,523 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 76#(and (not (< (mod main_~x~0 4294967296) 6)) (<= 0 main_~x~0)) [2019-10-07 13:31:00,524 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:31:00,524 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:31:00,524 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#true [2019-10-07 13:31:00,524 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 71#(<= 0 main_~x~0) [2019-10-07 13:31:00,525 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:31:00,525 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 100#true [2019-10-07 13:31:00,525 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_1 Int) (v_main_~y~0_BEFORE_CALL_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647)) (not (< (mod v_prenex_1 4294967296) 0))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (= (mod (mod v_prenex_1 4294967296) 3) 0) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (not (< (mod v_prenex_1 4294967296) 0))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (= (mod (mod v_prenex_1 4294967296) 3) 0)) (and (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647) (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:00,526 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_1 Int) (v_main_~y~0_BEFORE_CALL_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647)) (not (< (mod v_prenex_1 4294967296) 0))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (= (mod (mod v_prenex_1 4294967296) 3) 0) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (not (< (mod v_prenex_1 4294967296) 0))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (= (mod (mod v_prenex_1 4294967296) 3) 0)) (and (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647) (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:00,526 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_1 Int) (v_main_~y~0_BEFORE_CALL_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647)) (not (< (mod v_prenex_1 4294967296) 0))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (= (mod (mod v_prenex_1 4294967296) 3) 0) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (not (< (mod v_prenex_1 4294967296) 0))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (= (mod (mod v_prenex_1 4294967296) 3) 0)) (and (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647) (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0))))) [2019-10-07 13:31:00,527 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_1 Int) (v_main_~y~0_BEFORE_CALL_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647)) (not (< (mod v_prenex_1 4294967296) 0))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) (- 4294967296))) (= (mod (mod v_prenex_1 4294967296) 3) 0) (not (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (not (< (mod v_prenex_1 4294967296) 0))) (and (<= (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_1 4294967296) 3) 4294967296)) (= (mod (mod v_prenex_1 4294967296) 3) 0)) (and (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 4294967293) 4294967296) 2147483647) (< (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 0) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_1 4294967296) 3) 0))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:00,782 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:31:00,783 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 6] total 12 [2019-10-07 13:31:00,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:31:00,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:31:00,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:31:00,786 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-10-07 13:31:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:31:01,016 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-07 13:31:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:31:01,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-10-07 13:31:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:31:01,018 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:31:01,019 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 13:31:01,020 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:31:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 13:31:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 13:31:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:31:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-07 13:31:01,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-10-07 13:31:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:31:01,026 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-07 13:31:01,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:31:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-07 13:31:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:31:01,027 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:31:01,027 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:31:01,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:01,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:31:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:31:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1007933545, now seen corresponding path program 2 times [2019-10-07 13:31:01,232 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:31:01,232 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:01,232 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:01,233 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:31:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:01,358 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:01,359 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:31:01,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-07 13:31:01,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:31:01,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:31:01,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 13:31:01,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:01,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:31:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:01,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:31:01,505 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:31:01,505 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:31:01,506 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:31:01,506 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:31:01,506 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:31:01,519 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:31:01,592 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 57 for LOIs [2019-10-07 13:31:01,606 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:31:01,608 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:31:01,609 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:31:01,609 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 76#(and (not (< (mod main_~x~0 4294967296) 6)) (<= 0 main_~x~0)) [2019-10-07 13:31:01,609 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:31:01,610 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:31:01,610 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 108#true [2019-10-07 13:31:01,610 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 71#(<= 0 main_~x~0) [2019-10-07 13:31:01,610 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:31:01,611 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 103#true [2019-10-07 13:31:01,611 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 99#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:01,611 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 94#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:01,612 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_2 Int) (v_main_~y~0_BEFORE_CALL_2 Int)) (or (and (<= (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296) 2147483647) (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296))) (and (<= (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296) 2147483647) (<= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296)) (= (mod (mod v_prenex_2 4294967296) 3) 0)) (and (= (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 0) (= (+ (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) 2147483647)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) 2147483647))) (and (not (= (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 0)) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) (- 4294967296))) (< (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 0) (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) 2147483647)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) 2147483647))) (and (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) 2147483647) (not (= (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 0)) (= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) |__VERIFIER_assert_#in~cond|) (< (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 0) (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296) 2147483647) (not (< (mod v_prenex_2 4294967296) 0)) (not (<= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296))) (and (<= (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296) 2147483647) (< (mod v_prenex_2 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (= (mod (mod v_prenex_2 4294967296) 3) 0))) (and (<= (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296) 2147483647) (< (mod v_prenex_2 4294967296) 0) (<= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) |__VERIFIER_assert_#in~cond|) (not (= (mod (mod v_prenex_2 4294967296) 3) 0))) (and (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 0) (= (+ (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 0)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (+ (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 0)) (= (+ (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967296) 2147483647)) (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_2 4294967296) 3) 4294967293) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296) 2147483647) (not (<= (mod (+ (mod (mod v_prenex_2 4294967296) 3) 4294967293) 4294967296) 2147483647)) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_2 4294967296) 3) 4294967296)) (= (mod (mod v_prenex_2 4294967296) 3) 0)))) [2019-10-07 13:31:01,612 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 89#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) [2019-10-07 13:31:01,862 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:31:01,862 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 6] total 18 [2019-10-07 13:31:01,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-07 13:31:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-07 13:31:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:31:01,865 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 18 states. [2019-10-07 13:31:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:31:03,245 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-10-07 13:31:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:31:03,246 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-07 13:31:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:31:03,246 INFO L225 Difference]: With dead ends: 22 [2019-10-07 13:31:03,247 INFO L226 Difference]: Without dead ends: 17 [2019-10-07 13:31:03,247 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:31:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-07 13:31:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-07 13:31:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-07 13:31:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-10-07 13:31:03,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-10-07 13:31:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:31:03,253 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-10-07 13:31:03,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-07 13:31:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-10-07 13:31:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:31:03,254 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:31:03,254 INFO L385 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:31:03,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:03,465 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:31:03,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:31:03,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1779402249, now seen corresponding path program 3 times [2019-10-07 13:31:03,466 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:31:03,466 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:03,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:03,467 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:31:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:05,736 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 178956971 c_main_~y~0))) (<= (* 536870912 (div (+ .cse0 715827879) 536870912)) (+ .cse0 178956968))) is different from false [2019-10-07 13:31:08,129 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 11 [2019-10-07 13:31:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 6 not checked. [2019-10-07 13:31:22,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:22,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:31:22,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-07 13:31:22,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:31:22,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:31:22,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-07 13:31:22,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:48,163 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-07 13:31:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:50,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:32:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:32:38,084 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:32:38,086 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:32:38,086 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:32:38,086 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:32:38,087 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:32:38,087 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:32:38,124 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:32:38,196 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 57 for LOIs [2019-10-07 13:32:38,206 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:32:38,208 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:32:38,208 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:32:38,209 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 76#(and (not (< (mod main_~x~0 4294967296) 6)) (<= 0 main_~x~0)) [2019-10-07 13:32:38,209 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:32:38,209 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:32:38,209 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 108#true [2019-10-07 13:32:38,210 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 71#(<= 0 main_~x~0) [2019-10-07 13:32:38,210 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:32:38,210 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 103#true [2019-10-07 13:32:38,210 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 99#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:38,211 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 94#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:38,211 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_3 Int) (v_main_~y~0_BEFORE_CALL_4 Int)) (or (and (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296) 2147483647) (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3))) (and (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296)) (not (< (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 0)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296) 2147483647)) (and (= 0 (mod (mod v_prenex_3 4294967296) 3)) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296)) (<= (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) 2147483647) (not (<= (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) 2147483647))) (and (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) 2147483647)) (= (+ (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296) 2147483647) (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3))) (and (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) 2147483647)) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296) 2147483647)) (and (<= (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) 2147483647) (not (= 0 (mod (mod v_prenex_3 4294967296) 3))) (< (mod v_prenex_3 4294967296) 0) (= (+ (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) 2147483647))) (and (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) 2147483647) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296) 2147483647)) (and (not (<= (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) 2147483647)) (= (+ (mod (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 0)) (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_4 4294967296) 3) 4294967293) 4294967296) 2147483647)) (and (not (= 0 (mod (mod v_prenex_3 4294967296) 3))) (< (mod v_prenex_3 4294967296) 0) (= (+ (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (<= (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_prenex_3 4294967296) 0)) (= (+ (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (<= (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) 2147483647))) (and (= 0 (mod (mod v_prenex_3 4294967296) 3)) (= (+ (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (<= (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_prenex_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296)) (<= (mod (mod (mod v_prenex_3 4294967296) 3) 4294967296) 2147483647) (not (<= (mod (+ (mod (mod v_prenex_3 4294967296) 3) 4294967293) 4294967296) 2147483647))))) [2019-10-07 13:32:38,211 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 89#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) [2019-10-07 13:32:52,722 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:32:52,723 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 6] total 30 [2019-10-07 13:32:52,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 13:32:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 13:32:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=661, Unknown=27, NotChecked=54, Total=870 [2019-10-07 13:32:52,724 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 30 states. [2019-10-07 13:32:53,723 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-10-07 13:32:58,636 WARN L838 $PredicateComparison]: unable to prove that (and (not (let ((.cse0 (* 2 c_main_~y~0))) (= (let ((.cse3 (div .cse0 4294967296))) (let ((.cse2 (* (- 4294967296) .cse3))) (let ((.cse1 (div (+ .cse0 .cse2) 3))) (+ (* 4294967296 (div (+ .cse0 (* (- 3) .cse1) .cse2) 4294967296)) (* 3 .cse1) (* 4294967296 .cse3))))) .cse0))) (not (let ((.cse4 (* 4 c_main_~y~0))) (= .cse4 (let ((.cse7 (div .cse4 4294967296))) (let ((.cse6 (* (- 4294967296) .cse7))) (let ((.cse5 (div (+ .cse4 .cse6) 3))) (+ (* 4294967296 (div (+ .cse4 (* (- 3) .cse5) .cse6) 4294967296)) (* 3 .cse5) (* 4294967296 .cse7)))))))) (not (let ((.cse8 (* 64 c_main_~y~0))) (= .cse8 (let ((.cse9 (div .cse8 4294967296))) (let ((.cse11 (* (- 4294967296) .cse9))) (let ((.cse10 (div (+ .cse11 .cse8) 3))) (+ (* 4294967296 .cse9) (* 3 .cse10) (* 4294967296 (div (+ .cse11 (* (- 3) .cse10) .cse8) 4294967296))))))))) (not (let ((.cse14 (* 8 c_main_~y~0))) (= (let ((.cse12 (div .cse14 4294967296))) (let ((.cse15 (* (- 4294967296) .cse12))) (let ((.cse13 (div (+ .cse14 .cse15) 3))) (+ (* 4294967296 .cse12) (* 3 .cse13) (* 4294967296 (div (+ .cse14 .cse15 (* (- 3) .cse13)) 4294967296)))))) .cse14))) (not (let ((.cse19 (* 32 c_main_~y~0))) (= (let ((.cse16 (div .cse19 4294967296))) (let ((.cse18 (* (- 4294967296) .cse16))) (let ((.cse17 (div (+ .cse18 .cse19) 3))) (+ (* 4294967296 .cse16) (* 3 .cse17) (* 4294967296 (div (+ .cse18 .cse19 (* (- 3) .cse17)) 4294967296)))))) .cse19))) (not (= c_main_~y~0 (let ((.cse20 (div c_main_~y~0 4294967296))) (let ((.cse21 (* (- 4294967296) .cse20))) (let ((.cse22 (div (+ .cse21 c_main_~y~0) 3))) (+ (* 4294967296 .cse20) (* 4294967296 (div (+ .cse21 c_main_~y~0 (* (- 3) .cse22)) 4294967296)) (* 3 .cse22))))))) (not (let ((.cse23 (* 16 c_main_~y~0))) (= .cse23 (let ((.cse24 (div .cse23 4294967296))) (let ((.cse25 (* (- 4294967296) .cse24))) (let ((.cse26 (div (+ .cse25 .cse23) 3))) (+ (* 4294967296 .cse24) (* 4294967296 (div (+ .cse25 .cse23 (* (- 3) .cse26)) 4294967296)) (* 3 .cse26)))))))) (<= 0 c_main_~x~0)) is different from false [2019-10-07 13:33:02,799 WARN L838 $PredicateComparison]: unable to prove that (and (not (let ((.cse0 (* 2 c_main_~y~0))) (= (let ((.cse3 (div .cse0 4294967296))) (let ((.cse2 (* (- 4294967296) .cse3))) (let ((.cse1 (div (+ .cse0 .cse2) 3))) (+ (* 4294967296 (div (+ .cse0 (* (- 3) .cse1) .cse2) 4294967296)) (* 3 .cse1) (* 4294967296 .cse3))))) .cse0))) (not (let ((.cse4 (* 4 c_main_~y~0))) (= .cse4 (let ((.cse7 (div .cse4 4294967296))) (let ((.cse6 (* (- 4294967296) .cse7))) (let ((.cse5 (div (+ .cse4 .cse6) 3))) (+ (* 4294967296 (div (+ .cse4 (* (- 3) .cse5) .cse6) 4294967296)) (* 3 .cse5) (* 4294967296 .cse7)))))))) (not (let ((.cse10 (* 8 c_main_~y~0))) (= (let ((.cse8 (div .cse10 4294967296))) (let ((.cse11 (* (- 4294967296) .cse8))) (let ((.cse9 (div (+ .cse10 .cse11) 3))) (+ (* 4294967296 .cse8) (* 3 .cse9) (* 4294967296 (div (+ .cse10 .cse11 (* (- 3) .cse9)) 4294967296)))))) .cse10))) (not (let ((.cse15 (* 32 c_main_~y~0))) (= (let ((.cse12 (div .cse15 4294967296))) (let ((.cse14 (* (- 4294967296) .cse12))) (let ((.cse13 (div (+ .cse14 .cse15) 3))) (+ (* 4294967296 .cse12) (* 3 .cse13) (* 4294967296 (div (+ .cse14 .cse15 (* (- 3) .cse13)) 4294967296)))))) .cse15))) (not (= c_main_~y~0 (let ((.cse16 (div c_main_~y~0 4294967296))) (let ((.cse17 (* (- 4294967296) .cse16))) (let ((.cse18 (div (+ .cse17 c_main_~y~0) 3))) (+ (* 4294967296 .cse16) (* 4294967296 (div (+ .cse17 c_main_~y~0 (* (- 3) .cse18)) 4294967296)) (* 3 .cse18))))))) (not (let ((.cse19 (* 16 c_main_~y~0))) (= .cse19 (let ((.cse20 (div .cse19 4294967296))) (let ((.cse21 (* (- 4294967296) .cse20))) (let ((.cse22 (div (+ .cse21 .cse19) 3))) (+ (* 4294967296 .cse20) (* 4294967296 (div (+ .cse21 .cse19 (* (- 3) .cse22)) 4294967296)) (* 3 .cse22)))))))) (<= 0 c_main_~x~0)) is different from false [2019-10-07 13:33:38,147 WARN L191 SmtUtils]: Spent 17.54 s on a formula simplification that was a NOOP. DAG size: 82 [2019-10-07 13:33:52,017 WARN L838 $PredicateComparison]: unable to prove that (and (not (let ((.cse0 (* 2 c_main_~y~0))) (= (let ((.cse3 (div .cse0 4294967296))) (let ((.cse2 (* (- 4294967296) .cse3))) (let ((.cse1 (div (+ .cse0 .cse2) 3))) (+ (* 4294967296 (div (+ .cse0 (* (- 3) .cse1) .cse2) 4294967296)) (* 3 .cse1) (* 4294967296 .cse3))))) .cse0))) (not (let ((.cse4 (* 4 c_main_~y~0))) (= .cse4 (let ((.cse7 (div .cse4 4294967296))) (let ((.cse6 (* (- 4294967296) .cse7))) (let ((.cse5 (div (+ .cse4 .cse6) 3))) (+ (* 4294967296 (div (+ .cse4 (* (- 3) .cse5) .cse6) 4294967296)) (* 3 .cse5) (* 4294967296 .cse7)))))))) (not (let ((.cse10 (* 8 c_main_~y~0))) (= (let ((.cse8 (div .cse10 4294967296))) (let ((.cse11 (* (- 4294967296) .cse8))) (let ((.cse9 (div (+ .cse10 .cse11) 3))) (+ (* 4294967296 .cse8) (* 3 .cse9) (* 4294967296 (div (+ .cse10 .cse11 (* (- 3) .cse9)) 4294967296)))))) .cse10))) (not (= c_main_~y~0 (let ((.cse12 (div c_main_~y~0 4294967296))) (let ((.cse13 (* (- 4294967296) .cse12))) (let ((.cse14 (div (+ .cse13 c_main_~y~0) 3))) (+ (* 4294967296 .cse12) (* 4294967296 (div (+ .cse13 c_main_~y~0 (* (- 3) .cse14)) 4294967296)) (* 3 .cse14))))))) (not (let ((.cse15 (* 16 c_main_~y~0))) (= .cse15 (let ((.cse16 (div .cse15 4294967296))) (let ((.cse17 (* (- 4294967296) .cse16))) (let ((.cse18 (div (+ .cse17 .cse15) 3))) (+ (* 4294967296 .cse16) (* 4294967296 (div (+ .cse17 .cse15 (* (- 3) .cse18)) 4294967296)) (* 3 .cse18)))))))) (<= 6 (mod c_main_~x~0 4294967296)) (<= 0 c_main_~x~0)) is different from false [2019-10-07 13:34:19,615 WARN L191 SmtUtils]: Spent 11.83 s on a formula simplification that was a NOOP. DAG size: 67 [2019-10-07 13:34:54,824 WARN L191 SmtUtils]: Spent 6.25 s on a formula simplification that was a NOOP. DAG size: 70 [2019-10-07 13:35:24,217 WARN L191 SmtUtils]: Spent 6.22 s on a formula simplification that was a NOOP. DAG size: 52 [2019-10-07 13:35:51,276 WARN L191 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 55 [2019-10-07 13:36:08,094 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 37 [2019-10-07 13:36:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:36:37,530 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-07 13:36:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 13:36:37,535 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 16 [2019-10-07 13:36:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:36:37,536 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:36:37,536 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 13:36:37,538 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 285.1s TimeCoverageRelationStatistics Valid=383, Invalid=2003, Unknown=80, NotChecked=396, Total=2862 [2019-10-07 13:36:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 13:36:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 13:36:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:36:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-10-07 13:36:37,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 16 [2019-10-07 13:36:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:36:37,549 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-10-07 13:36:37,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 13:36:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-10-07 13:36:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:36:37,551 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:36:37,551 INFO L385 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:36:37,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:36:37,756 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:36:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:36:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1735470217, now seen corresponding path program 4 times [2019-10-07 13:36:37,757 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:36:37,758 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:36:37,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:36:37,758 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:36:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:36:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:36:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 13:36:37,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:36:37,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:36:37,909 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:36:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:36:37,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 13:36:37,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:36:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 13:36:37,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:36:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 13:36:38,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:36:38,162 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:36:38,162 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:36:38,162 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:36:38,163 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:36:38,163 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:36:38,183 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:36:38,255 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 40 for LOIs [2019-10-07 13:36:38,266 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:36:38,268 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:36:38,268 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:36:38,269 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 76#(and (not (< (mod main_~x~0 4294967296) 6)) (<= 0 main_~x~0)) [2019-10-07 13:36:38,269 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:36:38,270 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:36:38,270 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#true [2019-10-07 13:36:38,270 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 71#(<= 0 main_~x~0) [2019-10-07 13:36:38,270 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:36:38,271 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 100#true [2019-10-07 13:36:38,271 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_main_~y~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (= 0 (mod (mod v_prenex_4 4294967296) 3)) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_prenex_4 4294967296) 0)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (= 0 (mod (mod v_prenex_4 4294967296) 3)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) |__VERIFIER_assert_#in~cond|) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0)) (and (not (< (mod v_prenex_4 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:36:38,272 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_main_~y~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (= 0 (mod (mod v_prenex_4 4294967296) 3)) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_prenex_4 4294967296) 0)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (= 0 (mod (mod v_prenex_4 4294967296) 3)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) |__VERIFIER_assert_#in~cond|) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0)) (and (not (< (mod v_prenex_4 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:36:38,272 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_4 Int) (v_main_~y~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (= 0 (mod (mod v_prenex_4 4294967296) 3)) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_prenex_4 4294967296) 0)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (= 0 (mod (mod v_prenex_4 4294967296) 3)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) |__VERIFIER_assert_#in~cond|) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0)) (and (not (< (mod v_prenex_4 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))))) [2019-10-07 13:36:38,272 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 86#(and (exists ((v_prenex_4 Int) (v_main_~y~0_BEFORE_CALL_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (= 0 (mod (mod v_prenex_4 4294967296) 3)) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))) (and (not (< (mod v_prenex_4 4294967296) 0)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (= 0 (mod (mod v_prenex_4 4294967296) 3)) (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296))) (and (not (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647)) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) (- 4294967296)))) (and (<= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) 2147483647) (= (mod (+ (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3) 4294967293) 4294967296) |__VERIFIER_assert_#in~cond|) (not (= 0 (mod (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 3))) (< (mod v_main_~y~0_BEFORE_CALL_5 4294967296) 0)) (and (not (< (mod v_prenex_4 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (+ (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) (- 4294967296))) (not (<= (mod (mod (mod v_prenex_4 4294967296) 3) 4294967296) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:36:38,527 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:36:38,527 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 6] total 22 [2019-10-07 13:36:38,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 13:36:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 13:36:38,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:36:38,529 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2019-10-07 13:36:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:36:38,608 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-10-07 13:36:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:36:38,608 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-10-07 13:36:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:36:38,608 INFO L225 Difference]: With dead ends: 25 [2019-10-07 13:36:38,609 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:36:38,609 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:36:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:36:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:36:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:36:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:36:38,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-10-07 13:36:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:36:38,611 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:36:38,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 13:36:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:36:38,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:36:38,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:36:38,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:36:39,268 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2019-10-07 13:36:39,271 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:36:39,271 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:36:39,271 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:36:39,272 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:36:39,272 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:36:39,272 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:36:39,272 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2019-10-07 13:36:39,272 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2019-10-07 13:36:39,272 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2019-10-07 13:36:39,272 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 17) the Hoare annotation is: (let ((.cse15 (div main_~y~0 2))) (let ((.cse7 (div .cse15 2))) (let ((.cse10 (= (mod main_~y~0 (- 2)) 0)) (.cse12 (div (- main_~y~0) (- 2))) (.cse0 (= 0 (mod .cse7 2))) (.cse2 (= (mod main_~y~0 2) 0)) (.cse5 (= 0 (mod .cse15 2))) (.cse6 (div .cse7 2))) (or (let ((.cse1 (div .cse6 2))) (let ((.cse3 (div (- .cse1) (- 2)))) (let ((.cse4 (div (- .cse3) (- 2)))) (and .cse0 (= (mod .cse1 (- 2)) 0) .cse2 (= (mod .cse3 (- 2)) 0) (<= .cse4 1) .cse5 (<= main_~x~0 6) (<= 1 .cse4) (<= 6 main_~x~0) (= 0 (mod .cse6 2)))))) (let ((.cse9 (div (- .cse7) (- 2)))) (let ((.cse8 (div (- .cse9) (- 2)))) (and .cse2 (= 0 (mod .cse7 (- 2))) (<= 4 main_~x~0) .cse5 (<= 1 .cse8) (<= .cse8 1) (<= main_~x~0 4) (= (mod .cse9 (- 2)) 0)))) (let ((.cse11 (div (- .cse12) (- 2)))) (and .cse10 (<= 2 main_~x~0) (<= main_~x~0 2) (<= 1 .cse11) (= (mod .cse12 (- 2)) 0) (<= .cse11 1))) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (let ((.cse14 (div (- .cse15) (- 2)))) (let ((.cse13 (div (- .cse14) (- 2)))) (and (<= .cse13 1) .cse2 (<= main_~x~0 3) (= 0 (mod .cse14 (- 2))) (<= 1 .cse13) (= (mod .cse15 (- 2)) 0) (<= 3 main_~x~0)))) (and (<= 1 .cse12) .cse10 (<= main_~x~0 1) (<= 1 main_~x~0) (<= .cse12 1)) (let ((.cse16 (div (- .cse6) (- 2)))) (let ((.cse17 (div (- .cse16) (- 2)))) (and .cse0 .cse2 (= (mod .cse16 (- 2)) 0) (<= .cse17 1) (<= 1 .cse17) .cse5 (<= 5 main_~x~0) (= 0 (mod .cse6 (- 2))) (<= main_~x~0 5)))))))) [2019-10-07 13:36:39,273 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (and (not (= main_~y~0 (let ((.cse0 (div main_~y~0 4294967296))) (let ((.cse1 (* (- 4294967296) .cse0))) (let ((.cse2 (div (+ .cse1 main_~y~0) 3))) (+ (* 4294967296 .cse0) (* 4294967296 (div (+ .cse1 main_~y~0 (* (- 3) .cse2)) 4294967296)) (* 3 .cse2))))))) (<= 6 (mod main_~x~0 4294967296)) (<= 0 main_~x~0)) [2019-10-07 13:36:39,273 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:36:39,273 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:36:39,273 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:36:39,273 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:36:39,273 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:36:39,273 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:36:39,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:36:39 BoogieIcfgContainer [2019-10-07 13:36:39,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:36:39,296 INFO L168 Benchmark]: Toolchain (without parser) took 340565.47 ms. Allocated memory was 146.3 MB in the beginning and 248.0 MB in the end (delta: 101.7 MB). Free memory was 102.8 MB in the beginning and 158.2 MB in the end (delta: -55.3 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:36:39,297 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 13:36:39,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.39 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 93.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:36:39,298 INFO L168 Benchmark]: Boogie Preprocessor took 116.33 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.3 MB in the beginning and 182.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:36:39,299 INFO L168 Benchmark]: RCFGBuilder took 238.52 ms. Allocated memory is still 203.9 MB. Free memory was 182.3 MB in the beginning and 171.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:36:39,299 INFO L168 Benchmark]: TraceAbstraction took 339966.33 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 170.6 MB in the beginning and 158.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:36:39,303 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.39 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 93.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.33 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.3 MB in the beginning and 182.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 238.52 ms. Allocated memory is still 203.9 MB. Free memory was 182.3 MB in the beginning and 171.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 339966.33 ms. Allocated memory was 203.9 MB in the beginning and 248.0 MB in the end (delta: 44.0 MB). Free memory was 170.6 MB in the beginning and 158.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 14]: Loop Invariant Derived loop invariant: ((((((((((((((0 == y / 2 / 2 % 2 && y / 2 / 2 / 2 / 2 % -2 == 0) && y % 2 == 0) && -(y / 2 / 2 / 2 / 2) / -2 % -2 == 0) && -(-(y / 2 / 2 / 2 / 2) / -2) / -2 <= 1) && 0 == y / 2 % 2) && x <= 6) && 1 <= -(-(y / 2 / 2 / 2 / 2) / -2) / -2) && 6 <= x) && 0 == y / 2 / 2 / 2 % 2) || (((((((y % 2 == 0 && 0 == y / 2 / 2 % -2) && 4 <= x) && 0 == y / 2 % 2) && 1 <= -(-(y / 2 / 2) / -2) / -2) && -(-(y / 2 / 2) / -2) / -2 <= 1) && x <= 4) && -(y / 2 / 2) / -2 % -2 == 0)) || (((((y % -2 == 0 && 2 <= x) && x <= 2) && 1 <= -(-y / -2) / -2) && -y / -2 % -2 == 0) && -(-y / -2) / -2 <= 1)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((((((-(-(y / 2) / -2) / -2 <= 1 && y % 2 == 0) && x <= 3) && 0 == -(y / 2) / -2 % -2) && 1 <= -(-(y / 2) / -2) / -2) && y / 2 % -2 == 0) && 3 <= x)) || ((((1 <= -y / -2 && y % -2 == 0) && x <= 1) && 1 <= x) && -y / -2 <= 1)) || ((((((((0 == y / 2 / 2 % 2 && y % 2 == 0) && -(y / 2 / 2 / 2) / -2 % -2 == 0) && -(-(y / 2 / 2 / 2) / -2) / -2 <= 1) && 1 <= -(-(y / 2 / 2 / 2) / -2) / -2) && 0 == y / 2 % 2) && 5 <= x) && 0 == y / 2 / 2 / 2 % -2) && x <= 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 339.8s, OverallIterations: 5, TraceHistogramMax: 14, AutomataDifference: 226.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 42 SDtfs, 44 SDslu, 272 SDs, 0 SdLazy, 360 SolverSat, 31 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 48.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 286.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=4, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 29 NumberOfFragments, 434 HoareAnnotationTreeSize, 16 FomulaSimplifications, 784 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 145 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 95.4s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 192 ConstructedInterpolants, 2 QuantifiedInterpolants, 26503 SizeOfPredicates, 4 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 252/411 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 731, ICFG_INTERPRETER_ENTERED_PROCEDURES: 16, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 84, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 40, TOOLS_POST_TIME[ms]: 35, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME[ms]: 73, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME[ms]: 1, TOOLS_QUANTIFIERELIM_APPLICATIONS: 68, TOOLS_QUANTIFIERELIM_TIME[ms]: 95, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 32, FLUID_QUERY_TIME[ms]: 6, FLUID_QUERIES: 96, FLUID_YES_ANSWERS: 2, DOMAIN_JOIN_APPLICATIONS: 72, DOMAIN_JOIN_TIME[ms]: 316, DOMAIN_ALPHA_APPLICATIONS: 2, DOMAIN_ALPHA_TIME[ms]: 3, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME[ms]: 119, DOMAIN_ISSUBSETEQ_APPLICATIONS: 12, DOMAIN_ISSUBSETEQ_TIME[ms]: 31, DOMAIN_ISBOTTOM_APPLICATIONS: 4, DOMAIN_ISBOTTOM_TIME[ms]: 19, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 319, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 319, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 12, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME[ms]: 15, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 15, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 7, PATH_EXPR_TIME[ms]: 6, REGEX_TO_DAG_TIME[ms]: 9, DAG_COMPRESSION_TIME[ms]: 28, DAG_COMPRESSION_PROCESSED_NODES: 228, DAG_COMPRESSION_RETAINED_NODES: 164, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...