java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:31:32,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:31:32,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:31:32,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:31:32,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:31:32,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:31:32,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:31:32,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:31:32,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:31:32,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:31:32,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:31:32,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:31:32,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:31:32,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:31:32,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:31:32,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:31:32,827 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:31:32,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:31:32,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:31:32,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:31:32,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:31:32,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:31:32,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:31:32,853 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:31:32,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:31:32,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:31:32,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:31:32,857 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:31:32,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:31:32,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:31:32,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:31:32,863 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:31:32,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:31:32,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:31:32,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:31:32,865 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:31:32,868 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:31:32,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:31:32,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:31:32,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:31:32,899 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:31:32,899 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:31:32,899 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:31:32,899 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:31:32,900 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:31:32,900 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:31:32,900 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:31:32,900 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:31:32,900 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:31:32,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:31:32,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:31:32,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:31:32,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:31:32,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:31:32,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:31:32,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:31:32,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:31:32,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:31:32,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:31:32,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:31:32,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:31:32,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:31:32,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:31:32,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:31:32,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:31:32,906 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:31:32,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:31:32,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:31:32,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:31:32,907 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:31:32,907 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:31:32,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:31:32,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:31:32,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:31:32,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:31:32,987 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:31:32,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-07 16:31:33,055 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68eada6c8/e369c1b7d996443d8ba5f8aff460789e/FLAG952d405dd [2018-11-07 16:31:33,551 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:31:33,552 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search_false-unreach-call.i [2018-11-07 16:31:33,560 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68eada6c8/e369c1b7d996443d8ba5f8aff460789e/FLAG952d405dd [2018-11-07 16:31:33,582 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68eada6c8/e369c1b7d996443d8ba5f8aff460789e [2018-11-07 16:31:33,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:31:33,594 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:31:33,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:31:33,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:31:33,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:31:33,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21792bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33, skipping insertion in model container [2018-11-07 16:31:33,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:31:33,637 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:31:33,839 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:31:33,856 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:31:33,885 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:31:33,903 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:31:33,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33 WrapperNode [2018-11-07 16:31:33,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:31:33,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:31:33,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:31:33,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:31:33,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:31:33,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:31:33,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:31:33,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:31:33,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... [2018-11-07 16:31:33,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:31:33,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:31:33,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:31:33,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:31:33,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:31:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 16:31:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:31:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:31:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2018-11-07 16:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2018-11-07 16:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:31:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:31:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:31:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:31:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:31:34,564 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:31:34,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:34 BoogieIcfgContainer [2018-11-07 16:31:34,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:31:34,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:31:34,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:31:34,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:31:34,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:31:33" (1/3) ... [2018-11-07 16:31:34,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6872db85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:31:34, skipping insertion in model container [2018-11-07 16:31:34,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:33" (2/3) ... [2018-11-07 16:31:34,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6872db85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:31:34, skipping insertion in model container [2018-11-07 16:31:34,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:34" (3/3) ... [2018-11-07 16:31:34,574 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search_false-unreach-call.i [2018-11-07 16:31:34,584 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:31:34,594 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:31:34,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:31:34,655 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:31:34,656 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:31:34,656 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:31:34,656 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:31:34,656 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:31:34,656 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:31:34,656 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:31:34,657 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:31:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-07 16:31:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:31:34,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:34,685 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:34,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:34,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash -700503731, now seen corresponding path program 1 times [2018-11-07 16:31:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:34,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:34,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:34,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:34,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:34,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:31:34,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:31:34,909 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:31:34,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:31:34,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:31:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:31:34,934 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-11-07 16:31:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:34,969 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-07 16:31:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:31:34,971 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-07 16:31:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:34,982 INFO L225 Difference]: With dead ends: 53 [2018-11-07 16:31:34,982 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:31:34,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:31:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:31:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 16:31:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:31:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-07 16:31:35,034 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2018-11-07 16:31:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:35,036 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-07 16:31:35,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:31:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-07 16:31:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 16:31:35,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:35,039 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:35,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:35,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash -822404528, now seen corresponding path program 1 times [2018-11-07 16:31:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:35,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:35,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:31:35,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:31:35,249 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:31:35,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:31:35,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:31:35,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:31:35,253 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-11-07 16:31:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:35,325 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-07 16:31:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:31:35,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 16:31:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:35,327 INFO L225 Difference]: With dead ends: 34 [2018-11-07 16:31:35,327 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 16:31:35,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:31:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 16:31:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 16:31:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:31:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 16:31:35,334 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2018-11-07 16:31:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:35,335 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 16:31:35,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:31:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 16:31:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 16:31:35,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:35,336 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:35,336 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:35,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash 920405807, now seen corresponding path program 1 times [2018-11-07 16:31:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:35,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:35,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:35,836 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-11-07 16:31:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:35,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:31:35,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:31:35,838 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:31:35,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:31:35,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:31:35,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:31:35,840 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-07 16:31:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:35,962 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-07 16:31:35,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:31:35,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-07 16:31:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:35,966 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:31:35,967 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:31:35,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:31:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:31:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-07 16:31:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:31:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-07 16:31:35,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2018-11-07 16:31:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:35,976 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-07 16:31:35,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:31:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-07 16:31:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 16:31:35,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:35,977 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:35,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:35,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash 581654309, now seen corresponding path program 1 times [2018-11-07 16:31:35,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:35,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:35,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:35,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:31:36,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:31:36,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:31:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:31:36,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:31:36,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:31:36,047 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-11-07 16:31:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:36,068 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-07 16:31:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:31:36,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-07 16:31:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:36,071 INFO L225 Difference]: With dead ends: 50 [2018-11-07 16:31:36,071 INFO L226 Difference]: Without dead ends: 33 [2018-11-07 16:31:36,072 INFO L604 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 [2018-11-07 16:31:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-07 16:31:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-07 16:31:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 16:31:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-07 16:31:36,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 27 [2018-11-07 16:31:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:36,079 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-07 16:31:36,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:31:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-07 16:31:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:31:36,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:36,083 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:36,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:36,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash -303738142, now seen corresponding path program 1 times [2018-11-07 16:31:36,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:36,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:36,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:36,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:36,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:36,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:31:36,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:31:36,388 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:31:36,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:31:36,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:31:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:31:36,390 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2018-11-07 16:31:36,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:36,548 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-07 16:31:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:31:36,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-07 16:31:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:36,552 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:31:36,552 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 16:31:36,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:31:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 16:31:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-07 16:31:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 16:31:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-07 16:31:36,561 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2018-11-07 16:31:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:36,561 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-07 16:31:36,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:31:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-07 16:31:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:31:36,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:36,563 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:36,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash -890544156, now seen corresponding path program 1 times [2018-11-07 16:31:36,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:36,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:36,565 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:37,668 WARN L179 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 27 [2018-11-07 16:31:37,865 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-11-07 16:31:38,234 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2018-11-07 16:31:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:38,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:38,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:38,497 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-07 16:31:38,499 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [13], [15], [19], [21], [26], [34], [35], [39], [40], [41], [43], [49], [52], [54], [60], [61], [62], [64], [65], [66] [2018-11-07 16:31:38,537 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:31:38,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:31:38,666 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:31:39,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:31:39,092 INFO L272 AbstractInterpreter]: Visited 27 different actions 135 times. Merged at 11 different actions 85 times. Widened at 1 different actions 4 times. Found 24 fixpoints after 6 different actions. Largest state had 25 variables. [2018-11-07 16:31:39,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:39,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:31:39,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:39,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:39,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:39,153 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:31:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:39,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:39,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-07 16:31:39,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:31:39,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:39,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:39,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-07 16:31:39,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:31:39,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:39,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:39,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:39,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-11-07 16:31:40,104 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-07 16:31:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:41,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:41,972 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2018-11-07 16:31:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:43,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:43,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 32 [2018-11-07 16:31:43,211 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:43,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 16:31:43,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 16:31:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=846, Unknown=1, NotChecked=0, Total=992 [2018-11-07 16:31:43,215 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 21 states. [2018-11-07 16:31:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:44,123 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-07 16:31:44,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:31:44,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-11-07 16:31:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:44,129 INFO L225 Difference]: With dead ends: 50 [2018-11-07 16:31:44,129 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:31:44,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=219, Invalid=1112, Unknown=1, NotChecked=0, Total=1332 [2018-11-07 16:31:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:31:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 16:31:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 16:31:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-07 16:31:44,138 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 29 [2018-11-07 16:31:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:44,138 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-07 16:31:44,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 16:31:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-07 16:31:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 16:31:44,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:44,140 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:44,140 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:44,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:44,141 INFO L82 PathProgramCache]: Analyzing trace with hash 157283469, now seen corresponding path program 1 times [2018-11-07 16:31:44,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:44,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:44,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:44,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:44,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:44,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:44,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:44,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-07 16:31:44,272 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [13], [15], [19], [21], [24], [26], [34], [35], [39], [40], [41], [43], [49], [52], [54], [60], [61], [62], [64], [65], [66] [2018-11-07 16:31:44,274 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:31:44,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:31:44,284 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:31:44,589 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:31:44,589 INFO L272 AbstractInterpreter]: Visited 28 different actions 171 times. Merged at 12 different actions 105 times. Widened at 2 different actions 6 times. Found 34 fixpoints after 7 different actions. Largest state had 25 variables. [2018-11-07 16:31:44,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:44,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:31:44,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:44,625 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:44,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:44,643 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:31:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:44,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:44,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:31:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:44,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:31:44,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-11-07 16:31:44,850 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:31:44,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:31:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:31:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:31:44,851 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 7 states. [2018-11-07 16:31:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:31:45,045 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-11-07 16:31:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:31:45,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-11-07 16:31:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:31:45,046 INFO L225 Difference]: With dead ends: 68 [2018-11-07 16:31:45,047 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 16:31:45,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:31:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 16:31:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-11-07 16:31:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 16:31:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-07 16:31:45,055 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 36 [2018-11-07 16:31:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:31:45,055 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-07 16:31:45,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:31:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-07 16:31:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 16:31:45,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:31:45,057 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:31:45,057 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:31:45,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:31:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash -429522545, now seen corresponding path program 2 times [2018-11-07 16:31:45,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:31:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:45,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:31:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:31:45,059 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:31:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:31:47,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (* 2 (div c_~SIZE~0 2))) (.cse19 (div c_~SIZE~0 4294967296))) (let ((.cse18 (div (+ c_~SIZE~0 (* (- 4294967296) .cse19)) 2)) (.cse1 (* 4294967296 .cse19)) (.cse7 (= .cse17 c_~SIZE~0))) (let ((.cse2 (not .cse7)) (.cse3 (< c_~SIZE~0 .cse1)) (.cse8 (<= .cse1 c_~SIZE~0)) (.cse16 (* 4 .cse18)) (.cse10 (div .cse18 4294967296)) (.cse11 (div (+ .cse18 1) 4294967296))) (let ((.cse13 (* 17179869184 .cse11)) (.cse14 (+ (* 17179869184 .cse10) 4)) (.cse12 (+ |c_main_~#a~0.offset| .cse16)) (.cse0 (* 2 .cse18)) (.cse5 (or .cse7 .cse8)) (.cse9 (and .cse2 .cse3))) (and (or (let ((.cse6 (+ .cse11 1)) (.cse4 (+ .cse10 1))) (and (or (and (<= (+ .cse0 .cse1 2) c_~SIZE~0) .cse2 .cse3) (and (<= .cse4 0) .cse5) (and (<= (+ .cse0 .cse1) c_~SIZE~0) .cse5) (and (<= .cse6 0) .cse2 .cse3)) (or (and (or .cse7 .cse8 (< 0 .cse6)) (or .cse9 (< 0 .cse4))) (and (<= 0 .cse10) .cse5) (and (<= 0 .cse11) .cse2 .cse3)))) (and .cse2 (<= .cse12 .cse13) .cse3) (and (<= .cse12 .cse14) .cse5)) (= 0 |c_main_~#a~0.offset|) (or (and (or .cse7 .cse8 (< .cse13 .cse12)) (or .cse9 (< .cse14 .cse12))) (and (<= c_~SIZE~0 (+ .cse1 .cse0 1)) (let ((.cse15 (select |c_#memory_int| |c_main_~#a~0.base|))) (or (and (= 3 (select .cse15 (+ (* (- 17179869184) .cse10) |c_main_~#a~0.offset| .cse16))) .cse5) (and .cse2 (= 3 (select .cse15 (+ (* (- 17179869184) .cse11) |c_main_~#a~0.offset| .cse16 4))) .cse3))) (<= .cse17 c_~SIZE~0) (or (and .cse2 (<= (+ (* 8589934592 .cse11) .cse1) c_~SIZE~0) .cse3) (and (<= (+ (* 8589934592 .cse10) .cse1) c_~SIZE~0) .cse5)) (or .cse7 .cse8 .cse9) (<= c_~SIZE~0 (+ .cse17 1)))) (= |c_main_~#a~0.offset| 0)))))) is different from true [2018-11-07 16:31:47,615 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-11-07 16:31:47,729 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2018-11-07 16:31:48,017 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2018-11-07 16:31:48,455 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2018-11-07 16:31:48,599 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2018-11-07 16:31:48,995 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-11-07 16:31:49,658 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-11-07 16:31:51,676 WARN L854 $PredicateComparison]: unable to prove that (or (not (= |c_linear_search_#in~a.offset| 0)) (let ((.cse17 (div c_~SIZE~0 4294967296))) (let ((.cse2 (* 4294967296 .cse17))) (let ((.cse15 (<= c_~SIZE~0 (+ .cse2 2)))) (and (or (let ((.cse14 (div c_~SIZE~0 2))) (let ((.cse4 (* 2 .cse14))) (let ((.cse16 (= .cse4 c_~SIZE~0)) (.cse12 (div (+ c_~SIZE~0 (* (- 4294967296) .cse17)) 2))) (let ((.cse1 (div .cse12 4294967296)) (.cse3 (or .cse16 (<= .cse2 c_~SIZE~0))) (.cse13 (div (+ .cse12 1) 4294967296)) (.cse8 (not .cse16)) (.cse9 (< c_~SIZE~0 .cse2))) (and (let ((.cse0 (+ c_~SIZE~0 1))) (or (and (<= .cse0 (+ (* 8589934592 .cse1) .cse2)) .cse3) (<= (+ .cse4 2) c_~SIZE~0) (let ((.cse11 (* 8 .cse14))) (let ((.cse10 (* 17179869184 .cse1)) (.cse5 (* 17179869184 .cse13)) (.cse6 (* 4 c_~SIZE~0)) (.cse7 (+ .cse11 (* 4 .cse12)))) (and (or (and (<= (+ .cse5 .cse6 4) .cse7) .cse8 .cse9) (and (<= (+ .cse10 .cse6 4) .cse7) .cse3)) (or (and (<= (+ .cse10 .cse6 5) .cse7) .cse3) (not (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (- (+ .cse11 (+ (* (- 4) c_~SIZE~0) (- 4))))) |c_linear_search_#in~q|)) (and (<= (+ .cse5 .cse6 5) .cse7) .cse8 .cse9))))) (<= (+ .cse2 (* 2 .cse12) 2) c_~SIZE~0) (and .cse8 (<= .cse0 (+ (* 8589934592 .cse13) .cse2)) .cse9))) (or (and (<= (+ .cse1 1) 0) .cse3) .cse15 (and (<= (+ .cse13 1) 0) .cse8 .cse9))))))) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse2)))) .cse15))))) is different from true [2018-11-07 16:31:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:31:51,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:51,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:31:51,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:31:51,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:31:51,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:31:51,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:31:51,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:31:51,704 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:31:51,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:31:51,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:31:51,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:31:57,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-07 16:31:57,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:31:57,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:58,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:58,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-11-07 16:31:58,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:31:58,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:31:58,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:31:58,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 16:31:58,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:142, output treesize:30 [2018-11-07 16:32:03,647 WARN L179 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-07 16:32:06,038 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-07 16:32:08,533 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-07 16:32:10,633 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-07 16:32:11,118 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-07 16:32:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:11,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:11,515 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2018-11-07 16:32:14,473 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-07 16:32:15,183 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-11-07 16:32:15,444 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 16:32:15,687 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-07 16:32:16,113 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2018-11-07 16:32:16,426 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-07 16:32:16,770 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-07 16:32:17,532 WARN L179 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-07 16:32:20,068 WARN L179 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-07 16:32:23,549 WARN L179 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-07 16:32:23,591 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:32:23,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:23,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:23,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 24 variables, input treesize:917, output treesize:1 [2018-11-07 16:32:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:23,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:23,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 18] total 51 [2018-11-07 16:32:23,646 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:23,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 16:32:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 16:32:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2052, Unknown=5, NotChecked=190, Total=2550 [2018-11-07 16:32:23,648 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 35 states. [2018-11-07 16:32:26,025 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2018-11-07 16:32:26,377 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2018-11-07 16:32:27,372 WARN L179 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-11-07 16:32:27,728 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2018-11-07 16:32:28,064 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 57 [2018-11-07 16:32:32,366 WARN L179 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-07 16:32:32,792 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-11-07 16:32:34,301 WARN L179 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-07 16:32:36,530 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-11-07 16:32:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:36,916 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-07 16:32:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 16:32:36,917 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2018-11-07 16:32:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:36,918 INFO L225 Difference]: With dead ends: 60 [2018-11-07 16:32:36,918 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:32:36,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=523, Invalid=2902, Unknown=5, NotChecked=230, Total=3660 [2018-11-07 16:32:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:32:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-11-07 16:32:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:32:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-07 16:32:36,938 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-11-07 16:32:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:36,938 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-07 16:32:36,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 16:32:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-07 16:32:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-07 16:32:36,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:36,941 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:36,944 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:36,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash 673041330, now seen corresponding path program 1 times [2018-11-07 16:32:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:36,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:32:36,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:36,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:37,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:37,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:37,355 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-07 16:32:37,355 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [13], [19], [21], [26], [34], [35], [39], [40], [41], [43], [49], [52], [54], [60], [61], [62], [64], [65], [66] [2018-11-07 16:32:37,357 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:32:37,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:32:37,364 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:32:37,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:32:37,463 INFO L272 AbstractInterpreter]: Visited 26 different actions 114 times. Merged at 10 different actions 80 times. Widened at 1 different actions 4 times. Found 9 fixpoints after 2 different actions. Largest state had 25 variables. [2018-11-07 16:32:37,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:37,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:32:37,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:37,499 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:37,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:37,516 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:32:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:37,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:40,476 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 16:32:44,697 WARN L179 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2018-11-07 16:32:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:44,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:45,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:45,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 27 [2018-11-07 16:32:45,706 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:45,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:32:45,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:32:45,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-11-07 16:32:45,707 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 19 states. [2018-11-07 16:32:46,381 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-07 16:32:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:46,785 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-07 16:32:46,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:32:46,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-11-07 16:32:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:46,787 INFO L225 Difference]: With dead ends: 56 [2018-11-07 16:32:46,787 INFO L226 Difference]: Without dead ends: 47 [2018-11-07 16:32:46,788 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=318, Invalid=872, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 16:32:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-07 16:32:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-07 16:32:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-07 16:32:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-07 16:32:46,794 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2018-11-07 16:32:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:46,795 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-07 16:32:46,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:32:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-07 16:32:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:32:46,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:46,796 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:46,796 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:46,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash -246993790, now seen corresponding path program 2 times [2018-11-07 16:32:46,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:46,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:46,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:32:46,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:46,798 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:47,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:47,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:47,139 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:32:47,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:32:47,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:47,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:47,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:32:47,149 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:32:47,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 16:32:47,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:32:47,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:47,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:47,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:32:47,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-11-07 16:32:47,388 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:32:47,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:32:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:32:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:32:47,389 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 9 states. [2018-11-07 16:32:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:32:47,542 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-07 16:32:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:32:47,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-11-07 16:32:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:32:47,545 INFO L225 Difference]: With dead ends: 75 [2018-11-07 16:32:47,545 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 16:32:47,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:32:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 16:32:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-07 16:32:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:32:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-07 16:32:47,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 43 [2018-11-07 16:32:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:32:47,561 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-07 16:32:47,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:32:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-07 16:32:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:32:47,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:32:47,562 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:32:47,562 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:32:47,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:32:47,562 INFO L82 PathProgramCache]: Analyzing trace with hash -833799804, now seen corresponding path program 3 times [2018-11-07 16:32:47,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:32:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:47,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:32:47,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:32:47,563 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:32:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:32:47,930 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-07 16:32:50,131 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 119 DAG size of output: 31 [2018-11-07 16:32:50,573 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-11-07 16:32:51,728 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-11-07 16:32:52,252 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-11-07 16:32:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:53,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:53,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:32:53,137 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:32:53,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:32:53,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:32:53,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:32:53,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:32:53,147 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:32:53,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:32:53,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:32:53,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:32:53,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-07 16:32:53,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:32:53,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:53,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:53,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-07 16:32:53,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:32:53,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:32:53,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:55,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:32:55,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:21 [2018-11-07 16:32:56,115 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-07 16:32:57,314 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-11-07 16:32:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:32:57,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:32:57,745 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-11-07 16:32:59,129 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 16:32:59,339 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-07 16:32:59,644 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-07 16:33:02,361 WARN L179 SmtUtils]: Spent 2.52 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-07 16:33:02,759 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-07 16:33:03,633 WARN L179 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-07 16:33:06,179 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-07 16:33:06,924 WARN L179 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-07 16:33:11,437 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-07 16:33:26,534 WARN L179 SmtUtils]: Spent 14.69 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-07 16:33:31,728 WARN L179 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-11-07 16:33:31,764 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 16:33:31,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:33,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 26 dim-0 vars, 13 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:33,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 39 variables, input treesize:1661, output treesize:1 [2018-11-07 16:33:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:33,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:33,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 57 [2018-11-07 16:33:33,931 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:33,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-07 16:33:33,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-07 16:33:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=2925, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 16:33:33,933 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 37 states. [2018-11-07 16:33:34,470 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-07 16:33:35,053 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-07 16:33:35,276 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-11-07 16:33:35,653 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-07 16:33:36,068 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2018-11-07 16:33:36,304 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2018-11-07 16:33:36,571 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-07 16:33:37,208 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-11-07 16:33:37,429 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2018-11-07 16:33:37,699 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2018-11-07 16:33:38,137 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2018-11-07 16:33:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:39,032 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-07 16:33:39,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 16:33:39,032 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2018-11-07 16:33:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:39,033 INFO L225 Difference]: With dead ends: 64 [2018-11-07 16:33:39,033 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 16:33:39,036 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=527, Invalid=4875, Unknown=0, NotChecked=0, Total=5402 [2018-11-07 16:33:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 16:33:39,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-07 16:33:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:33:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-07 16:33:39,043 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 43 [2018-11-07 16:33:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:39,044 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-07 16:33:39,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-07 16:33:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-07 16:33:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:33:39,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:39,045 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:39,045 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:39,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1923352301, now seen corresponding path program 3 times [2018-11-07 16:33:39,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:39,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:39,047 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:39,513 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-11-07 16:33:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:39,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:39,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:39,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:39,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:39,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:39,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:39,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:33:39,963 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:33:40,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:33:40,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:33:40,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:40,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:40,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:33:40,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-07 16:33:40,522 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:33:40,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:33:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:33:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:33:40,523 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 11 states. [2018-11-07 16:33:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:33:40,691 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-07 16:33:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:33:40,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-07 16:33:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:33:40,693 INFO L225 Difference]: With dead ends: 82 [2018-11-07 16:33:40,693 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 16:33:40,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:33:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 16:33:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-11-07 16:33:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 16:33:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-07 16:33:40,703 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2018-11-07 16:33:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:33:40,703 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-07 16:33:40,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:33:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-07 16:33:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-07 16:33:40,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:33:40,704 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:33:40,705 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:33:40,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:33:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1336546287, now seen corresponding path program 4 times [2018-11-07 16:33:40,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:33:40,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:40,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:33:40,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:33:40,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:33:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:41,014 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-11-07 16:33:41,661 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 24 [2018-11-07 16:33:41,957 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-07 16:33:42,421 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 28 [2018-11-07 16:33:43,058 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2018-11-07 16:33:43,245 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2018-11-07 16:33:43,484 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-11-07 16:33:43,652 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 44 [2018-11-07 16:33:44,213 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-07 16:33:50,545 WARN L179 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 89 DAG size of output: 35 [2018-11-07 16:33:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:50,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:50,566 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:33:50,567 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:33:50,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:33:50,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:33:50,567 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:33:50,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:33:50,576 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:33:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:33:50,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:33:50,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-07 16:33:50,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:33:50,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-07 16:33:50,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-07 16:33:50,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 16:33:50,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:17 [2018-11-07 16:33:51,792 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-07 16:33:52,558 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-07 16:33:52,799 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-11-07 16:33:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:33:53,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:33:53,495 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-11-07 16:33:54,262 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-07 16:33:55,238 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-07 16:33:55,991 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-07 16:33:56,333 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-07 16:33:56,641 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-07 16:33:59,300 WARN L179 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 57 [2018-11-07 16:34:00,864 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-11-07 16:34:01,315 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-07 16:34:01,668 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-07 16:34:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:01,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:01,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 51 [2018-11-07 16:34:01,850 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:01,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 16:34:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 16:34:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2314, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 16:34:01,852 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 36 states. [2018-11-07 16:34:03,068 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2018-11-07 16:34:03,813 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2018-11-07 16:34:04,050 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2018-11-07 16:34:04,731 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-07 16:34:04,912 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 40 [2018-11-07 16:34:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:34:09,317 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-11-07 16:34:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 16:34:09,317 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2018-11-07 16:34:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:34:09,318 INFO L225 Difference]: With dead ends: 74 [2018-11-07 16:34:09,318 INFO L226 Difference]: Without dead ends: 64 [2018-11-07 16:34:09,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=445, Invalid=3587, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 16:34:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-07 16:34:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-11-07 16:34:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 16:34:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-07 16:34:09,328 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 50 [2018-11-07 16:34:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:34:09,328 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-07 16:34:09,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 16:34:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-07 16:34:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 16:34:09,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:34:09,329 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:34:09,330 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:34:09,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:34:09,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1353106962, now seen corresponding path program 2 times [2018-11-07 16:34:09,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:34:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:09,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:34:09,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:34:09,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:34:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:34:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:34:09,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:09,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:34:09,885 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:34:09,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:34:09,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:34:09,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:34:09,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:34:09,895 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:34:09,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-07 16:34:09,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:34:09,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:34:14,320 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 34 DAG size of output: 13 [2018-11-07 16:34:18,306 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 16:34:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-07 16:34:18,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:34:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-07 16:34:19,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:34:19,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 21 [2018-11-07 16:34:19,904 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:34:19,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:34:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:34:19,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=335, Unknown=2, NotChecked=0, Total=420 [2018-11-07 16:34:19,905 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 17 states. [2018-11-07 16:34:20,371 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2018-11-07 16:34:22,451 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 40 DAG size of output: 24 [2018-11-07 16:34:24,557 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-11-07 16:34:28,274 WARN L179 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-11-07 16:34:28,792 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-11-07 16:34:28,968 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2018-11-07 16:34:31,037 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2018-11-07 16:34:33,088 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-11-07 16:34:33,673 WARN L179 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-11-07 16:34:37,954 WARN L179 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2018-11-07 16:34:42,078 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-11-07 16:34:46,215 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2018-11-07 16:34:48,318 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-11-07 16:34:50,449 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-07 16:34:54,040 WARN L179 SmtUtils]: Spent 3.49 s on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-11-07 16:34:58,215 WARN L179 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-11-07 16:35:00,307 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-11-07 16:35:02,242 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-07 16:35:04,363 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-07 16:35:06,537 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 16:35:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:35:06,568 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-07 16:35:06,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 16:35:06,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-07 16:35:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:35:06,570 INFO L225 Difference]: With dead ends: 73 [2018-11-07 16:35:06,570 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 16:35:06,572 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 33 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=457, Invalid=1611, Unknown=2, NotChecked=0, Total=2070 [2018-11-07 16:35:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 16:35:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-11-07 16:35:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 16:35:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-07 16:35:06,581 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-11-07 16:35:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:35:06,581 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-07 16:35:06,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:35:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-07 16:35:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 16:35:06,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:35:06,583 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:35:06,583 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:35:06,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash 488353314, now seen corresponding path program 4 times [2018-11-07 16:35:06,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:35:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:06,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:35:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:06,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:35:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:07,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:07,073 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:35:07,074 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:35:07,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:35:07,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:07,074 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:35:07,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:35:07,084 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:35:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:07,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:35:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:07,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:35:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:35:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-07 16:35:07,327 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:35:07,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:35:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:35:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:35:07,328 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2018-11-07 16:35:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:35:07,502 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-11-07 16:35:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:35:07,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-07 16:35:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:35:07,503 INFO L225 Difference]: With dead ends: 89 [2018-11-07 16:35:07,503 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 16:35:07,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:35:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 16:35:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-11-07 16:35:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 16:35:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-07 16:35:07,516 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 57 [2018-11-07 16:35:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:35:07,517 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-07 16:35:07,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:35:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-07 16:35:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 16:35:07,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:35:07,518 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:35:07,518 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:35:07,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:35:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash -98452700, now seen corresponding path program 5 times [2018-11-07 16:35:07,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:35:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:07,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:35:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:35:07,519 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:35:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:35:07,973 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 28 [2018-11-07 16:35:08,170 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-11-07 16:35:08,672 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2018-11-07 16:35:08,823 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2018-11-07 16:35:08,975 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-11-07 16:35:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:35:09,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:09,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:35:09,733 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:35:09,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:35:09,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:35:09,733 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:35:09,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:35:09,742 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:35:51,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:35:51,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:35:51,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:35:58,375 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 13 Received shutdown request... [2018-11-07 16:36:00,393 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 16:36:00,593 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:36:00,594 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 16:36:00,600 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 16:36:00,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:36:00 BoogieIcfgContainer [2018-11-07 16:36:00,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:36:00,601 INFO L168 Benchmark]: Toolchain (without parser) took 267007.87 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -658.5 MB). Peak memory consumption was 392.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:36:00,602 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:36:00,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:36:00,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:36:00,603 INFO L168 Benchmark]: Boogie Preprocessor took 32.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:36:00,604 INFO L168 Benchmark]: RCFGBuilder took 600.12 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:36:00,604 INFO L168 Benchmark]: TraceAbstraction took 266033.83 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 315.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 112.8 MB). Peak memory consumption was 428.4 MB. Max. memory is 7.1 GB. [2018-11-07 16:36:00,612 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 600.12 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 266033.83 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 315.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 112.8 MB). Peak memory consumption was 428.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 20 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. TIMEOUT Result, 265.9s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 75.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 412 SDtfs, 653 SDslu, 2407 SDs, 0 SdLazy, 2948 SolverSat, 132 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 663 SyntacticMatches, 59 SemanticMatches, 368 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4725 ImplicationChecksByTransitivity, 191.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 65 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 134.0s InterpolantComputationTime, 987 NumberOfCodeBlocks, 959 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1386 ConstructedInterpolants, 207 QuantifiedInterpolants, 1686588 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 276/1181 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown