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-lit/gj2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:42:17,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:42:17,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:42:17,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:42:17,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:42:17,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:42:17,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:42:17,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:42:17,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:42:17,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:42:17,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:42:17,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:42:17,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:42:17,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:42:18,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:42:18,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:42:18,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:42:18,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:42:18,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:42:18,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:42:18,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:42:18,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:42:18,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:42:18,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:42:18,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:42:18,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:42:18,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:42:18,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:42:18,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:42:18,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:42:18,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:42:18,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:42:18,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:42:18,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:42:18,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:42:18,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:42:18,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:42:18,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:42:18,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:42:18,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:42:18,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:42:18,026 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:42:18,040 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:42:18,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:42:18,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:42:18,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:42:18,042 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:42:18,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:42:18,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:42:18,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:42:18,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:42:18,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:42:18,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:42:18,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:42:18,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:42:18,044 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:42:18,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:42:18,044 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:42:18,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:42:18,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:42:18,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:42:18,045 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:42:18,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:42:18,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:42:18,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:42:18,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:42:18,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:42:18,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:42:18,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:42:18,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:42:18,047 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:42:18,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:42:18,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:42:18,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:42:18,373 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:42:18,373 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:42:18,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.i [2019-10-07 13:42:18,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d953a8b/d12ee346e7214221aefcfa59bd84d36c/FLAG4edc4f1c6 [2019-10-07 13:42:18,879 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:42:18,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.i [2019-10-07 13:42:18,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d953a8b/d12ee346e7214221aefcfa59bd84d36c/FLAG4edc4f1c6 [2019-10-07 13:42:19,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d953a8b/d12ee346e7214221aefcfa59bd84d36c [2019-10-07 13:42:19,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:42:19,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:42:19,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:42:19,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:42:19,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:42:19,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ef2688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19, skipping insertion in model container [2019-10-07 13:42:19,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:42:19,301 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:42:19,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:42:19,474 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:42:19,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:42:19,500 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:42:19,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19 WrapperNode [2019-10-07 13:42:19,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:42:19,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:42:19,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:42:19,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:42:19,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (1/1) ... [2019-10-07 13:42:19,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:42:19,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:42:19,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:42:19,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:42:19,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (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:42:19,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:42:19,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:42:19,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:42:19,660 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:42:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:42:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:42:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:42:19,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:42:19,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:42:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:42:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:42:19,854 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:42:19,855 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:42:19,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:42:19 BoogieIcfgContainer [2019-10-07 13:42:19,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:42:19,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:42:19,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:42:19,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:42:19,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:42:19" (1/3) ... [2019-10-07 13:42:19,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1417b0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:42:19, skipping insertion in model container [2019-10-07 13:42:19,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:42:19" (2/3) ... [2019-10-07 13:42:19,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1417b0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:42:19, skipping insertion in model container [2019-10-07 13:42:19,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:42:19" (3/3) ... [2019-10-07 13:42:19,865 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.i [2019-10-07 13:42:19,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:42:19,892 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:42:19,912 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:42:19,953 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:42:19,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:42:19,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:42:19,954 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:42:19,954 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:42:19,954 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:42:19,954 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:42:19,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:42:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:42:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:42:19,981 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:19,982 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:19,984 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1733570904, now seen corresponding path program 1 times [2019-10-07 13:42:20,002 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:20,003 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:20,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:20,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:20,137 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:42:20,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:20,138 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:42:20,139 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:42:20,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:42:20,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:42:20,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:42:20,161 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:42:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:20,221 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-07 13:42:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:42:20,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:42:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:20,249 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:42:20,249 INFO L226 Difference]: Without dead ends: 12 [2019-10-07 13:42:20,257 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:42:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-07 13:42:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-07 13:42:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:42:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-07 13:42:20,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-07 13:42:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:20,308 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-07 13:42:20,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:42:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-07 13:42:20,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:42:20,309 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:20,309 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:20,310 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2033404008, now seen corresponding path program 1 times [2019-10-07 13:42:20,311 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:20,311 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:20,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:20,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:20,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:20,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:42:20,405 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:42:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:20,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:42:20,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:42:20,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:42:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:20,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:42:20,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:42:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:20,581 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:42:20,608 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:42:20,608 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:42:20,616 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:42:20,624 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:42:20,624 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:42:20,681 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:20,973 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:42:21,011 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:21,015 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:21,016 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:21,016 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:21,016 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:21,017 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:21,017 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:21,017 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-07 13:42:21,018 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:21,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:21,018 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-07 13:42:21,018 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:21,019 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:42:21,019 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:42:21,210 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:21,210 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 6] total 11 [2019-10-07 13:42:21,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:42:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:42:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:42:21,214 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-10-07 13:42:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:21,359 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-07 13:42:21,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:42:21,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-10-07 13:42:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:21,361 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:42:21,361 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 13:42:21,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:42:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 13:42:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 13:42:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:42:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-07 13:42:21,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-10-07 13:42:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:21,368 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-07 13:42:21,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:42:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-07 13:42:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:42:21,369 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:21,370 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:21,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:21,576 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1000095400, now seen corresponding path program 2 times [2019-10-07 13:42:21,578 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:21,578 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:21,578 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:21,579 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:21,653 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:21,653 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:42:21,653 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:42:21,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:42:21,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:42:21,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:42:21,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:42:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:21,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:42:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:21,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:42:21,853 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:42:21,853 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:42:21,854 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:42:21,854 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:42:21,854 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:42:21,868 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:21,954 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:42:21,976 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:21,979 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:21,980 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:21,980 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:21,980 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:21,980 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:21,981 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:21,981 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-07 13:42:21,981 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:21,982 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:21,982 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-07 13:42:21,982 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:21,982 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:42:21,983 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:42:22,109 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:22,109 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 6] total 17 [2019-10-07 13:42:22,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 13:42:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 13:42:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-10-07 13:42:22,112 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 17 states. [2019-10-07 13:42:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:22,330 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-10-07 13:42:22,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-07 13:42:22,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-07 13:42:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:22,333 INFO L225 Difference]: With dead ends: 26 [2019-10-07 13:42:22,333 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 13:42:22,335 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2019-10-07 13:42:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 13:42:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 13:42:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:42:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-10-07 13:42:22,345 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-10-07 13:42:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:22,346 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-10-07 13:42:22,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 13:42:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-10-07 13:42:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:42:22,349 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:22,349 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:22,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:22,553 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1156847960, now seen corresponding path program 3 times [2019-10-07 13:42:22,554 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:22,554 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:22,554 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:22,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:22,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:22,744 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:42:22,744 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:42:22,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:42:22,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:42:22,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:42:22,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:42:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:22,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:42:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:23,333 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:42:23,335 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:42:23,335 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:42:23,335 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:42:23,336 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:42:23,336 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:42:23,357 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:23,433 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:42:23,452 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:23,455 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:23,455 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:23,456 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:23,456 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:23,456 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:23,457 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:23,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-07 13:42:23,457 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:23,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:23,457 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-07 13:42:23,458 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:23,458 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:42:23,458 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:42:23,602 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:23,602 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 6] total 29 [2019-10-07 13:42:23,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 13:42:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 13:42:23,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2019-10-07 13:42:23,604 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 29 states. [2019-10-07 13:42:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:24,164 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-10-07 13:42:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 13:42:24,165 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-10-07 13:42:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:24,166 INFO L225 Difference]: With dead ends: 38 [2019-10-07 13:42:24,166 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:42:24,168 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=840, Invalid=1710, Unknown=0, NotChecked=0, Total=2550 [2019-10-07 13:42:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:42:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-07 13:42:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:42:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-10-07 13:42:24,175 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2019-10-07 13:42:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:24,176 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-10-07 13:42:24,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 13:42:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-10-07 13:42:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:42:24,177 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:24,177 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:24,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:24,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:24,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1890503000, now seen corresponding path program 4 times [2019-10-07 13:42:24,383 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:24,383 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:24,383 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:24,383 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:24,765 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:24,765 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:42:24,765 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:42:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:24,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:42:24,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:42:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:25,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:42:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:26,301 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:42:26,302 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:42:26,302 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:42:26,303 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:42:26,303 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:42:26,303 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:42:26,317 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:26,398 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:42:26,415 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:26,417 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:26,418 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:26,418 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:26,419 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:26,419 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 109#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:26,420 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 89#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:26,420 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 118#true [2019-10-07 13:42:26,421 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 84#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:26,421 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:26,421 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 113#true [2019-10-07 13:42:26,421 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 104#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:26,422 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 94#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 13:42:26,422 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 99#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:42:26,583 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:26,584 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 6] total 53 [2019-10-07 13:42:26,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-07 13:42:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-07 13:42:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=1614, Unknown=0, NotChecked=0, Total=2756 [2019-10-07 13:42:26,588 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 53 states. [2019-10-07 13:42:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:28,257 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2019-10-07 13:42:28,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-07 13:42:28,259 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 32 [2019-10-07 13:42:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:28,260 INFO L225 Difference]: With dead ends: 62 [2019-10-07 13:42:28,260 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:42:28,267 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 47 SyntacticMatches, 22 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3396, Invalid=6306, Unknown=0, NotChecked=0, Total=9702 [2019-10-07 13:42:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:42:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-07 13:42:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:42:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-07 13:42:28,291 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2019-10-07 13:42:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:28,291 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-07 13:42:28,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-07 13:42:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-07 13:42:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:42:28,297 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:28,297 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:28,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:28,502 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1015818584, now seen corresponding path program 5 times [2019-10-07 13:42:28,503 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:28,503 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:28,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:28,503 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:29,809 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:29,810 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:42:29,810 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:42:29,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 13:42:29,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:42:29,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:42:29,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:42:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:31,183 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:42:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:34,576 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:42:34,577 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:42:34,577 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:42:34,578 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:42:34,578 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:42:34,578 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:42:34,598 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:42:34,643 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:42:34,655 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:42:34,657 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:42:34,658 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:42:34,658 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:42:34,658 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:42:34,658 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 109#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:34,659 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 89#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:34,659 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 118#true [2019-10-07 13:42:34,659 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 84#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:42:34,659 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:42:34,660 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 113#true [2019-10-07 13:42:34,660 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 104#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:42:34,660 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 94#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:42:34,660 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 99#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:42:34,872 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:42:34,873 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 6] total 101 [2019-10-07 13:42:34,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-10-07 13:42:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-10-07 13:42:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4574, Invalid=5526, Unknown=0, NotChecked=0, Total=10100 [2019-10-07 13:42:34,879 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 101 states. [2019-10-07 13:42:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:42:39,866 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2019-10-07 13:42:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-10-07 13:42:39,868 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 56 [2019-10-07 13:42:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:42:39,869 INFO L225 Difference]: With dead ends: 110 [2019-10-07 13:42:39,869 INFO L226 Difference]: Without dead ends: 105 [2019-10-07 13:42:39,878 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 71 SyntacticMatches, 46 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7232 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13692, Invalid=24138, Unknown=0, NotChecked=0, Total=37830 [2019-10-07 13:42:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-07 13:42:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-10-07 13:42:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-07 13:42:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-10-07 13:42:39,890 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2019-10-07 13:42:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:42:39,891 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-10-07 13:42:39,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-10-07 13:42:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-10-07 13:42:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 13:42:39,893 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:42:39,893 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:42:40,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:40,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:42:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:42:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -169416360, now seen corresponding path program 6 times [2019-10-07 13:42:40,099 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:42:40,099 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:40,100 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:40,100 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:42:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:42:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:42:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:45,317 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:42:45,317 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:42:45,317 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:42:45,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:42:45,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:42:45,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 97 conjunts are in the unsatisfiable core [2019-10-07 13:42:45,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:42:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:42:50,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:00,835 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:00,836 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:43:00,836 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:00,837 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:00,837 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:00,837 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:00,850 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:43:00,908 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:43:00,927 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:43:00,930 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:00,930 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:00,930 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:43:00,931 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:43:00,931 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:43:00,931 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:00,931 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-07 13:43:00,932 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:43:00,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:00,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-07 13:43:00,932 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:00,932 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:43:00,933 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:01,581 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:01,581 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 6] total 197 [2019-10-07 13:43:01,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 197 states [2019-10-07 13:43:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2019-10-07 13:43:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9880, Invalid=28732, Unknown=0, NotChecked=0, Total=38612 [2019-10-07 13:43:01,588 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 197 states. [2019-10-07 13:43:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:11,902 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-10-07 13:43:11,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-10-07 13:43:11,902 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 104 [2019-10-07 13:43:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:11,905 INFO L225 Difference]: With dead ends: 116 [2019-10-07 13:43:11,905 INFO L226 Difference]: Without dead ends: 111 [2019-10-07 13:43:11,910 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 118 SyntacticMatches, 95 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15467 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=15795, Invalid=72117, Unknown=0, NotChecked=0, Total=87912 [2019-10-07 13:43:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-07 13:43:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-07 13:43:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-07 13:43:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-10-07 13:43:11,922 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 104 [2019-10-07 13:43:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:11,923 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-10-07 13:43:11,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 197 states. [2019-10-07 13:43:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-10-07 13:43:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 13:43:11,924 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:11,925 INFO L385 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:12,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:12,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:12,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash 24723800, now seen corresponding path program 7 times [2019-10-07 13:43:12,136 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:12,136 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:12,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:12,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:18,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:18,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:18,562 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:18,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 110 conjunts are in the unsatisfiable core [2019-10-07 13:43:18,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:28,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:30,148 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-10-07 13:43:30,606 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-07 13:43:31,166 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-07 13:43:31,969 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-07 13:43:32,769 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-10-07 13:43:33,637 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2019-10-07 13:43:34,561 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-10-07 13:43:35,440 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-10-07 13:43:36,367 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2019-10-07 13:43:37,370 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 117 [2019-10-07 13:43:38,916 WARN L191 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-10-07 13:43:40,361 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 127 [2019-10-07 13:43:41,531 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 137 [2019-10-07 13:43:43,360 WARN L191 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 143 [2019-10-07 13:43:44,722 WARN L191 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 153 [2019-10-07 13:43:46,688 WARN L191 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 159 [2019-10-07 13:43:48,629 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 207 DAG size of output: 167 [2019-10-07 13:43:50,112 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 177 [2019-10-07 13:43:52,421 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 227 DAG size of output: 183 [2019-10-07 13:43:54,788 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 237 DAG size of output: 191 [2019-10-07 13:43:56,581 WARN L191 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 201 [2019-10-07 13:43:58,394 WARN L191 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 211 [2019-10-07 13:44:00,289 WARN L191 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 221 [2019-10-07 13:44:03,671 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 277 DAG size of output: 223 [2019-10-07 13:44:06,631 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 287 DAG size of output: 231 [2019-10-07 13:44:09,703 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 297 DAG size of output: 239 [2019-10-07 13:44:11,965 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 307 DAG size of output: 249 [2019-10-07 13:44:14,203 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 321 DAG size of output: 259 [2019-10-07 13:44:18,187 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 327 DAG size of output: 263 [2019-10-07 13:44:20,684 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 337 DAG size of output: 273 [2019-10-07 13:44:24,726 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 347 DAG size of output: 280 [2019-10-07 13:44:28,557 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 356 DAG size of output: 288 [2019-10-07 13:44:31,274 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 367 DAG size of output: 298 [2019-10-07 13:44:35,667 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 376 DAG size of output: 304 [2019-10-07 13:44:40,067 WARN L191 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 387 DAG size of output: 311 [2019-10-07 13:44:43,120 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 397 DAG size of output: 321 [2019-10-07 13:44:46,068 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 411 DAG size of output: 331 [2019-10-07 13:44:49,126 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 424 DAG size of output: 341 [2019-10-07 13:44:52,245 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 437 DAG size of output: 351 [2019-10-07 13:44:55,528 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 447 DAG size of output: 358 [2019-10-07 13:44:58,876 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 457 DAG size of output: 366 [2019-10-07 13:45:05,676 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 457 DAG size of output: 367 [2019-10-07 13:45:11,525 WARN L191 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 467 DAG size of output: 375 [2019-10-07 13:45:17,357 WARN L191 SmtUtils]: Spent 3.93 s on a formula simplification. DAG size of input: 477 DAG size of output: 383 [2019-10-07 13:45:21,270 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 487 DAG size of output: 393 [2019-10-07 13:45:25,021 WARN L191 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 496 DAG size of output: 400 [2019-10-07 13:45:31,733 WARN L191 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 505 DAG size of output: 406 [2019-10-07 13:45:38,147 WARN L191 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 513 DAG size of output: 413 [2019-10-07 13:45:44,614 WARN L191 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 522 DAG size of output: 419 [2019-10-07 13:45:51,391 WARN L191 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 532 DAG size of output: 426 [2019-10-07 13:45:55,775 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 541 DAG size of output: 435 [2019-10-07 13:45:59,943 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 554 DAG size of output: 444 [2019-10-07 13:46:04,282 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 566 DAG size of output: 453 [2019-10-07 13:46:08,771 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 568 DAG size of output: 455 [2019-10-07 13:46:13,134 WARN L191 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 579 DAG size of output: 464 [2019-10-07 13:46:17,660 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 592 DAG size of output: 473 [2019-10-07 13:46:27,135 WARN L191 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 595 DAG size of output: 476 [2019-10-07 13:46:32,273 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 605 DAG size of output: 485 [2019-10-07 13:46:37,148 WARN L191 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 617 DAG size of output: 494 [2019-10-07 13:46:42,102 WARN L191 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 626 DAG size of output: 500 [2019-10-07 13:46:47,179 WARN L191 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 637 DAG size of output: 509 [2019-10-07 13:46:52,347 WARN L191 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 650 DAG size of output: 518 [2019-10-07 13:46:58,009 WARN L191 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 653 DAG size of output: 521 [2019-10-07 13:47:03,266 WARN L191 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 664 DAG size of output: 530 [2019-10-07 13:47:08,604 WARN L191 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 677 DAG size of output: 539 [2019-10-07 13:47:14,144 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 689 DAG size of output: 548 [2019-10-07 13:47:19,690 WARN L191 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 701 DAG size of output: 557 [2019-10-07 13:47:25,637 WARN L191 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 704 DAG size of output: 559 [2019-10-07 13:47:31,682 WARN L191 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 707 DAG size of output: 563 [2019-10-07 13:47:38,252 WARN L191 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 716 DAG size of output: 570 [2019-10-07 13:47:44,527 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 722 DAG size of output: 575 [2019-10-07 13:47:51,857 WARN L191 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 731 DAG size of output: 582 [2019-10-07 13:48:04,104 WARN L191 SmtUtils]: Spent 9.13 s on a formula simplification. DAG size of input: 739 DAG size of output: 587 [2019-10-07 13:48:16,595 WARN L191 SmtUtils]: Spent 9.48 s on a formula simplification. DAG size of input: 748 DAG size of output: 594 [2019-10-07 13:48:24,234 WARN L191 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 757 DAG size of output: 603 [2019-10-07 13:48:31,365 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 770 DAG size of output: 612 [2019-10-07 13:48:38,643 WARN L191 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 782 DAG size of output: 621 [2019-10-07 13:48:46,050 WARN L191 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 794 DAG size of output: 630 [2019-10-07 13:48:53,644 WARN L191 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 806 DAG size of output: 639 [2019-10-07 13:49:01,278 WARN L191 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 810 DAG size of output: 644 [2019-10-07 13:49:19,499 WARN L191 SmtUtils]: Spent 13.73 s on a formula simplification. DAG size of input: 811 DAG size of output: 643 [2019-10-07 13:49:34,259 WARN L191 SmtUtils]: Spent 11.21 s on a formula simplification. DAG size of input: 820 DAG size of output: 650 [2019-10-07 13:49:42,548 WARN L191 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 829 DAG size of output: 659 [2019-10-07 13:49:58,517 WARN L191 SmtUtils]: Spent 12.30 s on a formula simplification. DAG size of input: 838 DAG size of output: 664 [2019-10-07 13:50:07,688 WARN L191 SmtUtils]: Spent 5.88 s on a formula simplification. DAG size of input: 847 DAG size of output: 673 [2019-10-07 13:50:16,241 WARN L191 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 856 DAG size of output: 680 [2019-10-07 13:50:24,621 WARN L191 SmtUtils]: Spent 5.15 s on a formula simplification. DAG size of input: 868 DAG size of output: 689 [2019-10-07 13:50:33,355 WARN L191 SmtUtils]: Spent 5.26 s on a formula simplification. DAG size of input: 880 DAG size of output: 698 [2019-10-07 13:50:42,274 WARN L191 SmtUtils]: Spent 5.41 s on a formula simplification. DAG size of input: 892 DAG size of output: 707 [2019-10-07 13:50:51,429 WARN L191 SmtUtils]: Spent 5.58 s on a formula simplification. DAG size of input: 904 DAG size of output: 716 [2019-10-07 13:51:14,934 WARN L191 SmtUtils]: Spent 18.04 s on a formula simplification. DAG size of input: 901 DAG size of output: 713 [2019-10-07 13:51:33,586 WARN L191 SmtUtils]: Spent 14.58 s on a formula simplification. DAG size of input: 910 DAG size of output: 720 [2019-10-07 13:51:44,316 WARN L191 SmtUtils]: Spent 6.86 s on a formula simplification. DAG size of input: 919 DAG size of output: 729 [2019-10-07 13:51:54,285 WARN L191 SmtUtils]: Spent 6.00 s on a formula simplification. DAG size of input: 932 DAG size of output: 738 [2019-10-07 13:52:16,386 WARN L191 SmtUtils]: Spent 17.33 s on a formula simplification. DAG size of input: 937 DAG size of output: 741 [2019-10-07 13:52:27,705 WARN L191 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 946 DAG size of output: 750 [2019-10-07 13:52:38,438 WARN L191 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 960 DAG size of output: 760 [2019-10-07 13:52:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:52:39,990 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:52:39,991 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:52:39,991 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:52:39,992 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:52:39,992 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:52:39,992 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:52:40,000 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:52:40,064 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:52:40,075 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:52:40,077 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:52:40,077 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:52:40,078 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:52:40,078 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:52:40,078 INFO L193 IcfgInterpreter]: Reachable states at location L13-2 satisfy 91#(and (not (< main_~x~0 100)) (<= 0 main_~x~0) (<= 100 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:52:40,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 111#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:52:40,078 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 120#true [2019-10-07 13:52:40,079 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 86#(and (<= 0 main_~x~0) (<= 50 main_~y~0)) [2019-10-07 13:52:40,079 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:52:40,079 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 115#true [2019-10-07 13:52:40,079 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 106#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:52:40,079 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 96#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 13:52:40,079 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 101#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:52:43,605 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:52:43,605 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105, 6] total 262 [2019-10-07 13:52:43,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 262 states [2019-10-07 13:52:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 262 interpolants. [2019-10-07 13:52:43,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=878, Invalid=67504, Unknown=0, NotChecked=0, Total=68382 [2019-10-07 13:52:43,610 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 262 states. [2019-10-07 13:53:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:53:43,798 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-10-07 13:53:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-07 13:53:43,799 INFO L78 Accepts]: Start accepts. Automaton has 262 states. Word has length 110 [2019-10-07 13:53:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:53:43,800 INFO L225 Difference]: With dead ends: 115 [2019-10-07 13:53:43,800 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:53:43,804 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 122 SyntacticMatches, 52 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12447 ImplicationChecksByTransitivity, 568.5s TimeCoverageRelationStatistics Valid=891, Invalid=68541, Unknown=0, NotChecked=0, Total=69432 [2019-10-07 13:53:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:53:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:53:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:53:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:53:43,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2019-10-07 13:53:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:53:43,805 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:53:43,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 262 states. [2019-10-07 13:53:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:53:43,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:53:44,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:53:44,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:53:44,183 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 555 [2019-10-07 13:53:46,753 WARN L191 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 555 DAG size of output: 309 [2019-10-07 13:53:46,758 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:53:46,758 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:53:46,758 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:53:46,759 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:53:46,759 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:53:46,759 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:53:46,759 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2019-10-07 13:53:46,759 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2019-10-07 13:53:46,759 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-10-07 13:53:46,761 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 13 20) the Hoare annotation is: (or (and (<= 56 main_~y~0) (<= main_~x~0 56) (<= main_~y~0 56) (<= 56 main_~x~0)) (and (<= 71 main_~x~0) (<= main_~y~0 71) (<= main_~x~0 71) (<= 71 main_~y~0)) (and (<= main_~y~0 66) (<= 66 main_~x~0) (<= 66 main_~y~0) (<= main_~x~0 66)) (and (<= main_~y~0 59) (<= 59 main_~x~0) (<= main_~x~0 59) (<= 59 main_~y~0)) (and (<= main_~y~0 78) (<= 78 main_~y~0) (<= main_~x~0 78) (<= 78 main_~x~0)) (and (<= 94 main_~x~0) (<= main_~x~0 94) (<= main_~y~0 94) (<= 94 main_~y~0)) (and (<= 52 main_~y~0) (<= main_~y~0 52) (<= main_~x~0 52) (<= 52 main_~x~0)) (and (<= 68 main_~x~0) (<= 68 main_~y~0) (<= main_~y~0 68) (<= main_~x~0 68)) (and (<= 54 main_~x~0) (<= main_~x~0 54) (<= 54 main_~y~0) (<= main_~y~0 54)) (and (<= main_~y~0 77) (<= 77 main_~x~0) (<= main_~x~0 77) (<= 77 main_~y~0)) (and (<= 72 main_~x~0) (<= main_~y~0 72) (<= main_~x~0 72) (<= 72 main_~y~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) (<= 80 main_~y~0) (<= main_~y~0 80)) (and (<= main_~y~0 69) (<= 69 main_~y~0) (<= main_~x~0 69) (<= 69 main_~x~0)) (and (<= main_~x~0 91) (<= 91 main_~x~0) (<= 91 main_~y~0) (<= main_~y~0 91)) (and (<= 51 main_~y~0) (<= main_~x~0 51) (<= 51 main_~x~0) (<= main_~y~0 51)) (and (<= 58 main_~x~0) (<= main_~x~0 58) (<= main_~y~0 58) (<= 58 main_~y~0)) (and (<= 96 main_~y~0) (< main_~x~0 97) (<= 96 main_~x~0) (<= main_~y~0 96)) (and (<= 63 main_~x~0) (<= main_~y~0 63) (<= main_~x~0 63) (<= 63 main_~y~0)) (and (<= main_~y~0 84) (<= 84 main_~x~0) (<= 84 main_~y~0) (<= main_~x~0 84)) (and (<= 83 main_~x~0) (<= main_~y~0 83) (<= 83 main_~y~0) (<= main_~x~0 83)) (and (<= 85 main_~y~0) (<= main_~x~0 85) (<= 85 main_~x~0) (<= main_~y~0 85)) (and (<= main_~y~0 61) (<= 61 main_~x~0) (<= 61 main_~y~0) (<= main_~x~0 61)) (and (<= 67 main_~x~0) (<= main_~y~0 67) (<= main_~x~0 67) (<= 67 main_~y~0)) (and (<= main_~y~0 95) (<= 95 main_~y~0) (< main_~x~0 96) (<= 95 main_~x~0)) (and (<= 82 main_~y~0) (<= main_~y~0 82) (<= 82 main_~x~0) (<= main_~x~0 82)) (and (<= 90 main_~y~0) (<= main_~y~0 90) (<= 90 main_~x~0) (<= main_~x~0 90)) (and (<= main_~y~0 100) (< 99 main_~y~0) (<= 100 main_~x~0)) (and (<= main_~y~0 55) (<= 55 main_~y~0) (<= main_~x~0 55) (<= 55 main_~x~0)) (and (<= 93 main_~x~0) (<= main_~x~0 93) (<= 93 main_~y~0) (<= main_~y~0 93)) (and (<= 99 main_~y~0) (<= main_~y~0 99) (< main_~x~0 100) (<= 99 main_~x~0)) (and (<= main_~x~0 60) (<= main_~y~0 60) (<= 60 main_~x~0) (<= 60 main_~y~0)) (and (<= 73 main_~y~0) (<= main_~x~0 73) (<= 73 main_~x~0) (<= main_~y~0 73)) (and (<= main_~y~0 50) (<= main_~x~0 50) (<= 0 main_~x~0) (<= 50 main_~y~0)) (and (<= 57 main_~x~0) (<= 57 main_~y~0) (<= main_~x~0 57) (<= main_~y~0 57)) (and (<= 75 main_~y~0) (<= main_~x~0 75) (<= main_~y~0 75) (<= 75 main_~x~0)) (and (<= main_~x~0 64) (<= 64 main_~x~0) (<= 64 main_~y~0) (<= main_~y~0 64)) (and (<= main_~x~0 98) (<= main_~y~0 98) (<= 98 main_~y~0) (<= 98 main_~x~0)) (and (<= main_~y~0 76) (<= 76 main_~x~0) (<= main_~x~0 76) (<= 76 main_~y~0)) (and (<= main_~x~0 81) (<= 81 main_~y~0) (<= 81 main_~x~0) (<= main_~y~0 81)) (and (<= 74 main_~x~0) (<= 74 main_~y~0) (<= main_~y~0 74) (<= main_~x~0 74)) (and (<= main_~y~0 62) (<= 62 main_~x~0) (<= main_~x~0 62) (<= 62 main_~y~0)) (and (<= main_~x~0 70) (<= main_~y~0 70) (<= 70 main_~x~0) (<= 70 main_~y~0)) (and (<= main_~x~0 87) (<= 87 main_~x~0) (<= main_~y~0 87) (<= 87 main_~y~0)) (and (<= main_~x~0 79) (<= main_~y~0 79) (<= 79 main_~x~0) (<= 79 main_~y~0)) (and (<= main_~x~0 88) (<= 88 main_~x~0) (<= main_~y~0 88) (<= 88 main_~y~0)) (and (<= 53 main_~x~0) (<= main_~y~0 53) (<= main_~x~0 53) (<= 53 main_~y~0)) (and (<= 89 main_~y~0) (<= main_~y~0 89) (<= 89 main_~x~0) (<= main_~x~0 89)) (and (<= 97 main_~y~0) (<= 97 main_~x~0) (<= main_~x~0 97) (<= main_~y~0 97)) (and (<= 86 main_~y~0) (<= main_~x~0 86) (<= main_~y~0 86) (<= 86 main_~x~0)) (and (<= main_~y~0 65) (<= 65 main_~y~0) (<= 65 main_~x~0) (<= main_~x~0 65)) (and (<= main_~y~0 92) (<= 92 main_~y~0) (<= main_~x~0 92) (<= 92 main_~x~0))) [2019-10-07 13:53:46,761 INFO L439 ceAbstractionStarter]: At program point L13-2(lines 13 20) the Hoare annotation is: (and (<= main_~y~0 100) (< 99 main_~y~0) (<= 100 main_~x~0)) [2019-10-07 13:53:46,761 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:53:46,761 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:53:46,761 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:53:46,762 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:53:46,762 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:53:46,762 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:53:46,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:53:46 BoogieIcfgContainer [2019-10-07 13:53:46,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:53:46,794 INFO L168 Benchmark]: Toolchain (without parser) took 687532.68 ms. Allocated memory was 137.4 MB in the beginning and 179.3 MB in the end (delta: 41.9 MB). Free memory was 100.9 MB in the beginning and 88.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 117.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:53:46,795 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.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:53:46,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.68 ms. Allocated memory is still 137.4 MB. Free memory was 100.5 MB in the beginning and 91.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:53:46,796 INFO L168 Benchmark]: Boogie Preprocessor took 105.19 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 179.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:53:46,797 INFO L168 Benchmark]: RCFGBuilder took 249.70 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 167.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:53:46,797 INFO L168 Benchmark]: TraceAbstraction took 686935.47 ms. Allocated memory was 200.8 MB in the beginning and 179.3 MB in the end (delta: -21.5 MB). Free memory was 167.1 MB in the beginning and 88.1 MB in the end (delta: 79.0 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:53:46,799 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 137.4 MB. Free memory was 119.4 MB in the beginning and 119.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 237.68 ms. Allocated memory is still 137.4 MB. Free memory was 100.5 MB in the beginning and 91.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.19 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 179.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 249.70 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 167.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 686935.47 ms. Allocated memory was 200.8 MB in the beginning and 179.3 MB in the end (delta: -21.5 MB). Free memory was 167.1 MB in the beginning and 88.1 MB in the end (delta: 79.0 MB). Peak memory consumption was 120.3 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: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((56 <= y && x <= 56) && y <= 56) && 56 <= x) || (((71 <= x && y <= 71) && x <= 71) && 71 <= y)) || (((y <= 66 && 66 <= x) && 66 <= y) && x <= 66)) || (((y <= 59 && 59 <= x) && x <= 59) && 59 <= y)) || (((y <= 78 && 78 <= y) && x <= 78) && 78 <= x)) || (((94 <= x && x <= 94) && y <= 94) && 94 <= y)) || (((52 <= y && y <= 52) && x <= 52) && 52 <= x)) || (((68 <= x && 68 <= y) && y <= 68) && x <= 68)) || (((54 <= x && x <= 54) && 54 <= y) && y <= 54)) || (((y <= 77 && 77 <= x) && x <= 77) && 77 <= y)) || (((72 <= x && y <= 72) && x <= 72) && 72 <= y)) || (((80 <= x && x <= 80) && 80 <= y) && y <= 80)) || (((y <= 69 && 69 <= y) && x <= 69) && 69 <= x)) || (((x <= 91 && 91 <= x) && 91 <= y) && y <= 91)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((58 <= x && x <= 58) && y <= 58) && 58 <= y)) || (((96 <= y && x < 97) && 96 <= x) && y <= 96)) || (((63 <= x && y <= 63) && x <= 63) && 63 <= y)) || (((y <= 84 && 84 <= x) && 84 <= y) && x <= 84)) || (((83 <= x && y <= 83) && 83 <= y) && x <= 83)) || (((85 <= y && x <= 85) && 85 <= x) && y <= 85)) || (((y <= 61 && 61 <= x) && 61 <= y) && x <= 61)) || (((67 <= x && y <= 67) && x <= 67) && 67 <= y)) || (((y <= 95 && 95 <= y) && x < 96) && 95 <= x)) || (((82 <= y && y <= 82) && 82 <= x) && x <= 82)) || (((90 <= y && y <= 90) && 90 <= x) && x <= 90)) || ((y <= 100 && 99 < y) && 100 <= x)) || (((y <= 55 && 55 <= y) && x <= 55) && 55 <= x)) || (((93 <= x && x <= 93) && 93 <= y) && y <= 93)) || (((99 <= y && y <= 99) && x < 100) && 99 <= x)) || (((x <= 60 && y <= 60) && 60 <= x) && 60 <= y)) || (((73 <= y && x <= 73) && 73 <= x) && y <= 73)) || (((y <= 50 && x <= 50) && 0 <= x) && 50 <= y)) || (((57 <= x && 57 <= y) && x <= 57) && y <= 57)) || (((75 <= y && x <= 75) && y <= 75) && 75 <= x)) || (((x <= 64 && 64 <= x) && 64 <= y) && y <= 64)) || (((x <= 98 && y <= 98) && 98 <= y) && 98 <= x)) || (((y <= 76 && 76 <= x) && x <= 76) && 76 <= y)) || (((x <= 81 && 81 <= y) && 81 <= x) && y <= 81)) || (((74 <= x && 74 <= y) && y <= 74) && x <= 74)) || (((y <= 62 && 62 <= x) && x <= 62) && 62 <= y)) || (((x <= 70 && y <= 70) && 70 <= x) && 70 <= y)) || (((x <= 87 && 87 <= x) && y <= 87) && 87 <= y)) || (((x <= 79 && y <= 79) && 79 <= x) && 79 <= y)) || (((x <= 88 && 88 <= x) && y <= 88) && 88 <= y)) || (((53 <= x && y <= 53) && x <= 53) && 53 <= y)) || (((89 <= y && y <= 89) && 89 <= x) && x <= 89)) || (((97 <= y && 97 <= x) && x <= 97) && y <= 97)) || (((86 <= y && x <= 86) && y <= 86) && 86 <= x)) || (((y <= 65 && 65 <= y) && 65 <= x) && x <= 65)) || (((y <= 92 && 92 <= y) && x <= 92) && 92 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 686.8s, OverallIterations: 8, TraceHistogramMax: 100, AutomataDifference: 78.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 64 SDtfs, 37 SDslu, 876 SDs, 0 SdLazy, 27055 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1615 GetRequests, 450 SyntacticMatches, 230 SemanticMatches, 935 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37692 ImplicationChecksByTransitivity, 610.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 117 NumberOfFragments, 676 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1382 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 596.8s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1029 ConstructedInterpolants, 0 QuantifiedInterpolants, 8829728 SizeOfPredicates, 21 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 0/32745 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1055, ICFG_INTERPRETER_ENTERED_PROCEDURES: 28, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 154, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 77, TOOLS_POST_TIME[ms]: 67, TOOLS_POST_CALL_APPLICATIONS: 35, TOOLS_POST_CALL_TIME[ms]: 12, TOOLS_POST_RETURN_APPLICATIONS: 14, TOOLS_POST_RETURN_TIME[ms]: 1, TOOLS_QUANTIFIERELIM_APPLICATIONS: 126, TOOLS_QUANTIFIERELIM_TIME[ms]: 58, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 8, FLUID_QUERY_TIME[ms]: 8, FLUID_QUERIES: 182, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 133, DOMAIN_JOIN_TIME[ms]: 573, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 21, DOMAIN_WIDEN_TIME[ms]: 163, DOMAIN_ISSUBSETEQ_APPLICATIONS: 28, DOMAIN_ISSUBSETEQ_TIME[ms]: 68, DOMAIN_ISBOTTOM_APPLICATIONS: 7, DOMAIN_ISBOTTOM_TIME[ms]: 14, LOOP_SUMMARIZER_APPLICATIONS: 7, LOOP_SUMMARIZER_CACHE_MISSES: 7, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 565, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 564, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 28, CALL_SUMMARIZER_APPLICATIONS: 14, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME[ms]: 21, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 20, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 31, DAG_COMPRESSION_PROCESSED_NODES: 399, DAG_COMPRESSION_RETAINED_NODES: 287, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...