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/nested_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:30:07,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:30:07,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:30:07,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:30:07,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:30:07,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:30:07,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:30:07,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:30:07,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:30:07,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:30:07,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:30:07,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:30:07,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:30:07,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:30:07,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:30:07,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:30:07,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:30:07,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:30:07,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:30:07,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:30:07,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:30:07,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:30:07,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:30:07,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:30:07,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:30:07,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:30:07,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:30:07,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:30:07,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:30:07,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:30:07,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:30:07,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:30:07,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:30:07,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:30:07,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:30:07,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:30:07,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:30:07,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:30:07,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:30:07,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:30:07,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:30:07,954 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:07,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:30:07,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:30:07,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:30:07,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:30:07,974 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:30:07,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:30:07,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:30:07,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:30:07,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:30:07,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:30:07,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:30:07,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:30:07,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:30:07,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:30:07,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:30:07,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:30:07,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:30:07,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:30:07,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:30:07,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:30:07,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:30:07,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:30:07,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:30:07,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:30:07,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:30:07,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:30:07,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:30:07,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:30:07,979 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:08,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:30:08,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:30:08,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:30:08,318 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:30:08,318 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:30:08,319 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-10-07 13:30:08,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38adec8f8/388b71005d9a4da9900a0761f7f6c5b0/FLAG9934e6054 [2019-10-07 13:30:08,869 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:30:08,869 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/nested_1-1.c [2019-10-07 13:30:08,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38adec8f8/388b71005d9a4da9900a0761f7f6c5b0/FLAG9934e6054 [2019-10-07 13:30:09,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38adec8f8/388b71005d9a4da9900a0761f7f6c5b0 [2019-10-07 13:30:09,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:30:09,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:30:09,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:30:09,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:30:09,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:30:09,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:30:09" (1/1) ... [2019-10-07 13:30:09,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f51fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:09, skipping insertion in model container [2019-10-07 13:30:09,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:30:09" (1/1) ... [2019-10-07 13:30:09,319 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:30:09,337 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:30:09,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:30:09,494 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:30:09,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:30:09,520 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:30:09,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:09 WrapperNode [2019-10-07 13:30:09,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:30:09,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:30:09,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:30:09,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:30:09,614 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:09" (1/1) ... [2019-10-07 13:30:09,614 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:09" (1/1) ... [2019-10-07 13:30:09,619 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:09" (1/1) ... [2019-10-07 13:30:09,620 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:09" (1/1) ... [2019-10-07 13:30:09,623 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:09" (1/1) ... [2019-10-07 13:30:09,629 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:09" (1/1) ... [2019-10-07 13:30:09,630 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:09" (1/1) ... [2019-10-07 13:30:09,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:30:09,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:30:09,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:30:09,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:30:09,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:09" (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:09,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:30:09,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:30:09,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:30:09,691 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:30:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:30:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:30:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:30:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:30:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:30:09,942 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:30:09,943 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:30:09,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:30:09 BoogieIcfgContainer [2019-10-07 13:30:09,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:30:09,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:30:09,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:30:09,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:30:09,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:30:09" (1/3) ... [2019-10-07 13:30:09,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d367e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:30:09, skipping insertion in model container [2019-10-07 13:30:09,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:30:09" (2/3) ... [2019-10-07 13:30:09,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d367e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:30:09, skipping insertion in model container [2019-10-07 13:30:09,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:30:09" (3/3) ... [2019-10-07 13:30:09,958 INFO L109 eAbstractionObserver]: Analyzing ICFG nested_1-1.c [2019-10-07 13:30:10,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:30:10,019 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:30:10,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:30:10,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:30:10,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:30:10,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:30:10,082 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:30:10,083 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:30:10,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:30:10,083 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:30:10,083 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:30:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-07 13:30:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:30:10,104 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:10,105 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:10,107 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash -838692905, now seen corresponding path program 1 times [2019-10-07 13:30:10,119 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:10,119 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:10,120 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:10,120 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:10,344 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:10,345 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:10,345 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:30:10,346 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:30:10,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:30:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:30:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:30:10,375 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-07 13:30:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:10,434 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-07 13:30:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:30:10,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:30:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:10,448 INFO L225 Difference]: With dead ends: 31 [2019-10-07 13:30:10,448 INFO L226 Difference]: Without dead ends: 14 [2019-10-07 13:30:10,455 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:30:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-07 13:30:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-07 13:30:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-07 13:30:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-07 13:30:10,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-07 13:30:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:10,506 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-07 13:30:10,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:30:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-07 13:30:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:30:10,508 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:10,509 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:10,510 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash -284821231, now seen corresponding path program 1 times [2019-10-07 13:30:10,513 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:10,513 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:10,513 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:10,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:10,629 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:10,631 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:30:10,631 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:30:10,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:30:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:30:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:30:10,634 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-10-07 13:30:10,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:10,649 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-10-07 13:30:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:30:10,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 13:30:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:10,651 INFO L225 Difference]: With dead ends: 21 [2019-10-07 13:30:10,651 INFO L226 Difference]: Without dead ends: 14 [2019-10-07 13:30:10,652 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:30:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-07 13:30:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-07 13:30:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-07 13:30:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-07 13:30:10,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-07 13:30:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:10,658 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-07 13:30:10,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:30:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-07 13:30:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:30:10,659 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:10,660 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:10,660 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash -147777241, now seen corresponding path program 1 times [2019-10-07 13:30:10,661 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:10,661 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:10,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:10,661 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:10,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:10,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:10,750 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:30:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:10,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-07 13:30:10,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:30:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:10,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:30:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 13:30:10,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:30:10,948 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:30:10,948 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:30:10,960 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:30:10,975 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:30:10,976 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:30:11,035 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:30:11,496 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 39 for LOIs [2019-10-07 13:30:11,514 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:30:11,536 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:30:11,538 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:30:11,538 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:30:11,539 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:30:11,539 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:30:11,539 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-07 13:30:11,539 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-07 13:30:11,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:30:11,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-07 13:30:11,540 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:11,541 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) [2019-10-07 13:30:11,541 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:11,542 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:30:11,542 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_1 Int)) (or (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0)) (and (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296)) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_1) (not (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0)) (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 0) (<= (mod (+ (mod v_main_~x~0_BEFORE_CALL_1 2) 4294967294) 4294967296) 2147483647)) (and (= (mod v_main_~x~0_BEFORE_CALL_1 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_1 4294967296) 268435455)) (= (mod v_main_~x~0_BEFORE_CALL_1 2) 0) (<= 1 v_main_~x~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| (+ (mod v_main_~x~0_BEFORE_CALL_1 2) (- 4294967296))) (not (<= (mod v_main_~x~0_BEFORE_CALL_1 2) 2147483647))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:11,809 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:30:11,809 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4, 7] total 14 [2019-10-07 13:30:11,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 13:30:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 13:30:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:30:11,812 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 15 states. [2019-10-07 13:30:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:12,450 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2019-10-07 13:30:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:30:12,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2019-10-07 13:30:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:12,452 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:30:12,453 INFO L226 Difference]: Without dead ends: 27 [2019-10-07 13:30:12,457 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:30:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-07 13:30:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-07 13:30:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:30:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-07 13:30:12,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2019-10-07 13:30:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:12,470 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-07 13:30:12,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 13:30:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-07 13:30:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:30:12,472 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:12,473 INFO L385 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:12,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:12,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash 689631679, now seen corresponding path program 2 times [2019-10-07 13:30:12,679 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:12,679 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:12,679 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:12,679 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 13:30:12,825 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:12,825 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:12,825 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:30:12,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-07 13:30:12,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:30:12,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 13:30:12,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:30:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 13:30:12,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:30:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 13:30:12,965 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:30:12,967 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:30:12,968 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:30:12,968 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:30:12,969 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:30:12,969 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:30:12,985 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:30:13,281 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 87 for LOIs [2019-10-07 13:30:13,293 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:30:13,295 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:30:13,295 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:30:13,296 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:30:13,296 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:30:13,296 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:30:13,296 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-07 13:30:13,297 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-07 13:30:13,297 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:30:13,297 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-07 13:30:13,298 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:13,298 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) [2019-10-07 13:30:13,298 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:13,299 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:30:13,299 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_main_~x~0_BEFORE_CALL_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (or (and (not (< (mod v_prenex_2 4294967296) 0)) (<= (mod v_prenex_2 2) 2147483647) (= |__VERIFIER_assert_#in~cond| (mod v_prenex_2 2)) (not (< (mod v_prenex_2 4294967296) 268435455)) (<= 1 v_prenex_2)) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_1 2)) (= 0 (mod v_prenex_1 2)) (not (< (mod v_prenex_1 4294967296) 268435455)) (<= 1 v_prenex_1) (<= (mod v_prenex_1 2) 2147483647)) (and (not (< (mod v_prenex_5 4294967296) 0)) (<= 1 v_prenex_5) (= (+ (mod v_prenex_5 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod v_prenex_5 2) 2147483647)) (not (< (mod v_prenex_5 4294967296) 268435455))) (and (<= 1 v_prenex_3) (< (mod v_prenex_3 4294967296) 0) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296)) (not (< (mod v_prenex_3 4294967296) 268435455)) (not (= 0 (mod v_prenex_3 2))) (<= (mod (+ (mod v_prenex_3 2) 4294967294) 4294967296) 2147483647)) (and (<= 1 v_main_~x~0_BEFORE_CALL_2) (= 0 (mod v_main_~x~0_BEFORE_CALL_2 2)) (not (<= (mod v_main_~x~0_BEFORE_CALL_2 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_2 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (< (mod v_main_~x~0_BEFORE_CALL_2 4294967296) 268435455))) (and (= |__VERIFIER_assert_#in~cond| (+ (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) (- 4294967296))) (not (<= (mod (+ (mod v_prenex_4 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_4) (not (< (mod v_prenex_4 4294967296) 268435455)) (not (= 0 (mod v_prenex_4 2))) (< (mod v_prenex_4 4294967296) 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:13,578 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:30:13,578 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 7] total 15 [2019-10-07 13:30:13,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 13:30:13,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 13:30:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:30:13,580 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 15 states. [2019-10-07 13:30:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:13,900 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2019-10-07 13:30:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:30:13,901 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-10-07 13:30:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:13,902 INFO L225 Difference]: With dead ends: 61 [2019-10-07 13:30:13,902 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:30:13,903 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:30:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:30:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 13:30:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 13:30:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-07 13:30:13,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 26 [2019-10-07 13:30:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:13,914 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-07 13:30:13,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 13:30:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-07 13:30:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:30:13,916 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:13,916 INFO L385 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:14,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:14,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -690259521, now seen corresponding path program 3 times [2019-10-07 13:30:14,126 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:14,126 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:14,126 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:14,126 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:30:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-10-07 13:30:14,271 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:14,271 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:30:14,272 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:30:14,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:30:14,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:30:14,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-07 13:30:14,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:30:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 13:30:14,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:30:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 10 proven. 314 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-07 13:30:14,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:30:14,916 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:30:14,916 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:30:14,917 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:30:14,917 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:30:14,917 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:30:14,940 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:30:15,159 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 58 for LOIs [2019-10-07 13:30:15,170 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:30:15,173 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:30:15,173 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:30:15,173 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:30:15,173 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:30:15,174 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:30:15,174 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-07 13:30:15,175 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-07 13:30:15,175 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:30:15,175 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-07 13:30:15,176 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) (<= 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:30:15,176 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) [2019-10-07 13:30:15,177 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:30:15,177 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:30:15,178 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_main_~x~0_BEFORE_CALL_3 Int)) (or (and (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (not (<= (mod v_prenex_6 2) 2147483647)) (= (mod v_prenex_6 2) 0) (= (+ (mod v_prenex_6 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296)) (<= 1 v_prenex_7) (< (mod v_prenex_7 4294967296) 0) (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647)) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (= (+ (mod v_main_~x~0_BEFORE_CALL_3 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_main_~x~0_BEFORE_CALL_3) (not (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647)) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0))) (and (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_3) (<= (mod v_main_~x~0_BEFORE_CALL_3 2) 2147483647) (not (< (mod v_main_~x~0_BEFORE_CALL_3 4294967296) 0)) (= |__VERIFIER_assert_#in~cond| (mod v_main_~x~0_BEFORE_CALL_3 2))) (and (= |__VERIFIER_assert_#in~cond| (mod v_prenex_6 2)) (not (< (mod v_prenex_6 4294967296) 268435455)) (<= 1 v_prenex_6) (= (mod v_prenex_6 2) 0) (<= (mod v_prenex_6 2) 2147483647)) (and (not (< (mod v_prenex_7 4294967296) 268435455)) (not (= (mod v_prenex_7 2) 0)) (<= 1 v_prenex_7) (= (+ (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (< (mod v_prenex_7 4294967296) 0) (not (<= (mod (+ (mod v_prenex_7 2) 4294967294) 4294967296) 2147483647))))) (<= 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:30:15,675 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:30:15,676 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12, 7] total 35 [2019-10-07 13:30:15,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 13:30:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 13:30:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 13:30:15,678 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 35 states. [2019-10-07 13:30:17,899 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-10-07 13:30:18,121 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2019-10-07 13:30:18,542 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2019-10-07 13:30:19,165 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-10-07 13:30:24,001 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 16 [2019-10-07 13:30:30,912 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-10-07 13:30:33,439 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-10-07 13:30:35,054 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2019-10-07 13:30:36,422 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2019-10-07 13:30:38,913 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-10-07 13:30:49,321 WARN L191 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-10-07 13:30:54,134 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2019-10-07 13:31:01,697 WARN L191 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-10-07 13:31:12,415 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-10-07 13:31:18,475 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-10-07 13:31:24,567 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-10-07 13:31:26,115 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-10-07 13:31:33,789 WARN L191 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 43 DAG size of output: 26 [2019-10-07 13:31:42,750 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-10-07 13:31:47,954 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-10-07 13:31:56,037 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-10-07 13:32:09,781 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-10-07 13:32:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:32:12,961 INFO L93 Difference]: Finished difference Result 143 states and 184 transitions. [2019-10-07 13:32:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-10-07 13:32:12,963 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-10-07 13:32:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:32:12,966 INFO L225 Difference]: With dead ends: 143 [2019-10-07 13:32:12,967 INFO L226 Difference]: Without dead ends: 113 [2019-10-07 13:32:12,974 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5564 ImplicationChecksByTransitivity, 108.2s TimeCoverageRelationStatistics Valid=2880, Invalid=14139, Unknown=11, NotChecked=0, Total=17030 [2019-10-07 13:32:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-07 13:32:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-07 13:32:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-07 13:32:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2019-10-07 13:32:12,994 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 42 [2019-10-07 13:32:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:32:12,995 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2019-10-07 13:32:12,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 13:32:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2019-10-07 13:32:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 13:32:12,998 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:32:12,998 INFO L385 BasicCegarLoop]: trace histogram [70, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:32:13,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:13,200 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:32:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:32:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash -831682089, now seen corresponding path program 4 times [2019-10-07 13:32:13,201 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:32:13,201 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:13,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:13,202 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:32:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3215 backedges. 586 proven. 28 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-10-07 13:32:13,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:13,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:32:13,406 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:32:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:13,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 13:32:13,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:32:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3215 backedges. 586 proven. 28 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-10-07 13:32:13,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:32:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3215 backedges. 586 proven. 28 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-10-07 13:32:13,748 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:32:13,750 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-07 13:32:13,750 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:32:13,751 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:32:13,751 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:32:13,751 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:32:13,766 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:32:13,974 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 87 for LOIs [2019-10-07 13:32:13,982 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:32:13,983 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:32:13,984 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:32:13,984 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 156#(and (or (<= 1 main_~x~0) (and (<= main_~x~0 0) (<= main_~y~0 0))) (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:32:13,984 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:32:13,984 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:32:13,985 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 184#true [2019-10-07 13:32:13,985 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 133#(and (or (and (not (< (mod main_~y~0 4294967296) 10)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0))) (<= 0 main_~y~0)) [2019-10-07 13:32:13,985 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:32:13,988 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 179#true [2019-10-07 13:32:13,988 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 170#(and (exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (not (< (mod v_main_~x~0_BEFORE_CALL_4 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_4) (= (mod v_main_~x~0_BEFORE_CALL_4 2) 0) (not (<= (mod v_main_~x~0_BEFORE_CALL_4 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_4 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_11 4294967296) 268435455)) (= (mod v_prenex_11 2) 0) (= (mod v_prenex_11 2) |__VERIFIER_assert_#in~cond|) (<= (mod v_prenex_11 2) 2147483647) (<= 1 v_prenex_11)) (and (not (< (mod v_prenex_9 4294967296) 268435455)) (= (+ (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_9) (not (= (mod v_prenex_9 2) 0)) (< (mod v_prenex_9 4294967296) 0)) (and (not (< (mod v_prenex_8 4294967296) 0)) (not (< (mod v_prenex_8 4294967296) 268435455)) (not (<= (mod v_prenex_8 2) 2147483647)) (= (+ (mod v_prenex_8 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_prenex_8)) (and (<= (mod v_prenex_10 2) 2147483647) (= (mod v_prenex_10 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_prenex_10 4294967296) 268435455)) (not (< (mod v_prenex_10 4294967296) 0)) (<= 1 v_prenex_10)) (and (< (mod v_prenex_12 4294967296) 0) (not (< (mod v_prenex_12 4294967296) 268435455)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296)) (<= 1 v_prenex_12) (not (= (mod v_prenex_12 2) 0)) (<= (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296) 2147483647)))) (<= __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:13,988 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 160#(exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (not (< (mod v_main_~x~0_BEFORE_CALL_4 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_4) (= (mod v_main_~x~0_BEFORE_CALL_4 2) 0) (not (<= (mod v_main_~x~0_BEFORE_CALL_4 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_4 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_11 4294967296) 268435455)) (= (mod v_prenex_11 2) 0) (= (mod v_prenex_11 2) |__VERIFIER_assert_#in~cond|) (<= (mod v_prenex_11 2) 2147483647) (<= 1 v_prenex_11)) (and (not (< (mod v_prenex_9 4294967296) 268435455)) (= (+ (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_9) (not (= (mod v_prenex_9 2) 0)) (< (mod v_prenex_9 4294967296) 0)) (and (not (< (mod v_prenex_8 4294967296) 0)) (not (< (mod v_prenex_8 4294967296) 268435455)) (not (<= (mod v_prenex_8 2) 2147483647)) (= (+ (mod v_prenex_8 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_prenex_8)) (and (<= (mod v_prenex_10 2) 2147483647) (= (mod v_prenex_10 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_prenex_10 4294967296) 268435455)) (not (< (mod v_prenex_10 4294967296) 0)) (<= 1 v_prenex_10)) (and (< (mod v_prenex_12 4294967296) 0) (not (< (mod v_prenex_12 4294967296) 268435455)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296)) (<= 1 v_prenex_12) (not (= (mod v_prenex_12 2) 0)) (<= (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296) 2147483647)))) [2019-10-07 13:32:13,990 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 165#(and (exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (not (< (mod v_main_~x~0_BEFORE_CALL_4 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_4) (= (mod v_main_~x~0_BEFORE_CALL_4 2) 0) (not (<= (mod v_main_~x~0_BEFORE_CALL_4 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_4 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_11 4294967296) 268435455)) (= (mod v_prenex_11 2) 0) (= (mod v_prenex_11 2) |__VERIFIER_assert_#in~cond|) (<= (mod v_prenex_11 2) 2147483647) (<= 1 v_prenex_11)) (and (not (< (mod v_prenex_9 4294967296) 268435455)) (= (+ (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_9) (not (= (mod v_prenex_9 2) 0)) (< (mod v_prenex_9 4294967296) 0)) (and (not (< (mod v_prenex_8 4294967296) 0)) (not (< (mod v_prenex_8 4294967296) 268435455)) (not (<= (mod v_prenex_8 2) 2147483647)) (= (+ (mod v_prenex_8 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_prenex_8)) (and (<= (mod v_prenex_10 2) 2147483647) (= (mod v_prenex_10 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_prenex_10 4294967296) 268435455)) (not (< (mod v_prenex_10 4294967296) 0)) (<= 1 v_prenex_10)) (and (< (mod v_prenex_12 4294967296) 0) (not (< (mod v_prenex_12 4294967296) 268435455)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296)) (<= 1 v_prenex_12) (not (= (mod v_prenex_12 2) 0)) (<= (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296) 2147483647)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:13,990 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 128#(and (<= 0 main_~y~0) (<= 0 main_~x~0)) [2019-10-07 13:32:13,991 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 175#(and (exists ((v_main_~x~0_BEFORE_CALL_4 Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (not (< (mod v_main_~x~0_BEFORE_CALL_4 4294967296) 268435455)) (<= 1 v_main_~x~0_BEFORE_CALL_4) (= (mod v_main_~x~0_BEFORE_CALL_4 2) 0) (not (<= (mod v_main_~x~0_BEFORE_CALL_4 2) 2147483647)) (= (+ (mod v_main_~x~0_BEFORE_CALL_4 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|)) (and (not (< (mod v_prenex_11 4294967296) 268435455)) (= (mod v_prenex_11 2) 0) (= (mod v_prenex_11 2) |__VERIFIER_assert_#in~cond|) (<= (mod v_prenex_11 2) 2147483647) (<= 1 v_prenex_11)) (and (not (< (mod v_prenex_9 4294967296) 268435455)) (= (+ (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (not (<= (mod (+ (mod v_prenex_9 2) 4294967294) 4294967296) 2147483647)) (<= 1 v_prenex_9) (not (= (mod v_prenex_9 2) 0)) (< (mod v_prenex_9 4294967296) 0)) (and (not (< (mod v_prenex_8 4294967296) 0)) (not (< (mod v_prenex_8 4294967296) 268435455)) (not (<= (mod v_prenex_8 2) 2147483647)) (= (+ (mod v_prenex_8 2) (- 4294967296)) |__VERIFIER_assert_#in~cond|) (<= 1 v_prenex_8)) (and (<= (mod v_prenex_10 2) 2147483647) (= (mod v_prenex_10 2) |__VERIFIER_assert_#in~cond|) (not (< (mod v_prenex_10 4294967296) 268435455)) (not (< (mod v_prenex_10 4294967296) 0)) (<= 1 v_prenex_10)) (and (< (mod v_prenex_12 4294967296) 0) (not (< (mod v_prenex_12 4294967296) 268435455)) (= |__VERIFIER_assert_#in~cond| (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296)) (<= 1 v_prenex_12) (not (= (mod v_prenex_12 2) 0)) (<= (mod (+ (mod v_prenex_12 2) 4294967294) 4294967296) 2147483647)))) (<= __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:14,325 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:32:14,326 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 7] total 25 [2019-10-07 13:32:14,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 13:32:14,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 13:32:14,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-10-07 13:32:14,328 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 25 states. [2019-10-07 13:32:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:32:14,802 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2019-10-07 13:32:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 13:32:14,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2019-10-07 13:32:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:32:14,806 INFO L225 Difference]: With dead ends: 230 [2019-10-07 13:32:14,806 INFO L226 Difference]: Without dead ends: 131 [2019-10-07 13:32:14,807 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2019-10-07 13:32:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-07 13:32:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-10-07 13:32:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-07 13:32:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2019-10-07 13:32:14,833 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 100 [2019-10-07 13:32:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:32:14,834 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2019-10-07 13:32:14,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 13:32:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2019-10-07 13:32:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-07 13:32:14,836 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:32:14,836 INFO L385 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:32:15,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:15,038 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:32:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:32:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1931011429, now seen corresponding path program 5 times [2019-10-07 13:32:15,038 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:32:15,039 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:15,039 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:15,039 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:32:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:32:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:32:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-10-07 13:32:15,412 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:32:15,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:32:15,413 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:15,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-07 13:32:15,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:32:15,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 13:32:15,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:32:35,669 WARN L191 SmtUtils]: Spent 7.58 s on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-10-07 13:32:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 4951 trivial. 0 not checked. [2019-10-07 13:32:41,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:32:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 4951 trivial. 0 not checked. [2019-10-07 13:32:46,609 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:32:46,610 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [13] total 23 [2019-10-07 13:32:46,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:32:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:32:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=393, Unknown=5, NotChecked=0, Total=506 [2019-10-07 13:32:46,611 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 12 states. [2019-10-07 13:32:48,728 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-10-07 13:32:54,887 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~x~0_BEFORE_CALL_5 Int)) (let ((.cse0 (mod v_main_~x~0_BEFORE_CALL_5 2)) (.cse1 (mod v_main_~x~0_BEFORE_CALL_5 4294967296))) (and (< (mod (+ v_main_~x~0_BEFORE_CALL_5 4294967295) 4294967296) 268435455) (<= .cse0 2147483647) (<= 0 .cse1) (= .cse0 c___VERIFIER_assert_~cond) (<= 268435455 .cse1)))) (exists ((v_main_~x~0_BEFORE_CALL_5 Int)) (let ((.cse2 (mod v_main_~x~0_BEFORE_CALL_5 2)) (.cse3 (mod v_main_~x~0_BEFORE_CALL_5 4294967296))) (and (< (mod (+ v_main_~x~0_BEFORE_CALL_5 4294967295) 4294967296) 268435455) (= |c___VERIFIER_assert_#in~cond| .cse2) (<= .cse2 2147483647) (<= 0 .cse3) (<= 268435455 .cse3))))) is different from true [2019-10-07 13:32:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:32:54,888 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-10-07 13:32:54,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:32:54,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2019-10-07 13:32:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:32:54,889 INFO L225 Difference]: With dead ends: 131 [2019-10-07 13:32:54,889 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:32:54,891 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=140, Invalid=458, Unknown=6, NotChecked=46, Total=650 [2019-10-07 13:32:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:32:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:32:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:32:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:32:54,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2019-10-07 13:32:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:32:54,892 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:32:54,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:32:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:32:54,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:32:55,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:32:55,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:32:55,973 WARN L191 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 42 [2019-10-07 13:32:55,976 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:32:55,976 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:32:55,977 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:32:55,977 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:32:55,977 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:32:55,977 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:32:55,977 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 25) no Hoare annotation was computed. [2019-10-07 13:32:55,977 INFO L439 ceAbstractionStarter]: At program point L17-2(lines 17 19) the Hoare annotation is: (let ((.cse3 (<= 0 main_~y~0)) (.cse0 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse1 (< (mod main_~x~0 4294967296) 268435455)) (.cse2 (<= 0 main_~x~0))) (or (and .cse0 (<= main_~y~0 7) .cse1 .cse2 (<= 7 main_~y~0)) (and .cse0 .cse3 .cse1 (<= main_~y~0 5) .cse2) (let ((.cse4 (< (mod (+ main_~x~0 4) 4294967296) 268435455))) (and .cse0 .cse3 .cse1 (or (<= 10 (mod (+ main_~y~0 4) 4294967296)) .cse4) (or (<= 10 (mod (+ main_~y~0 2) 4294967296)) .cse4) .cse2)) (and (= main_~x~0 0) .cse3) (and .cse0 (<= main_~y~0 6) (<= 6 main_~y~0) .cse1 .cse2))) [2019-10-07 13:32:55,977 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 25) no Hoare annotation was computed. [2019-10-07 13:32:55,977 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 25) the Hoare annotation is: true [2019-10-07 13:32:55,978 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 22) the Hoare annotation is: (let ((.cse0 (<= 0 main_~y~0))) (or (and .cse0 (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) (and (and (<= 1 main_~x~0) (<= 10 (mod main_~y~0 4294967296))) (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) .cse0))) [2019-10-07 13:32:55,978 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 0 main_~y~0) (<= 1 main_~x~0) (<= 268435455 (mod main_~x~0 4294967296)) (<= 10 (mod main_~y~0 4294967296))) [2019-10-07 13:32:55,978 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:32:55,978 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:32:55,978 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:32:55,978 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:32:55,979 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:32:55,979 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:32:55,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:32:55 BoogieIcfgContainer [2019-10-07 13:32:55,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:32:56,000 INFO L168 Benchmark]: Toolchain (without parser) took 166696.39 ms. Allocated memory was 136.3 MB in the beginning and 354.4 MB in the end (delta: 218.1 MB). Free memory was 99.6 MB in the beginning and 99.1 MB in the end (delta: 563.9 kB). Peak memory consumption was 218.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:32:56,000 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 136.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:32:56,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.68 ms. Allocated memory is still 136.3 MB. Free memory was 99.4 MB in the beginning and 89.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:32:56,002 INFO L168 Benchmark]: Boogie Preprocessor took 109.47 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 178.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:32:56,003 INFO L168 Benchmark]: RCFGBuilder took 312.74 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 165.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:32:56,003 INFO L168 Benchmark]: TraceAbstraction took 166052.08 ms. Allocated memory was 199.8 MB in the beginning and 354.4 MB in the end (delta: 154.7 MB). Free memory was 165.4 MB in the beginning and 99.1 MB in the end (delta: 66.3 MB). Peak memory consumption was 221.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:32:56,009 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.16 ms. Allocated memory is still 136.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 217.68 ms. Allocated memory is still 136.3 MB. Free memory was 99.4 MB in the beginning and 89.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.47 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.8 MB in the beginning and 178.4 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.74 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 165.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166052.08 ms. Allocated memory was 199.8 MB in the beginning and 354.4 MB in the end (delta: 154.7 MB). Free memory was 165.4 MB in the beginning and 99.1 MB in the end (delta: 66.3 MB). Peak memory consumption was 221.0 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 && x <= 0) && 0 <= x) && y <= 0) || (((1 <= x && 10 <= y % 4294967296) && (x + 4294967295) % 4294967296 < 268435455) && 0 <= y) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((x + 4294967295) % 4294967296 < 268435455 && y <= 7) && x % 4294967296 < 268435455) && 0 <= x) && 7 <= y) || (((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && y <= 5) && 0 <= x)) || ((((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && (10 <= (y + 4) % 4294967296 || (x + 4) % 4294967296 < 268435455)) && (10 <= (y + 2) % 4294967296 || (x + 4) % 4294967296 < 268435455)) && 0 <= x)) || (x == 0 && 0 <= y)) || (((((x + 4294967295) % 4294967296 < 268435455 && y <= 6) && 6 <= y) && x % 4294967296 < 268435455) && 0 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Result: SAFE, OverallTime: 165.9s, OverallIterations: 7, TraceHistogramMax: 100, AutomataDifference: 127.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 65 SDtfs, 32 SDslu, 362 SDs, 0 SdLazy, 1064 SolverSat, 403 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 739 SyntacticMatches, 5 SemanticMatches, 236 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6017 ImplicationChecksByTransitivity, 145.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 136 NumberOfFragments, 187 HoareAnnotationTreeSize, 14 FomulaSimplifications, 3379 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 972 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 32.7s InterpolantComputationTime, 644 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 938 ConstructedInterpolants, 2 QuantifiedInterpolants, 251973 SizeOfPredicates, 8 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 22938/29194 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1430, ICFG_INTERPRETER_ENTERED_PROCEDURES: 16, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 164, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 88, TOOLS_POST_TIME[ms]: 113, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME[ms]: 191, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME[ms]: 1, TOOLS_QUANTIFIERELIM_APPLICATIONS: 116, TOOLS_QUANTIFIERELIM_TIME[ms]: 264, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 58, FLUID_QUERY_TIME[ms]: 8, FLUID_QUERIES: 180, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME[ms]: 702, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME[ms]: 162, DOMAIN_ISSUBSETEQ_APPLICATIONS: 16, DOMAIN_ISSUBSETEQ_TIME[ms]: 35, DOMAIN_ISBOTTOM_APPLICATIONS: 28, DOMAIN_ISBOTTOM_TIME[ms]: 57, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 726, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 725, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 16, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME[ms]: 21, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 21, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 7, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 35, DAG_COMPRESSION_PROCESSED_NODES: 312, DAG_COMPRESSION_RETAINED_NODES: 196, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...