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-LIM.epf -i ../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 19:56:44,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 19:56:44,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 19:56:44,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 19:56:44,833 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 19:56:44,834 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 19:56:44,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 19:56:44,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 19:56:44,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 19:56:44,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 19:56:44,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 19:56:44,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 19:56:44,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 19:56:44,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 19:56:44,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 19:56:44,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 19:56:44,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 19:56:44,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 19:56:44,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 19:56:44,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 19:56:44,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 19:56:44,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 19:56:44,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 19:56:44,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 19:56:44,858 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 19:56:44,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 19:56:44,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 19:56:44,861 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 19:56:44,862 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 19:56:44,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 19:56:44,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 19:56:44,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 19:56:44,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 19:56:44,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 19:56:44,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 19:56:44,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 19:56:44,867 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-LIM.epf [2018-11-12 19:56:44,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 19:56:44,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 19:56:44,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 19:56:44,884 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 19:56:44,884 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 19:56:44,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 19:56:44,885 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 19:56:44,885 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 19:56:44,885 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 19:56:44,885 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 19:56:44,885 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 19:56:44,886 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 19:56:44,886 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 19:56:44,887 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 19:56:44,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 19:56:44,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 19:56:44,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 19:56:44,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 19:56:44,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 19:56:44,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 19:56:44,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 19:56:44,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 19:56:44,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 19:56:44,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 19:56:44,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 19:56:44,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 19:56:44,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 19:56:44,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 19:56:44,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 19:56:44,890 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 19:56:44,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 19:56:44,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 19:56:44,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 19:56:44,891 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 19:56:44,891 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 19:56:44,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 19:56:44,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 19:56:44,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 19:56:44,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 19:56:44,983 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 19:56:44,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-12 19:56:45,055 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4116d037/803dc5517ba34f25a7ae17ecd75d27b9/FLAG638c29229 [2018-11-12 19:56:45,600 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 19:56:45,601 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-12 19:56:45,614 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4116d037/803dc5517ba34f25a7ae17ecd75d27b9/FLAG638c29229 [2018-11-12 19:56:45,629 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4116d037/803dc5517ba34f25a7ae17ecd75d27b9 [2018-11-12 19:56:45,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 19:56:45,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 19:56:45,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 19:56:45,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 19:56:45,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 19:56:45,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:56:45" (1/1) ... [2018-11-12 19:56:45,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a8900a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:45, skipping insertion in model container [2018-11-12 19:56:45,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:56:45" (1/1) ... [2018-11-12 19:56:45,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 19:56:45,710 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 19:56:46,033 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:56:46,038 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 19:56:46,168 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 19:56:46,187 INFO L193 MainTranslator]: Completed translation [2018-11-12 19:56:46,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46 WrapperNode [2018-11-12 19:56:46,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 19:56:46,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 19:56:46,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 19:56:46,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 19:56:46,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 19:56:46,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 19:56:46,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 19:56:46,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 19:56:46,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (1/1) ... [2018-11-12 19:56:46,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 19:56:46,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 19:56:46,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 19:56:46,370 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 19:56:46,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (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-12 19:56:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 19:56:46,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 19:56:46,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 19:56:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 19:56:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 19:56:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 19:56:48,202 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 19:56:48,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:56:48 BoogieIcfgContainer [2018-11-12 19:56:48,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 19:56:48,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 19:56:48,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 19:56:48,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 19:56:48,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:56:45" (1/3) ... [2018-11-12 19:56:48,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad58b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:56:48, skipping insertion in model container [2018-11-12 19:56:48,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:56:46" (2/3) ... [2018-11-12 19:56:48,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad58b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:56:48, skipping insertion in model container [2018-11-12 19:56:48,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:56:48" (3/3) ... [2018-11-12 19:56:48,212 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-12 19:56:48,220 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 19:56:48,228 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 19:56:48,242 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 19:56:48,278 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 19:56:48,279 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 19:56:48,279 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 19:56:48,279 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 19:56:48,279 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 19:56:48,280 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 19:56:48,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 19:56:48,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 19:56:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-12 19:56:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 19:56:48,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:48,311 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:56:48,314 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:48,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-12 19:56:48,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:48,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:48,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:48,491 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-12 19:56:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:48,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 19:56:48,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:48,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 19:56:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 19:56:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 19:56:48,515 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-12 19:56:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:48,555 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-12 19:56:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 19:56:48,557 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-12 19:56:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:48,570 INFO L225 Difference]: With dead ends: 222 [2018-11-12 19:56:48,570 INFO L226 Difference]: Without dead ends: 104 [2018-11-12 19:56:48,575 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-12 19:56:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-12 19:56:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-12 19:56:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-12 19:56:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-12 19:56:48,635 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-12 19:56:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:48,635 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-12 19:56:48,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 19:56:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-12 19:56:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 19:56:48,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:48,637 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:56:48,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:48,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-12 19:56:48,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:48,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:48,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:48,787 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-12 19:56:48,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:48,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:56:48,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:48,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:56:48,793 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-12 19:56:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:48,963 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-12 19:56:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:48,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-12 19:56:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:48,966 INFO L225 Difference]: With dead ends: 205 [2018-11-12 19:56:48,966 INFO L226 Difference]: Without dead ends: 107 [2018-11-12 19:56:48,967 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-12 19:56:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-12 19:56:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-12 19:56:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-12 19:56:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-12 19:56:48,982 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-12 19:56:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:48,982 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-12 19:56:48,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-12 19:56:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 19:56:48,984 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:48,985 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:56:48,985 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:48,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-12 19:56:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:48,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:49,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:49,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:56:49,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:49,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:56:49,203 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-11-12 19:56:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:49,637 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-12 19:56:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:49,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-12 19:56:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:49,640 INFO L225 Difference]: With dead ends: 209 [2018-11-12 19:56:49,640 INFO L226 Difference]: Without dead ends: 190 [2018-11-12 19:56:49,641 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-12 19:56:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-12 19:56:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-12 19:56:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-12 19:56:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-12 19:56:49,657 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-12 19:56:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:49,657 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-12 19:56:49,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-12 19:56:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-12 19:56:49,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:49,659 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:56:49,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:49,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:49,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-12 19:56:49,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:49,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:49,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:49,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:56:49,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:49,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:49,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:56:49,747 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-12 19:56:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:49,828 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-12 19:56:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:49,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-12 19:56:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:49,830 INFO L225 Difference]: With dead ends: 297 [2018-11-12 19:56:49,830 INFO L226 Difference]: Without dead ends: 128 [2018-11-12 19:56:49,832 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-12 19:56:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-12 19:56:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-12 19:56:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-12 19:56:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-12 19:56:49,842 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-12 19:56:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:49,843 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-12 19:56:49,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-12 19:56:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 19:56:49,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:49,844 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:56:49,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:49,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-12 19:56:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:49,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:49,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 19:56:49,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:49,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:56:49,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:49,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:56:49,988 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-12 19:56:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:50,118 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-12 19:56:50,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:50,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-12 19:56:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:50,120 INFO L225 Difference]: With dead ends: 230 [2018-11-12 19:56:50,120 INFO L226 Difference]: Without dead ends: 111 [2018-11-12 19:56:50,121 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-12 19:56:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-12 19:56:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-12 19:56:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-12 19:56:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-12 19:56:50,129 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-12 19:56:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:50,130 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-12 19:56:50,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-12 19:56:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 19:56:50,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:50,132 INFO L375 BasicCegarLoop]: trace histogram [3, 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-12 19:56:50,132 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:50,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-12 19:56:50,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:50,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:50,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:50,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:50,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:56:50,264 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-12 19:56:50,268 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [233], [236], [239], [520], [523], [524], [525] [2018-11-12 19:56:50,309 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:56:50,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:56:50,588 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:56:51,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:56:51,041 INFO L272 AbstractInterpreter]: Visited 24 different actions 63 times. Merged at 17 different actions 34 times. Never widened. Performed 832 root evaluator evaluations with a maximum evaluation depth of 6. Performed 832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 5 fixpoints after 3 different actions. Largest state had 39 variables. [2018-11-12 19:56:51,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:51,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:56:51,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:51,077 INFO L192 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-12 19:56:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:51,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:56:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:51,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:56:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:51,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:56:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:51,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:56:51,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 19:56:51,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:56:51,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:56:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:56:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:56:51,499 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-12 19:56:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:52,161 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-12 19:56:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:56:52,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-12 19:56:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:52,165 INFO L225 Difference]: With dead ends: 192 [2018-11-12 19:56:52,165 INFO L226 Difference]: Without dead ends: 174 [2018-11-12 19:56:52,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:56:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-12 19:56:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-12 19:56:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-12 19:56:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-12 19:56:52,189 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-12 19:56:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:52,189 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-12 19:56:52,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:56:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-12 19:56:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 19:56:52,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:52,192 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 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-12 19:56:52,192 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:52,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:52,192 INFO L82 PathProgramCache]: Analyzing trace with hash 945458420, now seen corresponding path program 1 times [2018-11-12 19:56:52,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:52,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:52,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:52,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:52,456 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:56:52,615 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:56:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:52,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:52,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:56:52,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-12 19:56:52,621 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [520], [523], [524], [525] [2018-11-12 19:56:52,623 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:56:52,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:56:52,682 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:56:52,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:56:52,756 INFO L272 AbstractInterpreter]: Visited 25 different actions 36 times. Merged at 7 different actions 8 times. Never widened. Performed 446 root evaluator evaluations with a maximum evaluation depth of 6. Performed 446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 40 variables. [2018-11-12 19:56:52,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:52,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:56:52,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:52,794 INFO L192 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-12 19:56:52,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:52,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:56:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:52,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:56:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:52,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:56:53,208 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-12 19:56:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:56:53,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-12 19:56:53,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:56:53,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 19:56:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 19:56:53,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:56:53,307 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 4 states. [2018-11-12 19:56:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:53,711 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-11-12 19:56:53,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 19:56:53,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-12 19:56:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:53,713 INFO L225 Difference]: With dead ends: 230 [2018-11-12 19:56:53,714 INFO L226 Difference]: Without dead ends: 226 [2018-11-12 19:56:53,714 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-12 19:56:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-12 19:56:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-11-12 19:56:53,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-12 19:56:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-11-12 19:56:53,725 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-11-12 19:56:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:53,726 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-11-12 19:56:53,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 19:56:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-11-12 19:56:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 19:56:53,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:53,728 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-12 19:56:53,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:53,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1709359769, now seen corresponding path program 1 times [2018-11-12 19:56:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:53,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:53,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 19:56:53,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:53,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:56:53,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:53,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:53,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:53,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:56:53,826 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-11-12 19:56:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:54,068 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-11-12 19:56:54,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:54,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-12 19:56:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:54,072 INFO L225 Difference]: With dead ends: 391 [2018-11-12 19:56:54,072 INFO L226 Difference]: Without dead ends: 202 [2018-11-12 19:56:54,073 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-12 19:56:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-12 19:56:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-12 19:56:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-12 19:56:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-11-12 19:56:54,083 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-11-12 19:56:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:54,083 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-11-12 19:56:54,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-11-12 19:56:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 19:56:54,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:54,088 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1] [2018-11-12 19:56:54,088 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:54,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:54,088 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-12 19:56:54,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:54,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:54,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:54,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:54,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:56:54,369 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-12 19:56:54,369 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [261], [276], [291], [294], [297], [300], [520], [523], [524], [525] [2018-11-12 19:56:54,372 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:56:54,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:56:54,412 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:56:54,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:56:54,472 INFO L272 AbstractInterpreter]: Visited 28 different actions 39 times. Merged at 7 different actions 8 times. Never widened. Performed 467 root evaluator evaluations with a maximum evaluation depth of 6. Performed 467 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 43 variables. [2018-11-12 19:56:54,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:54,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:56:54,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:54,511 INFO L192 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-12 19:56:54,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:54,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:56:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:54,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:56:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 19:56:54,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:56:55,203 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2018-11-12 19:56:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 19:56:55,332 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-12 19:56:55,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2018-11-12 19:56:55,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:55,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:55,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:55,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:56:55,334 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 3 states. [2018-11-12 19:56:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:55,358 INFO L93 Difference]: Finished difference Result 203 states and 303 transitions. [2018-11-12 19:56:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:55,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-12 19:56:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:55,361 INFO L225 Difference]: With dead ends: 203 [2018-11-12 19:56:55,361 INFO L226 Difference]: Without dead ends: 197 [2018-11-12 19:56:55,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:56:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-12 19:56:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-11-12 19:56:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-12 19:56:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2018-11-12 19:56:55,375 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 31 [2018-11-12 19:56:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:55,375 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2018-11-12 19:56:55,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2018-11-12 19:56:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-12 19:56:55,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:55,379 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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, 1] [2018-11-12 19:56:55,380 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:55,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash -592457384, now seen corresponding path program 1 times [2018-11-12 19:56:55,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:55,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:55,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 19:56:55,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:56:55,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:56:55,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:56:55,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:56:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:56:55,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:56:55,471 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand 3 states. [2018-11-12 19:56:55,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:55,550 INFO L93 Difference]: Finished difference Result 348 states and 524 transitions. [2018-11-12 19:56:55,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:56:55,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-12 19:56:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:55,552 INFO L225 Difference]: With dead ends: 348 [2018-11-12 19:56:55,552 INFO L226 Difference]: Without dead ends: 198 [2018-11-12 19:56:55,553 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-12 19:56:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-12 19:56:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-12 19:56:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-12 19:56:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2018-11-12 19:56:55,561 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 36 [2018-11-12 19:56:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:55,562 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2018-11-12 19:56:55,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:56:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2018-11-12 19:56:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 19:56:55,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:55,563 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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, 1] [2018-11-12 19:56:55,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:55,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1564943497, now seen corresponding path program 1 times [2018-11-12 19:56:55,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:55,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:55,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:55,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:56:55,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:55,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:56:55,816 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-12 19:56:55,816 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [520], [523], [524], [525] [2018-11-12 19:56:55,818 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:56:55,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:56:55,852 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:56:56,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:56:56,565 INFO L272 AbstractInterpreter]: Visited 30 different actions 187 times. Merged at 23 different actions 138 times. Widened at 2 different actions 6 times. Performed 2277 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2277 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 18 fixpoints after 6 different actions. Largest state had 41 variables. [2018-11-12 19:56:56,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:56,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:56:56,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:56,605 INFO L192 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-12 19:56:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:56,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:56:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:56,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:56:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:56:56,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:56:57,352 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 13 [2018-11-12 19:56:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:56:57,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:56:57,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-12 19:56:57,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:56:57,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 19:56:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 19:56:57,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:56:57,613 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand 5 states. [2018-11-12 19:56:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:56:58,360 INFO L93 Difference]: Finished difference Result 255 states and 378 transitions. [2018-11-12 19:56:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 19:56:58,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-12 19:56:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:56:58,362 INFO L225 Difference]: With dead ends: 255 [2018-11-12 19:56:58,363 INFO L226 Difference]: Without dead ends: 250 [2018-11-12 19:56:58,363 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-12 19:56:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-12 19:56:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2018-11-12 19:56:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-12 19:56:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-11-12 19:56:58,372 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-11-12 19:56:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:56:58,372 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-11-12 19:56:58,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 19:56:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-11-12 19:56:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-12 19:56:58,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:56:58,373 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1] [2018-11-12 19:56:58,374 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:56:58,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-12 19:56:58,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:56:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:58,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:56:58,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:56:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:58,578 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:56:58,758 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:56:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:56:58,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:58,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:56:58,891 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-12 19:56:58,891 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [520], [523], [524], [525] [2018-11-12 19:56:58,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:56:58,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:56:58,921 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:56:59,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:56:59,704 INFO L272 AbstractInterpreter]: Visited 33 different actions 229 times. Merged at 26 different actions 174 times. Widened at 3 different actions 7 times. Performed 3035 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3035 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 22 fixpoints after 7 different actions. Largest state had 44 variables. [2018-11-12 19:56:59,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:56:59,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:56:59,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:56:59,742 INFO L192 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-12 19:56:59,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:56:59,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:56:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:56:59,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:00,088 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-11-12 19:57:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:00,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:00,420 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 12 [2018-11-12 19:57:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-11-12 19:57:00,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:00,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 19:57:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 19:57:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-12 19:57:00,607 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 6 states. [2018-11-12 19:57:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:00,959 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-11-12 19:57:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 19:57:00,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-12 19:57:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:00,962 INFO L225 Difference]: With dead ends: 254 [2018-11-12 19:57:00,963 INFO L226 Difference]: Without dead ends: 252 [2018-11-12 19:57:00,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-12 19:57:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-12 19:57:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-11-12 19:57:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-12 19:57:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-11-12 19:57:00,972 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-11-12 19:57:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:00,972 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-11-12 19:57:00,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 19:57:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-11-12 19:57:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-12 19:57:00,973 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:00,973 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1] [2018-11-12 19:57:00,974 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:00,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-12 19:57:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:00,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:00,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 19:57:01,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:57:01,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:57:01,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:57:01,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:57:01,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:57:01,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:57:01,053 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-11-12 19:57:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:01,163 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-11-12 19:57:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:57:01,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-12 19:57:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:01,166 INFO L225 Difference]: With dead ends: 428 [2018-11-12 19:57:01,166 INFO L226 Difference]: Without dead ends: 229 [2018-11-12 19:57:01,167 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-12 19:57:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-12 19:57:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-11-12 19:57:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-12 19:57:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-11-12 19:57:01,176 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-11-12 19:57:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:01,176 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-11-12 19:57:01,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:57:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-11-12 19:57:01,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-12 19:57:01,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:01,177 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:01,178 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:01,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-12 19:57:01,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:01,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:01,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:01,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-12 19:57:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 19:57:01,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 19:57:01,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 19:57:01,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 19:57:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 19:57:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 19:57:01,266 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-11-12 19:57:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:01,526 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-11-12 19:57:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 19:57:01,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-12 19:57:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:01,528 INFO L225 Difference]: With dead ends: 309 [2018-11-12 19:57:01,528 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 19:57:01,529 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-12 19:57:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 19:57:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-12 19:57:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-12 19:57:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-12 19:57:01,535 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-11-12 19:57:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:01,536 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-12 19:57:01,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 19:57:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-12 19:57:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 19:57:01,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:01,537 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:01,537 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:01,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-12 19:57:01,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:01,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:01,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:01,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 19:57:01,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:01,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:01,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-12 19:57:01,962 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [520], [523], [524], [525] [2018-11-12 19:57:01,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:01,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:01,993 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:02,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:02,755 INFO L272 AbstractInterpreter]: Visited 39 different actions 244 times. Merged at 32 different actions 175 times. Widened at 2 different actions 6 times. Performed 2851 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2851 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 27 fixpoints after 10 different actions. Largest state had 46 variables. [2018-11-12 19:57:02,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:02,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:02,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:02,793 INFO L192 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-12 19:57:02,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:02,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:02,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:02,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:03,327 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-12 19:57:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:03,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:03,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-12 19:57:03,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:03,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 19:57:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 19:57:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:57:03,510 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-11-12 19:57:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:03,843 INFO L93 Difference]: Finished difference Result 190 states and 264 transitions. [2018-11-12 19:57:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:57:03,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-12 19:57:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:03,845 INFO L225 Difference]: With dead ends: 190 [2018-11-12 19:57:03,845 INFO L226 Difference]: Without dead ends: 186 [2018-11-12 19:57:03,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:57:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-12 19:57:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-11-12 19:57:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-12 19:57:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2018-11-12 19:57:03,853 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 51 [2018-11-12 19:57:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:03,853 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2018-11-12 19:57:03,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 19:57:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2018-11-12 19:57:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-12 19:57:03,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:03,855 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:03,855 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:03,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash 412447638, now seen corresponding path program 1 times [2018-11-12 19:57:03,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:03,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:03,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:04,089 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:04,263 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:04,461 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 19:57:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:04,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:04,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:04,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-12 19:57:04,660 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [506], [520], [523], [524], [525] [2018-11-12 19:57:04,662 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:04,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:04,688 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:05,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:05,475 INFO L272 AbstractInterpreter]: Visited 43 different actions 290 times. Merged at 36 different actions 219 times. Widened at 3 different actions 7 times. Performed 3340 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3340 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 28 fixpoints after 7 different actions. Largest state had 50 variables. [2018-11-12 19:57:05,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:05,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:05,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:05,506 INFO L192 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-12 19:57:05,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:05,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:05,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:06,196 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-11-12 19:57:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:06,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 19:57:06,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:06,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2018-11-12 19:57:06,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:06,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 19:57:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 19:57:06,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-12 19:57:06,596 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 9 states. [2018-11-12 19:57:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:07,088 INFO L93 Difference]: Finished difference Result 193 states and 265 transitions. [2018-11-12 19:57:07,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 19:57:07,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-12 19:57:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:07,090 INFO L225 Difference]: With dead ends: 193 [2018-11-12 19:57:07,091 INFO L226 Difference]: Without dead ends: 191 [2018-11-12 19:57:07,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-12 19:57:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-12 19:57:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2018-11-12 19:57:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-12 19:57:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-11-12 19:57:07,101 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 55 [2018-11-12 19:57:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:07,101 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-11-12 19:57:07,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 19:57:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-11-12 19:57:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-12 19:57:07,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:07,102 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:07,103 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:07,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-12 19:57:07,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:07,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:07,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:07,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:07,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:07,338 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:07,507 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:07,989 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-12 19:57:08,193 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 19:57:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:08,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:08,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:08,382 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-12 19:57:08,382 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [48], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-12 19:57:08,385 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:08,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:08,427 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:09,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:09,719 INFO L272 AbstractInterpreter]: Visited 44 different actions 411 times. Merged at 36 different actions 315 times. Widened at 4 different actions 15 times. Performed 4859 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 50 fixpoints after 11 different actions. Largest state had 50 variables. [2018-11-12 19:57:09,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:09,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:09,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:09,749 INFO L192 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-12 19:57:09,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:09,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:09,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:09,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:10,372 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 18 [2018-11-12 19:57:11,061 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2018-11-12 19:57:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 19:57:11,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2018-11-12 19:57:11,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:11,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 19:57:11,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 19:57:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-12 19:57:11,114 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 9 states. [2018-11-12 19:57:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:11,445 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2018-11-12 19:57:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 19:57:11,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-12 19:57:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:11,447 INFO L225 Difference]: With dead ends: 185 [2018-11-12 19:57:11,447 INFO L226 Difference]: Without dead ends: 183 [2018-11-12 19:57:11,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-12 19:57:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-12 19:57:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-12 19:57:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-12 19:57:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-11-12 19:57:11,456 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-11-12 19:57:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:11,456 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-11-12 19:57:11,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 19:57:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-11-12 19:57:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-12 19:57:11,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:11,457 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:11,457 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:11,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-11-12 19:57:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:11,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:11,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:11,688 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:11,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:11,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:11,766 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-12 19:57:11,766 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [254], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-12 19:57:11,768 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:11,768 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:11,789 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:12,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:12,518 INFO L272 AbstractInterpreter]: Visited 44 different actions 300 times. Merged at 36 different actions 221 times. Widened at 3 different actions 8 times. Performed 3568 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3568 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 36 fixpoints after 9 different actions. Largest state had 50 variables. [2018-11-12 19:57:12,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:12,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:12,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:12,544 INFO L192 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-12 19:57:12,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:12,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:12,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:12,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:13,052 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-12 19:57:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 19:57:13,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:13,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 12 [2018-11-12 19:57:13,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:13,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 19:57:13,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 19:57:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-12 19:57:13,171 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 8 states. [2018-11-12 19:57:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:13,349 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-11-12 19:57:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 19:57:13,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-12 19:57:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:13,350 INFO L225 Difference]: With dead ends: 203 [2018-11-12 19:57:13,351 INFO L226 Difference]: Without dead ends: 200 [2018-11-12 19:57:13,351 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-12 19:57:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-12 19:57:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-12 19:57:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-12 19:57:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-11-12 19:57:13,360 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-11-12 19:57:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:13,360 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-11-12 19:57:13,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 19:57:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-11-12 19:57:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 19:57:13,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:13,361 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:13,362 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:13,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-11-12 19:57:13,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:13,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:13,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-12 19:57:13,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:13,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:13,609 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 80 with the following transitions: [2018-11-12 19:57:13,610 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [329], [332], [335], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-12 19:57:13,611 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:13,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:13,628 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:14,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:14,322 INFO L272 AbstractInterpreter]: Visited 46 different actions 311 times. Merged at 38 different actions 231 times. Widened at 3 different actions 7 times. Performed 3550 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 35 fixpoints after 9 different actions. Largest state had 50 variables. [2018-11-12 19:57:14,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:14,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:14,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:14,349 INFO L192 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-12 19:57:14,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:14,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:14,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-12 19:57:14,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-12 19:57:14,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:14,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2018-11-12 19:57:14,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:14,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 19:57:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 19:57:14,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:57:14,817 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-11-12 19:57:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:15,077 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-11-12 19:57:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 19:57:15,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-12 19:57:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:15,081 INFO L225 Difference]: With dead ends: 224 [2018-11-12 19:57:15,081 INFO L226 Difference]: Without dead ends: 221 [2018-11-12 19:57:15,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-12 19:57:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-12 19:57:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-12 19:57:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-12 19:57:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-11-12 19:57:15,092 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-11-12 19:57:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:15,093 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-11-12 19:57:15,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 19:57:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-11-12 19:57:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-12 19:57:15,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:15,094 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-12 19:57:15,095 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:15,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-11-12 19:57:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:15,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:15,355 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:15,519 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:15,729 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 19:57:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:15,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:15,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:15,904 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-11-12 19:57:15,904 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [380], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-12 19:57:15,906 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:15,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:15,926 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:16,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:16,556 INFO L272 AbstractInterpreter]: Visited 44 different actions 268 times. Merged at 36 different actions 191 times. Widened at 3 different actions 7 times. Performed 3307 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 31 fixpoints after 11 different actions. Largest state had 50 variables. [2018-11-12 19:57:16,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:16,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:16,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:16,562 INFO L192 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-12 19:57:16,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:16,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:16,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:16,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-12 19:57:17,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:17,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 16 [2018-11-12 19:57:17,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:17,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 19:57:17,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 19:57:17,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-12 19:57:17,417 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 10 states. [2018-11-12 19:57:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:17,651 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-11-12 19:57:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 19:57:17,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-11-12 19:57:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:17,654 INFO L225 Difference]: With dead ends: 221 [2018-11-12 19:57:17,654 INFO L226 Difference]: Without dead ends: 219 [2018-11-12 19:57:17,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-12 19:57:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-12 19:57:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-12 19:57:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-12 19:57:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-11-12 19:57:17,664 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-11-12 19:57:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:17,665 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-11-12 19:57:17,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 19:57:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-11-12 19:57:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-12 19:57:17,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:17,666 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-11-12 19:57:17,666 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:17,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-11-12 19:57:17,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:17,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:17,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:17,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-12 19:57:18,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:18,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:18,166 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 94 with the following transitions: [2018-11-12 19:57:18,167 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [440], [443], [446], [452], [467], [482], [497], [500], [503], [508], [520], [523], [524], [525] [2018-11-12 19:57:18,168 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:18,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:18,186 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:18,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:18,707 INFO L272 AbstractInterpreter]: Visited 46 different actions 272 times. Merged at 38 different actions 193 times. Widened at 2 different actions 6 times. Performed 3217 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3217 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 31 fixpoints after 11 different actions. Largest state had 50 variables. [2018-11-12 19:57:18,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:18,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:18,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:18,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:57:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:18,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:18,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:19,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 19:57:19,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:19,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 19 [2018-11-12 19:57:19,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 19:57:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 19:57:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:57:19,831 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-11-12 19:57:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:20,063 INFO L93 Difference]: Finished difference Result 264 states and 367 transitions. [2018-11-12 19:57:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 19:57:20,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-12 19:57:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:20,065 INFO L225 Difference]: With dead ends: 264 [2018-11-12 19:57:20,066 INFO L226 Difference]: Without dead ends: 260 [2018-11-12 19:57:20,066 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-11-12 19:57:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-12 19:57:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 255. [2018-11-12 19:57:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-12 19:57:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2018-11-12 19:57:20,079 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 93 [2018-11-12 19:57:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:20,079 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2018-11-12 19:57:20,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 19:57:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2018-11-12 19:57:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-12 19:57:20,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:20,080 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:20,081 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:20,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1152837687, now seen corresponding path program 1 times [2018-11-12 19:57:20,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:20,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:20,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:20,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:20,744 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-12 19:57:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 20 proven. 134 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 19:57:20,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:20,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:20,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-12 19:57:20,928 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [18], [21], [24], [29], [36], [39], [42], [45], [50], [132], [227], [230], [245], [248], [251], [256], [323], [326], [341], [356], [371], [374], [377], [382], [419], [422], [437], [452], [467], [482], [497], [500], [503], [506], [508], [520], [523], [524], [525] [2018-11-12 19:57:20,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 19:57:20,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 19:57:20,949 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 19:57:21,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 19:57:21,779 INFO L272 AbstractInterpreter]: Visited 44 different actions 427 times. Merged at 36 different actions 333 times. Widened at 4 different actions 13 times. Performed 5270 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5270 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 49 fixpoints after 10 different actions. Largest state had 50 variables. [2018-11-12 19:57:21,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:21,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 19:57:21,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:21,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:57:21,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:21,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 19:57:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:21,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 16 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:22,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:22,872 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-12 19:57:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 34 proven. 88 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-12 19:57:22,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:22,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 8] total 26 [2018-11-12 19:57:22,976 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:22,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 19:57:22,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 19:57:22,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-11-12 19:57:22,977 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand 20 states. [2018-11-12 19:57:23,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:23,700 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2018-11-12 19:57:23,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 19:57:23,703 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-11-12 19:57:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:23,704 INFO L225 Difference]: With dead ends: 270 [2018-11-12 19:57:23,704 INFO L226 Difference]: Without dead ends: 268 [2018-11-12 19:57:23,705 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 19:57:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-12 19:57:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 255. [2018-11-12 19:57:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-12 19:57:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-11-12 19:57:23,717 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 97 [2018-11-12 19:57:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:23,717 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-11-12 19:57:23,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 19:57:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-11-12 19:57:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 19:57:23,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 19:57:23,719 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 19:57:23,719 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 19:57:23,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 19:57:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-11-12 19:57:23,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 19:57:23,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:23,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 19:57:23,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 19:57:23,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 19:57:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 19:57:24,031 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:24,203 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-12 19:57:24,407 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-12 19:57:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 19:57:24,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:24,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 19:57:24,657 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 19:57:24,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 19:57:24,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 19:57:24,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 19:57:24,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 19:57:24,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 19:57:24,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 19:57:24,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 19:57:24,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 19:57:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-12 19:57:25,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 19:57:25,610 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 21 [2018-11-12 19:57:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-12 19:57:26,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 19:57:26,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2018-11-12 19:57:26,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 19:57:26,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 19:57:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 19:57:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-11-12 19:57:26,066 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 18 states. [2018-11-12 19:57:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 19:57:26,954 INFO L93 Difference]: Finished difference Result 269 states and 372 transitions. [2018-11-12 19:57:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 19:57:26,955 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 103 [2018-11-12 19:57:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 19:57:26,956 INFO L225 Difference]: With dead ends: 269 [2018-11-12 19:57:26,956 INFO L226 Difference]: Without dead ends: 0 [2018-11-12 19:57:26,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 19:57:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-12 19:57:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-12 19:57:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-12 19:57:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-12 19:57:26,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-11-12 19:57:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 19:57:26,959 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-12 19:57:26,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 19:57:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-12 19:57:26,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-12 19:57:26,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-12 19:57:26,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-12 19:57:27,093 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 111 [2018-11-12 19:57:28,151 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2018-11-12 19:57:28,260 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2018-11-12 19:57:28,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:57:28,263 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-12 19:57:28,263 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-12 19:57:28,264 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-12 19:57:28,264 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-12 19:57:28,265 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-12 19:57:28,266 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-12 19:57:28,267 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-12 19:57:28,268 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-12 19:57:28,269 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-12 19:57:28,269 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-12 19:57:28,270 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse2 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse3 (<= main_~this_buffer_empty~0 1)) (.cse5 (<= 1 main_~this_buffer_empty~0)) (.cse7 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse4 (<= 0 (+ main_~P8~0 2147483648))) (.cse6 (<= main_~P8~0 2147483647)) (.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse0 .cse1) (and .cse2 (and .cse3 .cse4 (= main_~q~0 4) .cse5 .cse6)) (and .cse2 (and .cse4 (= main_~q~0 3) .cse6 .cse0 .cse1)) (and .cse7 (and (= main_~q~0 1) .cse3 .cse4 .cse5 .cse6)) (and .cse7 (<= 5 main_~q~0) .cse4 .cse6 .cse0 .cse1))) [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-12 19:57:28,271 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-12 19:57:28,272 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-12 19:57:28,273 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-12 19:57:28,274 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-12 19:57:28,274 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-12 19:57:28,274 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-12 19:57:28,274 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-12 19:57:28,274 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-12 19:57:28,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:57:28 BoogieIcfgContainer [2018-11-12 19:57:28,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 19:57:28,301 INFO L168 Benchmark]: Toolchain (without parser) took 42660.33 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 126.4 MB. Max. memory is 7.1 GB. [2018-11-12 19:57:28,302 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 19:57:28,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 545.75 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-12 19:57:28,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.03 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-12 19:57:28,304 INFO L168 Benchmark]: Boogie Preprocessor took 150.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.1 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2018-11-12 19:57:28,304 INFO L168 Benchmark]: RCFGBuilder took 1833.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2018-11-12 19:57:28,305 INFO L168 Benchmark]: TraceAbstraction took 40096.45 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 667.9 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -548.8 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2018-11-12 19:57:28,309 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 545.75 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.03 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 150.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.1 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1833.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40096.45 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 667.9 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -548.8 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2018-11-12 19:57:28,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,320 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,321 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && (((this_buffer_empty <= 1 && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && (((0 <= P8 + 2147483648 && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && (((q == 1 && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-11-12 19:57:28,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-12 19:57:28,323 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 40.0s OverallTime, 23 OverallIterations, 10 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3824 SDtfs, 2391 SDslu, 12973 SDs, 0 SdLazy, 1943 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1868 GetRequests, 1664 SyntacticMatches, 16 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.3s AbstIntTime, 13 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 88 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 38 NumberOfFragments, 206 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3506 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 923 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1913 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2758 ConstructedInterpolants, 297 QuantifiedInterpolants, 2075008 SizeOfPredicates, 73 NumberOfNonLiveVariables, 5546 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 1092/2998 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...