./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f26efe6943beb9bd444f2fe65e72a92241f10e89 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:10:10,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:10:10,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:10:10,855 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:10:10,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:10:10,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:10:10,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:10:10,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:10:10,861 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:10:10,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:10:10,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:10:10,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:10:10,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:10:10,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:10:10,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:10:10,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:10:10,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:10:10,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:10:10,872 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:10:10,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:10:10,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:10:10,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:10:10,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:10:10,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:10:10,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:10:10,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:10:10,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:10:10,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:10:10,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:10:10,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:10:10,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:10:10,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:10:10,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:10:10,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:10:10,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:10:10,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:10:10,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:10:10,910 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:10:10,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:10:10,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:10:10,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:10:10,912 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:10:10,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:10:10,913 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:10:10,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:10:10,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:10:10,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:10:10,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:10:10,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:10:10,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:10:10,914 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:10:10,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:10:10,915 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:10:10,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:10:10,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:10:10,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:10:10,916 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:10:10,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:10:10,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:10:10,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:10:10,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:10:10,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:10:10,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:10:10,919 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:10:10,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:10:10,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f26efe6943beb9bd444f2fe65e72a92241f10e89 [2019-01-12 15:10:10,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:10:10,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:10:10,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:10:10,993 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:10:10,994 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:10:10,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_true-unreach-call.c [2019-01-12 15:10:11,069 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52764deb/81d1395d26914e3c8caafbd9bae4cfdf/FLAGdadd662fa [2019-01-12 15:10:11,499 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:10:11,499 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_10_true-unreach-call.c [2019-01-12 15:10:11,506 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52764deb/81d1395d26914e3c8caafbd9bae4cfdf/FLAGdadd662fa [2019-01-12 15:10:11,882 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52764deb/81d1395d26914e3c8caafbd9bae4cfdf [2019-01-12 15:10:11,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:10:11,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:10:11,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:10:11,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:10:11,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:10:11,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:10:11" (1/1) ... [2019-01-12 15:10:11,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199daf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:11, skipping insertion in model container [2019-01-12 15:10:11,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:10:11" (1/1) ... [2019-01-12 15:10:11,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:10:11,933 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:10:12,174 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:10:12,179 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:10:12,198 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:10:12,216 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:10:12,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12 WrapperNode [2019-01-12 15:10:12,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:10:12,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:10:12,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:10:12,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:10:12,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:10:12,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:10:12,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:10:12,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:10:12,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... [2019-01-12 15:10:12,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:10:12,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:10:12,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:10:12,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:10:12,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:10:12,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:10:12,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:10:12,410 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-01-12 15:10:12,411 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-01-12 15:10:12,411 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-01-12 15:10:12,411 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-01-12 15:10:12,795 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:10:12,796 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:10:12,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:10:12 BoogieIcfgContainer [2019-01-12 15:10:12,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:10:12,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:10:12,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:10:12,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:10:12,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:10:11" (1/3) ... [2019-01-12 15:10:12,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbbc545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:10:12, skipping insertion in model container [2019-01-12 15:10:12,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:10:12" (2/3) ... [2019-01-12 15:10:12,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbbc545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:10:12, skipping insertion in model container [2019-01-12 15:10:12,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:10:12" (3/3) ... [2019-01-12 15:10:12,805 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10_true-unreach-call.c [2019-01-12 15:10:12,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:10:12,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:10:12,833 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:10:12,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:10:12,872 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:10:12,873 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:10:12,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:10:12,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:10:12,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:10:12,873 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:10:12,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:10:12,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:10:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 15:10:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:10:12,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:12,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:12,908 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-01-12 15:10:12,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:12,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:12,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:10:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:10:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:10:13,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:10:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:10:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:10:13,164 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-01-12 15:10:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:13,311 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-01-12 15:10:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:10:13,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:10:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:13,325 INFO L225 Difference]: With dead ends: 38 [2019-01-12 15:10:13,325 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:10:13,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:10:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:10:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:10:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:10:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 15:10:13,378 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-01-12 15:10:13,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:13,378 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 15:10:13,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:10:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 15:10:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 15:10:13,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:13,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:13,381 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-01-12 15:10:13,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:13,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:13,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:13,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:13,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:10:13,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:10:13,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:10:13,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:10:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:10:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:10:13,491 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-01-12 15:10:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:13,791 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-01-12 15:10:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:10:13,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 15:10:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:13,793 INFO L225 Difference]: With dead ends: 32 [2019-01-12 15:10:13,793 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 15:10:13,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:10:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 15:10:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 15:10:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:10:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-12 15:10:13,804 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-01-12 15:10:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:13,805 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-12 15:10:13,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:10:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-01-12 15:10:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 15:10:13,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:13,808 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:13,808 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-01-12 15:10:13,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:13,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:13,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:13,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:10:13,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:13,948 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:14,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:10:14,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:14,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 15:10:14,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:10:14,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:10:14,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:10:14,383 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2019-01-12 15:10:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:15,128 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2019-01-12 15:10:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:10:15,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-12 15:10:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:15,132 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:10:15,132 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 15:10:15,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:10:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 15:10:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-12 15:10:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 15:10:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 15:10:15,156 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2019-01-12 15:10:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:15,157 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 15:10:15,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:10:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 15:10:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:10:15,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:15,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:15,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-01-12 15:10:15,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:15,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:15,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:15,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:15,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:10:15,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:15,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:15,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:15,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 15:10:15,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:15,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:10:15,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:10:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:10:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:10:15,473 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2019-01-12 15:10:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:15,716 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-01-12 15:10:15,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:10:15,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 15:10:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:15,719 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:10:15,719 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:10:15,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:10:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:10:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-12 15:10:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 15:10:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-01-12 15:10:15,732 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2019-01-12 15:10:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:15,732 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-12 15:10:15,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:10:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-01-12 15:10:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 15:10:15,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:15,735 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:10:15,736 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-01-12 15:10:15,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:15,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:15,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:15,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:10:15,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:15,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:15,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:10:16,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:16,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-01-12 15:10:16,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:10:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:10:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:10:16,083 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2019-01-12 15:10:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:16,438 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 15:10:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:10:16,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-12 15:10:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:16,443 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:10:16,444 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:10:16,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:10:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:10:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:10:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:10:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-01-12 15:10:16,454 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2019-01-12 15:10:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:16,455 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-12 15:10:16,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:10:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-01-12 15:10:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 15:10:16,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:16,457 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 15:10:16,457 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-01-12 15:10:16,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:16,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:16,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:16,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:16,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:10:16,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:16,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:16,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:16,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:10:16,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:16,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2019-01-12 15:10:16,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:10:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:10:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:10:16,674 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2019-01-12 15:10:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:16,953 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2019-01-12 15:10:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:10:16,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-12 15:10:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:16,957 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:10:16,957 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:10:16,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:10:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:10:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2019-01-12 15:10:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-12 15:10:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2019-01-12 15:10:16,970 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2019-01-12 15:10:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:16,971 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2019-01-12 15:10:16,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:10:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2019-01-12 15:10:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 15:10:16,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:16,974 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:16,974 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-01-12 15:10:16,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:16,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 15:10:17,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:17,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:17,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:17,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 15:10:17,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:17,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-01-12 15:10:17,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:10:17,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:10:17,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:10:17,331 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 10 states. [2019-01-12 15:10:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:17,738 INFO L93 Difference]: Finished difference Result 67 states and 114 transitions. [2019-01-12 15:10:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:10:17,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-01-12 15:10:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:17,741 INFO L225 Difference]: With dead ends: 67 [2019-01-12 15:10:17,742 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 15:10:17,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:10:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 15:10:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2019-01-12 15:10:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 15:10:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2019-01-12 15:10:17,757 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 50 [2019-01-12 15:10:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:17,759 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2019-01-12 15:10:17,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:10:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2019-01-12 15:10:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-12 15:10:17,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:17,763 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:17,763 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1353550601, now seen corresponding path program 2 times [2019-01-12 15:10:17,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:17,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:17,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 15:10:17,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:17,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:10:18,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:10:18,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:18,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 15:10:18,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:18,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-01-12 15:10:18,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:10:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:10:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:10:18,215 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 16 states. [2019-01-12 15:10:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:19,143 INFO L93 Difference]: Finished difference Result 142 states and 295 transitions. [2019-01-12 15:10:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:10:19,144 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2019-01-12 15:10:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:19,149 INFO L225 Difference]: With dead ends: 142 [2019-01-12 15:10:19,149 INFO L226 Difference]: Without dead ends: 99 [2019-01-12 15:10:19,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2019-01-12 15:10:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-12 15:10:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2019-01-12 15:10:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 15:10:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 153 transitions. [2019-01-12 15:10:19,176 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 153 transitions. Word has length 76 [2019-01-12 15:10:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:19,177 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 153 transitions. [2019-01-12 15:10:19,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:10:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 153 transitions. [2019-01-12 15:10:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-12 15:10:19,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:19,187 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:19,187 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2005756209, now seen corresponding path program 1 times [2019-01-12 15:10:19,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:19,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:19,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 77 proven. 154 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-01-12 15:10:19,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:19,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:19,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:19,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 40 proven. 230 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-01-12 15:10:20,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:20,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2019-01-12 15:10:20,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:10:20,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:10:20,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:10:20,132 INFO L87 Difference]: Start difference. First operand 83 states and 153 transitions. Second operand 18 states. [2019-01-12 15:10:21,264 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 15:10:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:22,075 INFO L93 Difference]: Finished difference Result 228 states and 516 transitions. [2019-01-12 15:10:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 15:10:22,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 158 [2019-01-12 15:10:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:22,081 INFO L225 Difference]: With dead ends: 228 [2019-01-12 15:10:22,081 INFO L226 Difference]: Without dead ends: 125 [2019-01-12 15:10:22,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 15:10:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-12 15:10:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2019-01-12 15:10:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 15:10:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 180 transitions. [2019-01-12 15:10:22,110 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 180 transitions. Word has length 158 [2019-01-12 15:10:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:22,111 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 180 transitions. [2019-01-12 15:10:22,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:10:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 180 transitions. [2019-01-12 15:10:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-01-12 15:10:22,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:22,119 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 16, 16, 16, 14, 12, 12, 12, 12, 12, 12, 12, 11, 8, 8, 8, 8, 8, 8, 8, 6, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:22,120 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -534623995, now seen corresponding path program 1 times [2019-01-12 15:10:22,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:22,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:22,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:22,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:22,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 142 proven. 366 refuted. 0 times theorem prover too weak. 1759 trivial. 0 not checked. [2019-01-12 15:10:22,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:22,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:22,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:22,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 96 proven. 556 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2019-01-12 15:10:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:23,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2019-01-12 15:10:23,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:10:23,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:10:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:10:23,019 INFO L87 Difference]: Start difference. First operand 114 states and 180 transitions. Second operand 18 states. [2019-01-12 15:10:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:24,383 INFO L93 Difference]: Finished difference Result 286 states and 583 transitions. [2019-01-12 15:10:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 15:10:24,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 279 [2019-01-12 15:10:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:24,389 INFO L225 Difference]: With dead ends: 286 [2019-01-12 15:10:24,389 INFO L226 Difference]: Without dead ends: 175 [2019-01-12 15:10:24,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1171, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:10:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-12 15:10:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2019-01-12 15:10:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 15:10:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 248 transitions. [2019-01-12 15:10:24,421 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 248 transitions. Word has length 279 [2019-01-12 15:10:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:24,421 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 248 transitions. [2019-01-12 15:10:24,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:10:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 248 transitions. [2019-01-12 15:10:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-01-12 15:10:24,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:24,445 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 47, 46, 46, 42, 30, 30, 30, 30, 30, 30, 30, 24, 23, 23, 23, 23, 23, 23, 23, 14, 12, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:24,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1648219225, now seen corresponding path program 2 times [2019-01-12 15:10:24,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:24,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:24,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:24,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:24,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16154 backedges. 403 proven. 1071 refuted. 0 times theorem prover too weak. 14680 trivial. 0 not checked. [2019-01-12 15:10:25,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:25,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:10:25,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:10:25,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:25,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16154 backedges. 244 proven. 1947 refuted. 0 times theorem prover too weak. 13963 trivial. 0 not checked. [2019-01-12 15:10:25,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:25,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-01-12 15:10:25,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:10:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:10:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:10:25,873 INFO L87 Difference]: Start difference. First operand 150 states and 248 transitions. Second operand 21 states. [2019-01-12 15:10:27,293 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 15:10:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:28,139 INFO L93 Difference]: Finished difference Result 320 states and 654 transitions. [2019-01-12 15:10:28,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 15:10:28,141 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 734 [2019-01-12 15:10:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:28,147 INFO L225 Difference]: With dead ends: 320 [2019-01-12 15:10:28,147 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 15:10:28,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=350, Invalid=1812, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 15:10:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 15:10:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2019-01-12 15:10:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-12 15:10:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 268 transitions. [2019-01-12 15:10:28,178 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 268 transitions. Word has length 734 [2019-01-12 15:10:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:28,179 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 268 transitions. [2019-01-12 15:10:28,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:10:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 268 transitions. [2019-01-12 15:10:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2019-01-12 15:10:28,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:28,196 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 74, 74, 61, 58, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 20, 16, 16, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:28,196 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:28,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:28,197 INFO L82 PathProgramCache]: Analyzing trace with hash -2049735541, now seen corresponding path program 3 times [2019-01-12 15:10:28,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:28,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:28,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:28,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:29,038 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 15:10:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 31467 backedges. 486 proven. 2685 refuted. 0 times theorem prover too weak. 28296 trivial. 0 not checked. [2019-01-12 15:10:29,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:29,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:10:29,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 15:10:29,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:29,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 31467 backedges. 2573 proven. 33 refuted. 0 times theorem prover too weak. 28861 trivial. 0 not checked. [2019-01-12 15:10:30,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:30,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 20 [2019-01-12 15:10:30,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:10:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:10:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:10:30,393 INFO L87 Difference]: Start difference. First operand 153 states and 268 transitions. Second operand 20 states. [2019-01-12 15:10:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:31,589 INFO L93 Difference]: Finished difference Result 345 states and 713 transitions. [2019-01-12 15:10:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:10:31,591 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1028 [2019-01-12 15:10:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:31,596 INFO L225 Difference]: With dead ends: 345 [2019-01-12 15:10:31,597 INFO L226 Difference]: Without dead ends: 200 [2019-01-12 15:10:31,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1024 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:10:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-12 15:10:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2019-01-12 15:10:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 15:10:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 314 transitions. [2019-01-12 15:10:31,630 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 314 transitions. Word has length 1028 [2019-01-12 15:10:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:31,631 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 314 transitions. [2019-01-12 15:10:31,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:10:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 314 transitions. [2019-01-12 15:10:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1087 [2019-01-12 15:10:31,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:31,650 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 73, 73, 66, 63, 43, 43, 43, 43, 43, 43, 43, 36, 36, 36, 36, 36, 36, 36, 30, 20, 20, 10, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:31,650 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:31,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:31,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1734949859, now seen corresponding path program 4 times [2019-01-12 15:10:31,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:31,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:31,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 35362 backedges. 476 proven. 2891 refuted. 0 times theorem prover too weak. 31995 trivial. 0 not checked. [2019-01-12 15:10:33,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:33,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:10:33,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:10:33,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:33,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 35362 backedges. 455 proven. 3291 refuted. 0 times theorem prover too weak. 31616 trivial. 0 not checked. [2019-01-12 15:10:35,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:35,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2019-01-12 15:10:35,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:10:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:10:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:10:35,730 INFO L87 Difference]: Start difference. First operand 194 states and 314 transitions. Second operand 15 states. [2019-01-12 15:10:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:36,299 INFO L93 Difference]: Finished difference Result 211 states and 352 transitions. [2019-01-12 15:10:36,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:10:36,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1086 [2019-01-12 15:10:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:36,308 INFO L225 Difference]: With dead ends: 211 [2019-01-12 15:10:36,308 INFO L226 Difference]: Without dead ends: 207 [2019-01-12 15:10:36,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1091 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:10:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-12 15:10:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2019-01-12 15:10:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-12 15:10:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 342 transitions. [2019-01-12 15:10:36,333 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 342 transitions. Word has length 1086 [2019-01-12 15:10:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:36,336 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 342 transitions. [2019-01-12 15:10:36,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:10:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 342 transitions. [2019-01-12 15:10:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2019-01-12 15:10:36,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:36,352 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 74, 74, 72, 60, 46, 46, 46, 46, 46, 46, 46, 37, 37, 37, 37, 37, 37, 37, 35, 21, 14, 14, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:36,352 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 894744010, now seen corresponding path program 5 times [2019-01-12 15:10:36,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:36,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:36,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 39046 backedges. 802 proven. 2264 refuted. 0 times theorem prover too weak. 35980 trivial. 0 not checked. [2019-01-12 15:10:38,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:38,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:38,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:10:38,236 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-12 15:10:38,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:38,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 39046 backedges. 8024 proven. 18 refuted. 0 times theorem prover too weak. 31004 trivial. 0 not checked. [2019-01-12 15:10:39,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:39,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2019-01-12 15:10:39,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:10:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:10:39,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:10:39,056 INFO L87 Difference]: Start difference. First operand 204 states and 342 transitions. Second operand 13 states. [2019-01-12 15:10:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:39,341 INFO L93 Difference]: Finished difference Result 397 states and 735 transitions. [2019-01-12 15:10:39,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:10:39,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1137 [2019-01-12 15:10:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:39,347 INFO L225 Difference]: With dead ends: 397 [2019-01-12 15:10:39,348 INFO L226 Difference]: Without dead ends: 195 [2019-01-12 15:10:39,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1155 GetRequests, 1135 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:10:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-12 15:10:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-01-12 15:10:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-12 15:10:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 316 transitions. [2019-01-12 15:10:39,371 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 316 transitions. Word has length 1137 [2019-01-12 15:10:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:39,372 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 316 transitions. [2019-01-12 15:10:39,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:10:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 316 transitions. [2019-01-12 15:10:39,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2019-01-12 15:10:39,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:39,384 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 66, 66, 57, 54, 35, 35, 35, 35, 35, 35, 35, 33, 33, 33, 33, 33, 33, 33, 24, 19, 14, 12, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:39,385 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1950779302, now seen corresponding path program 6 times [2019-01-12 15:10:39,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:39,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:39,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:39,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 26039 backedges. 2085 proven. 1257 refuted. 0 times theorem prover too weak. 22697 trivial. 0 not checked. [2019-01-12 15:10:40,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:40,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:40,155 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:10:40,387 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:10:40,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:40,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26039 backedges. 2457 proven. 96 refuted. 0 times theorem prover too weak. 23486 trivial. 0 not checked. [2019-01-12 15:10:40,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:40,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2019-01-12 15:10:40,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:10:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:10:40,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:10:40,975 INFO L87 Difference]: Start difference. First operand 192 states and 316 transitions. Second operand 25 states. [2019-01-12 15:10:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:44,881 INFO L93 Difference]: Finished difference Result 481 states and 946 transitions. [2019-01-12 15:10:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 15:10:44,883 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 936 [2019-01-12 15:10:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:44,892 INFO L225 Difference]: With dead ends: 481 [2019-01-12 15:10:44,892 INFO L226 Difference]: Without dead ends: 286 [2019-01-12 15:10:44,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 935 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=2196, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 15:10:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-12 15:10:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2019-01-12 15:10:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-12 15:10:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 418 transitions. [2019-01-12 15:10:44,934 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 418 transitions. Word has length 936 [2019-01-12 15:10:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:44,939 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 418 transitions. [2019-01-12 15:10:44,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:10:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 418 transitions. [2019-01-12 15:10:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2019-01-12 15:10:44,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:44,960 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 72, 72, 66, 61, 42, 42, 42, 42, 42, 42, 42, 36, 36, 36, 36, 36, 36, 36, 30, 19, 19, 11, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:44,960 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:44,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -624699156, now seen corresponding path program 7 times [2019-01-12 15:10:44,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:44,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:44,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 34443 backedges. 2261 proven. 654 refuted. 0 times theorem prover too weak. 31528 trivial. 0 not checked. [2019-01-12 15:10:47,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:47,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-01-12 15:10:47,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:47,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34443 backedges. 867 proven. 2998 refuted. 0 times theorem prover too weak. 30578 trivial. 0 not checked. [2019-01-12 15:10:49,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:49,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-01-12 15:10:49,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:10:49,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:10:49,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:10:49,716 INFO L87 Difference]: Start difference. First operand 254 states and 418 transitions. Second operand 25 states. [2019-01-12 15:10:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:52,327 INFO L93 Difference]: Finished difference Result 664 states and 1461 transitions. [2019-01-12 15:10:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 15:10:52,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1072 [2019-01-12 15:10:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:52,336 INFO L225 Difference]: With dead ends: 664 [2019-01-12 15:10:52,336 INFO L226 Difference]: Without dead ends: 332 [2019-01-12 15:10:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1065 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=484, Invalid=3422, Unknown=0, NotChecked=0, Total=3906 [2019-01-12 15:10:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-01-12 15:10:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 280. [2019-01-12 15:10:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-12 15:10:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 421 transitions. [2019-01-12 15:10:52,382 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 421 transitions. Word has length 1072 [2019-01-12 15:10:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:52,382 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 421 transitions. [2019-01-12 15:10:52,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:10:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 421 transitions. [2019-01-12 15:10:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1307 [2019-01-12 15:10:52,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:52,414 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 92, 92, 81, 76, 49, 49, 49, 49, 49, 49, 49, 46, 46, 46, 46, 46, 46, 46, 32, 30, 23, 11, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:52,417 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1075675433, now seen corresponding path program 8 times [2019-01-12 15:10:52,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:52,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:52,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:10:52,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 51082 backedges. 950 proven. 2820 refuted. 0 times theorem prover too weak. 47312 trivial. 0 not checked. [2019-01-12 15:10:53,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:53,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:10:53,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:10:54,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:10:54,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:54,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:10:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 51082 backedges. 888 proven. 3362 refuted. 0 times theorem prover too weak. 46832 trivial. 0 not checked. [2019-01-12 15:10:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:10:55,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2019-01-12 15:10:55,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:10:55,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:10:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:10:55,717 INFO L87 Difference]: Start difference. First operand 280 states and 421 transitions. Second operand 22 states. [2019-01-12 15:10:56,689 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 15:10:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:10:57,554 INFO L93 Difference]: Finished difference Result 557 states and 917 transitions. [2019-01-12 15:10:57,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:10:57,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1306 [2019-01-12 15:10:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:10:57,559 INFO L225 Difference]: With dead ends: 557 [2019-01-12 15:10:57,559 INFO L226 Difference]: Without dead ends: 271 [2019-01-12 15:10:57,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1332 GetRequests, 1297 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:10:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-01-12 15:10:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 258. [2019-01-12 15:10:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-12 15:10:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2019-01-12 15:10:57,587 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 1306 [2019-01-12 15:10:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:10:57,589 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2019-01-12 15:10:57,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:10:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2019-01-12 15:10:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2019-01-12 15:10:57,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:10:57,627 INFO L402 BasicCegarLoop]: trace histogram [130, 130, 125, 125, 106, 101, 65, 65, 65, 65, 65, 65, 65, 62, 62, 62, 62, 62, 62, 62, 44, 36, 24, 24, 1, 1, 1, 1, 1, 1] [2019-01-12 15:10:57,627 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:10:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:10:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1380605337, now seen corresponding path program 9 times [2019-01-12 15:10:57,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:10:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:10:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:57,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:10:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:10:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:10:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 91039 backedges. 2900 proven. 4280 refuted. 0 times theorem prover too weak. 83859 trivial. 0 not checked. [2019-01-12 15:10:59,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:10:59,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:10:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:10:59,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-12 15:10:59,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:10:59,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 91039 backedges. 5806 proven. 86 refuted. 0 times theorem prover too weak. 85147 trivial. 0 not checked. [2019-01-12 15:11:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:01,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2019-01-12 15:11:01,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:11:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:11:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:11:01,886 INFO L87 Difference]: Start difference. First operand 258 states and 364 transitions. Second operand 20 states. [2019-01-12 15:11:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:03,269 INFO L93 Difference]: Finished difference Result 531 states and 790 transitions. [2019-01-12 15:11:03,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 15:11:03,270 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1740 [2019-01-12 15:11:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:03,276 INFO L225 Difference]: With dead ends: 531 [2019-01-12 15:11:03,276 INFO L226 Difference]: Without dead ends: 299 [2019-01-12 15:11:03,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1775 GetRequests, 1740 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 15:11:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-12 15:11:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 259. [2019-01-12 15:11:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-12 15:11:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 362 transitions. [2019-01-12 15:11:03,306 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 362 transitions. Word has length 1740 [2019-01-12 15:11:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:03,309 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 362 transitions. [2019-01-12 15:11:03,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:11:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 362 transitions. [2019-01-12 15:11:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2019-01-12 15:11:03,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:03,322 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 68, 68, 56, 56, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 22, 21, 15, 12, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:03,322 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2095714010, now seen corresponding path program 10 times [2019-01-12 15:11:03,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:03,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:03,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:03,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26756 backedges. 715 proven. 3076 refuted. 0 times theorem prover too weak. 22965 trivial. 0 not checked. [2019-01-12 15:11:04,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:04,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:04,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:11:04,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:11:04,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:04,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 26756 backedges. 685 proven. 2218 refuted. 0 times theorem prover too weak. 23853 trivial. 0 not checked. [2019-01-12 15:11:06,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:06,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 25 [2019-01-12 15:11:06,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:11:06,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:11:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:11:06,220 INFO L87 Difference]: Start difference. First operand 259 states and 362 transitions. Second operand 25 states. [2019-01-12 15:11:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:08,230 INFO L93 Difference]: Finished difference Result 627 states and 960 transitions. [2019-01-12 15:11:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 15:11:08,232 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 949 [2019-01-12 15:11:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:08,236 INFO L225 Difference]: With dead ends: 627 [2019-01-12 15:11:08,237 INFO L226 Difference]: Without dead ends: 383 [2019-01-12 15:11:08,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1007 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=541, Invalid=3365, Unknown=0, NotChecked=0, Total=3906 [2019-01-12 15:11:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-12 15:11:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 326. [2019-01-12 15:11:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-12 15:11:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 494 transitions. [2019-01-12 15:11:08,274 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 494 transitions. Word has length 949 [2019-01-12 15:11:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:08,276 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 494 transitions. [2019-01-12 15:11:08,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:11:08,276 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 494 transitions. [2019-01-12 15:11:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-01-12 15:11:08,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:08,294 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:08,294 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:08,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1008927292, now seen corresponding path program 11 times [2019-01-12 15:11:08,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:08,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:08,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:08,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 0 proven. 14453 refuted. 0 times theorem prover too weak. 29132 trivial. 0 not checked. [2019-01-12 15:11:13,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:13,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:13,429 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:11:14,055 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 77 check-sat command(s) [2019-01-12 15:11:14,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:14,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 0 proven. 14453 refuted. 0 times theorem prover too weak. 29132 trivial. 0 not checked. [2019-01-12 15:11:18,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:18,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 68 [2019-01-12 15:11:18,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-12 15:11:18,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-12 15:11:18,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=4391, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 15:11:18,789 INFO L87 Difference]: Start difference. First operand 326 states and 494 transitions. Second operand 68 states. [2019-01-12 15:11:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:21,005 INFO L93 Difference]: Finished difference Result 360 states and 559 transitions. [2019-01-12 15:11:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 15:11:21,006 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1208 [2019-01-12 15:11:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:21,013 INFO L225 Difference]: With dead ends: 360 [2019-01-12 15:11:21,013 INFO L226 Difference]: Without dead ends: 353 [2019-01-12 15:11:21,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1564 GetRequests, 1408 SyntacticMatches, 90 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=165, Invalid=4391, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 15:11:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-12 15:11:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2019-01-12 15:11:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-01-12 15:11:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 548 transitions. [2019-01-12 15:11:21,055 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 548 transitions. Word has length 1208 [2019-01-12 15:11:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:21,056 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 548 transitions. [2019-01-12 15:11:21,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-12 15:11:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 548 transitions. [2019-01-12 15:11:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1236 [2019-01-12 15:11:21,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:21,078 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 89, 89, 73, 73, 46, 46, 46, 46, 46, 46, 46, 44, 44, 44, 44, 44, 44, 44, 29, 27, 19, 16, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:21,078 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1225657353, now seen corresponding path program 12 times [2019-01-12 15:11:21,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:21,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:21,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:21,958 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 15:11:22,322 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2019-01-12 15:11:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 45588 backedges. 3433 proven. 1223 refuted. 0 times theorem prover too weak. 40932 trivial. 0 not checked. [2019-01-12 15:11:22,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:22,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:22,963 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:11:23,169 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-01-12 15:11:23,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:23,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 45588 backedges. 3780 proven. 146 refuted. 0 times theorem prover too weak. 41662 trivial. 0 not checked. [2019-01-12 15:11:24,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:24,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 21 [2019-01-12 15:11:24,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:11:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:11:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:11:24,081 INFO L87 Difference]: Start difference. First operand 349 states and 548 transitions. Second operand 21 states. [2019-01-12 15:11:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:25,076 INFO L93 Difference]: Finished difference Result 642 states and 983 transitions. [2019-01-12 15:11:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 15:11:25,078 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1235 [2019-01-12 15:11:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:25,085 INFO L225 Difference]: With dead ends: 642 [2019-01-12 15:11:25,085 INFO L226 Difference]: Without dead ends: 326 [2019-01-12 15:11:25,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1274 GetRequests, 1236 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:11:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-01-12 15:11:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 312. [2019-01-12 15:11:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 15:11:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 438 transitions. [2019-01-12 15:11:25,119 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 438 transitions. Word has length 1235 [2019-01-12 15:11:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:25,120 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 438 transitions. [2019-01-12 15:11:25,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:11:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 438 transitions. [2019-01-12 15:11:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2019-01-12 15:11:25,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:25,133 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 57, 57, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 22, 22, 14, 13, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:25,135 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:25,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2002306679, now seen corresponding path program 13 times [2019-01-12 15:11:25,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:25,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 27552 backedges. 972 proven. 3383 refuted. 0 times theorem prover too weak. 23197 trivial. 0 not checked. [2019-01-12 15:11:26,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:26,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:26,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27552 backedges. 970 proven. 1981 refuted. 0 times theorem prover too weak. 24601 trivial. 0 not checked. [2019-01-12 15:11:27,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:27,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 26 [2019-01-12 15:11:27,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 15:11:27,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 15:11:27,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:11:27,081 INFO L87 Difference]: Start difference. First operand 312 states and 438 transitions. Second operand 26 states. [2019-01-12 15:11:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:28,963 INFO L93 Difference]: Finished difference Result 686 states and 991 transitions. [2019-01-12 15:11:28,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-12 15:11:28,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 963 [2019-01-12 15:11:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:28,972 INFO L225 Difference]: With dead ends: 686 [2019-01-12 15:11:28,972 INFO L226 Difference]: Without dead ends: 400 [2019-01-12 15:11:28,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=604, Invalid=3952, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 15:11:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-01-12 15:11:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 333. [2019-01-12 15:11:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-12 15:11:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2019-01-12 15:11:29,011 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 963 [2019-01-12 15:11:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:29,012 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2019-01-12 15:11:29,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 15:11:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2019-01-12 15:11:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2019-01-12 15:11:29,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:29,038 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 97, 97, 81, 80, 51, 51, 51, 51, 51, 51, 51, 48, 48, 48, 48, 48, 48, 48, 33, 29, 21, 17, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:29,038 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1922672999, now seen corresponding path program 14 times [2019-01-12 15:11:29,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:29,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:29,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:29,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:30,046 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 15:11:30,401 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2019-01-12 15:11:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 55240 backedges. 2981 proven. 1448 refuted. 0 times theorem prover too weak. 50811 trivial. 0 not checked. [2019-01-12 15:11:31,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:31,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:31,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:31,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:31,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:31,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 55240 backedges. 2983 proven. 1443 refuted. 0 times theorem prover too weak. 50814 trivial. 0 not checked. [2019-01-12 15:11:32,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:32,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-01-12 15:11:32,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:11:32,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:11:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:11:32,569 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand 17 states. [2019-01-12 15:11:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:32,838 INFO L93 Difference]: Finished difference Result 343 states and 476 transitions. [2019-01-12 15:11:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:11:32,840 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1358 [2019-01-12 15:11:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:32,845 INFO L225 Difference]: With dead ends: 343 [2019-01-12 15:11:32,845 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 15:11:32,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1385 GetRequests, 1362 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:11:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 15:11:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-01-12 15:11:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 15:11:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 419 transitions. [2019-01-12 15:11:32,880 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 419 transitions. Word has length 1358 [2019-01-12 15:11:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:32,881 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 419 transitions. [2019-01-12 15:11:32,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:11:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 419 transitions. [2019-01-12 15:11:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2019-01-12 15:11:32,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:32,902 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 92, 92, 76, 75, 47, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 46, 46, 29, 29, 20, 16, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:32,904 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1901256809, now seen corresponding path program 15 times [2019-01-12 15:11:32,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:32,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:32,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:32,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 48693 backedges. 1166 proven. 5008 refuted. 0 times theorem prover too weak. 42519 trivial. 0 not checked. [2019-01-12 15:11:35,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:35,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:11:35,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-12 15:11:35,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:35,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 48693 backedges. 3597 proven. 249 refuted. 0 times theorem prover too weak. 44847 trivial. 0 not checked. [2019-01-12 15:11:37,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:37,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 25 [2019-01-12 15:11:37,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 15:11:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 15:11:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-01-12 15:11:37,207 INFO L87 Difference]: Start difference. First operand 312 states and 419 transitions. Second operand 25 states. [2019-01-12 15:11:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:39,123 INFO L93 Difference]: Finished difference Result 657 states and 892 transitions. [2019-01-12 15:11:39,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-12 15:11:39,125 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1276 [2019-01-12 15:11:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:39,129 INFO L225 Difference]: With dead ends: 657 [2019-01-12 15:11:39,129 INFO L226 Difference]: Without dead ends: 378 [2019-01-12 15:11:39,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1334 GetRequests, 1277 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=477, Invalid=2945, Unknown=0, NotChecked=0, Total=3422 [2019-01-12 15:11:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-12 15:11:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 331. [2019-01-12 15:11:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-12 15:11:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 435 transitions. [2019-01-12 15:11:39,166 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 435 transitions. Word has length 1276 [2019-01-12 15:11:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:39,166 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 435 transitions. [2019-01-12 15:11:39,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 15:11:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 435 transitions. [2019-01-12 15:11:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1604 [2019-01-12 15:11:39,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:39,193 INFO L402 BasicCegarLoop]: trace histogram [118, 118, 117, 117, 96, 94, 59, 59, 59, 59, 59, 59, 59, 58, 58, 58, 58, 58, 58, 58, 38, 35, 23, 22, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:39,194 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:39,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1094542854, now seen corresponding path program 16 times [2019-01-12 15:11:39,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:39,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:39,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 77143 backedges. 1578 proven. 4319 refuted. 0 times theorem prover too weak. 71246 trivial. 0 not checked. [2019-01-12 15:11:40,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:40,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:41,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:11:41,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:11:41,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:41,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 77143 backedges. 1582 proven. 4311 refuted. 0 times theorem prover too weak. 71250 trivial. 0 not checked. [2019-01-12 15:11:43,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:43,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-01-12 15:11:43,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:11:43,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:11:43,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:11:43,315 INFO L87 Difference]: Start difference. First operand 331 states and 435 transitions. Second operand 18 states. [2019-01-12 15:11:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:43,659 INFO L93 Difference]: Finished difference Result 348 states and 462 transitions. [2019-01-12 15:11:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:11:43,661 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1603 [2019-01-12 15:11:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:43,667 INFO L225 Difference]: With dead ends: 348 [2019-01-12 15:11:43,668 INFO L226 Difference]: Without dead ends: 331 [2019-01-12 15:11:43,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1633 GetRequests, 1608 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:11:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-01-12 15:11:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2019-01-12 15:11:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:11:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 408 transitions. [2019-01-12 15:11:43,708 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 408 transitions. Word has length 1603 [2019-01-12 15:11:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:43,709 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 408 transitions. [2019-01-12 15:11:43,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:11:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 408 transitions. [2019-01-12 15:11:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2019-01-12 15:11:43,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:43,739 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 95, 95, 78, 78, 49, 49, 49, 49, 49, 49, 49, 47, 47, 47, 47, 47, 47, 47, 31, 29, 20, 17, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:43,740 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:43,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1565693279, now seen corresponding path program 17 times [2019-01-12 15:11:43,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:43,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:43,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:43,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 51906 backedges. 1773 proven. 3515 refuted. 0 times theorem prover too weak. 46618 trivial. 0 not checked. [2019-01-12 15:11:45,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:45,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:11:45,544 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-01-12 15:11:45,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:45,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 51906 backedges. 25980 proven. 397 refuted. 0 times theorem prover too weak. 25529 trivial. 0 not checked. [2019-01-12 15:11:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:46,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 21 [2019-01-12 15:11:46,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:11:46,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:11:46,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:11:46,361 INFO L87 Difference]: Start difference. First operand 315 states and 408 transitions. Second operand 21 states. [2019-01-12 15:11:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:47,288 INFO L93 Difference]: Finished difference Result 616 states and 793 transitions. [2019-01-12 15:11:47,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 15:11:47,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1317 [2019-01-12 15:11:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:47,293 INFO L225 Difference]: With dead ends: 616 [2019-01-12 15:11:47,293 INFO L226 Difference]: Without dead ends: 330 [2019-01-12 15:11:47,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1360 GetRequests, 1317 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=312, Invalid=1580, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:11:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-12 15:11:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 288. [2019-01-12 15:11:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-12 15:11:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 363 transitions. [2019-01-12 15:11:47,324 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 363 transitions. Word has length 1317 [2019-01-12 15:11:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:47,325 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 363 transitions. [2019-01-12 15:11:47,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:11:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 363 transitions. [2019-01-12 15:11:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2019-01-12 15:11:47,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:47,341 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 69, 69, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 27, 26, 17, 16, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:47,341 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1289476296, now seen corresponding path program 18 times [2019-01-12 15:11:47,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:47,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40648 backedges. 3763 proven. 1515 refuted. 0 times theorem prover too weak. 35370 trivial. 0 not checked. [2019-01-12 15:11:48,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:48,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:11:49,146 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2019-01-12 15:11:49,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:49,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 40648 backedges. 1521 proven. 2098 refuted. 0 times theorem prover too weak. 37029 trivial. 0 not checked. [2019-01-12 15:11:50,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:50,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2019-01-12 15:11:50,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 15:11:50,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 15:11:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:11:50,005 INFO L87 Difference]: Start difference. First operand 288 states and 363 transitions. Second operand 28 states. [2019-01-12 15:11:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:51,641 INFO L93 Difference]: Finished difference Result 544 states and 689 transitions. [2019-01-12 15:11:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 15:11:51,643 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1167 [2019-01-12 15:11:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:51,647 INFO L225 Difference]: With dead ends: 544 [2019-01-12 15:11:51,647 INFO L226 Difference]: Without dead ends: 295 [2019-01-12 15:11:51,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=608, Invalid=3814, Unknown=0, NotChecked=0, Total=4422 [2019-01-12 15:11:51,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-12 15:11:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-01-12 15:11:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-12 15:11:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 275 transitions. [2019-01-12 15:11:51,681 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 275 transitions. Word has length 1167 [2019-01-12 15:11:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:51,684 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 275 transitions. [2019-01-12 15:11:51,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 15:11:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 275 transitions. [2019-01-12 15:11:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2019-01-12 15:11:51,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:51,713 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 20, 19, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:51,713 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1871912262, now seen corresponding path program 19 times [2019-01-12 15:11:51,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:51,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2149 proven. 6053 refuted. 0 times theorem prover too weak. 49244 trivial. 0 not checked. [2019-01-12 15:11:53,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:53,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:11:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:53,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2107 proven. 2950 refuted. 0 times theorem prover too weak. 52389 trivial. 0 not checked. [2019-01-12 15:11:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 28 [2019-01-12 15:11:54,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 15:11:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 15:11:54,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:11:54,281 INFO L87 Difference]: Start difference. First operand 237 states and 275 transitions. Second operand 28 states. [2019-01-12 15:11:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:55,482 INFO L93 Difference]: Finished difference Result 395 states and 466 transitions. [2019-01-12 15:11:55,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-12 15:11:55,483 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1385 [2019-01-12 15:11:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:55,485 INFO L225 Difference]: With dead ends: 395 [2019-01-12 15:11:55,485 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:11:55,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1448 GetRequests, 1390 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=451, Invalid=2971, Unknown=0, NotChecked=0, Total=3422 [2019-01-12 15:11:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:11:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:11:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:11:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:11:55,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1385 [2019-01-12 15:11:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:55,489 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:11:55,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 15:11:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:11:55,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:11:55,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:11:55,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:55,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:55,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:56,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:57,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:58,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:11:59,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:12:00,728 WARN L181 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 8 [2019-01-12 15:12:01,166 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 1 [2019-01-12 15:12:01,870 WARN L181 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 1 [2019-01-12 15:12:03,760 WARN L181 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 290 DAG size of output: 59 [2019-01-12 15:12:04,600 WARN L181 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 9 [2019-01-12 15:12:06,416 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 301 DAG size of output: 49 [2019-01-12 15:12:06,420 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:12:06,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:12:06,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:12:06,421 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-01-12 15:12:06,424 INFO L444 ceAbstractionStarter]: At program point L41(lines 35 42) the Hoare annotation is: (<= 10 ULTIMATE.start_main_~x~0) [2019-01-12 15:12:06,425 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 15:12:06,425 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-01-12 15:12:06,425 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10)) [2019-01-12 15:12:06,426 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-01-12 15:12:06,426 INFO L448 ceAbstractionStarter]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-01-12 15:12:06,426 INFO L451 ceAbstractionStarter]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-01-12 15:12:06,426 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (< 2 |fibo2_#in~n|) (<= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| fibo2_~n)) [2019-01-12 15:12:06,426 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-12 15:12:06,426 INFO L444 ceAbstractionStarter]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| fibo2_~n)) (.cse1 (<= |fibo2_#in~n| 6)) (.cse2 (and (<= |fibo2_#in~n| 7) (<= 7 |fibo2_#in~n|)))) (and (<= fibo2_~n |fibo2_#in~n|) (or (and (<= 21 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 21)) (<= |fibo2_#in~n| 8) (and (<= 10 |fibo2_#in~n|) .cse0)) (or (and (<= |fibo2_#t~ret2| 3) .cse0 (<= 3 |fibo2_#t~ret2|) (<= |fibo2_#in~n| 5)) (< 7 |fibo2_#in~n|) (and .cse0 (<= 5 |fibo2_#t~ret2|) (<= fibo2_~n 6) (<= |fibo2_#t~ret2| 5) (<= 6 |fibo2_#in~n|)) (< |fibo2_#in~n| 5) (and (<= |fibo2_#t~ret2| 8) (<= 8 |fibo2_#t~ret2|) (<= 7 fibo2_~n))) (or .cse1 .cse2 (<= 8 fibo2_~n)) (or (and .cse0 (<= 9 |fibo2_#in~n|)) (and (<= |fibo2_#t~ret2| 13) (<= 13 |fibo2_#t~ret2|)) .cse1 .cse2) (or (<= 5 |fibo2_#in~n|) (and (<= |fibo2_#t~ret2| 2) (<= 2 |fibo2_#t~ret2|))) (<= 4 fibo2_~n))) [2019-01-12 15:12:06,427 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-01-12 15:12:06,430 INFO L448 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-01-12 15:12:06,430 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-01-12 15:12:06,430 INFO L448 ceAbstractionStarter]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-01-12 15:12:06,430 INFO L448 ceAbstractionStarter]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-01-12 15:12:06,430 INFO L451 ceAbstractionStarter]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-01-12 15:12:06,431 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (< 3 |fibo1_#in~n|) (<= fibo1_~n |fibo1_#in~n|) (<= |fibo1_#in~n| fibo1_~n)) [2019-01-12 15:12:06,431 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-01-12 15:12:06,431 INFO L444 ceAbstractionStarter]: At program point L13-2(line 13) the Hoare annotation is: (and (< 3 |fibo1_#in~n|) (<= fibo1_~n |fibo1_#in~n|) (or (<= 11 |fibo1_#in~n|) (<= |fibo1_#in~n| 9) (and (<= |fibo1_#t~ret0| 34) (<= 34 |fibo1_#t~ret0|))) (or (and (<= 7 fibo1_~n) (<= 8 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 8) (<= |fibo1_#in~n| 7)) (and (<= 13 |fibo1_#t~ret0|) (<= 8 fibo1_~n) (<= |fibo1_#t~ret0| 13)) (< 8 |fibo1_#in~n|) (< |fibo1_#in~n| 6)) (or (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= |fibo1_#in~n| 4)) (<= 6 |fibo1_#in~n|) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3) (<= 5 fibo1_~n))) (<= |fibo1_#in~n| fibo1_~n)) [2019-01-12 15:12:06,431 INFO L448 ceAbstractionStarter]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-01-12 15:12:06,431 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-01-12 15:12:06,431 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-01-12 15:12:06,431 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-01-12 15:12:06,431 INFO L448 ceAbstractionStarter]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-01-12 15:12:06,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:12:06 BoogieIcfgContainer [2019-01-12 15:12:06,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:12:06,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:12:06,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:12:06,461 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:12:06,463 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:10:12" (3/4) ... [2019-01-12 15:12:06,468 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:12:06,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-01-12 15:12:06,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-01-12 15:12:06,482 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:12:06,482 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:12:06,533 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:12:06,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:12:06,534 INFO L168 Benchmark]: Toolchain (without parser) took 114646.09 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -123.1 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-12 15:12:06,537 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:06,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:06,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.85 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:06,539 INFO L168 Benchmark]: Boogie Preprocessor took 16.55 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:06,540 INFO L168 Benchmark]: RCFGBuilder took 523.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:12:06,541 INFO L168 Benchmark]: TraceAbstraction took 113658.87 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-12 15:12:06,546 INFO L168 Benchmark]: Witness Printer took 75.06 ms. Allocated memory is still 5.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:12:06,551 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.65 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.85 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.55 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 523.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113658.87 ms. Allocated memory was 1.1 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 75.06 ms. Allocated memory is still 5.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: 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: 35]: Loop Invariant Derived loop invariant: 10 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. SAFE Result, 113.5s OverallTime, 28 OverallIterations, 130 TraceHistogramMax, 34.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1022 SDtfs, 2282 SDslu, 12389 SDs, 0 SdLazy, 18291 SolverSat, 2437 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23416 GetRequests, 22355 SyntacticMatches, 98 SemanticMatches, 963 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9670 ImplicationChecksByTransitivity, 38.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 571 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 2318 PreInvPairs, 4916 NumberOfFragments, 241 HoareAnnotationTreeSize, 2318 FomulaSimplifications, 182668 FormulaSimplificationTreeSizeReduction, 4.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 212459 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 44377 NumberOfCodeBlocks, 36861 NumberOfCodeBlocksAsserted, 308 NumberOfCheckSat, 44323 ConstructedInterpolants, 0 QuantifiedInterpolants, 68978761 SizeOfPredicates, 186 NumberOfNonLiveVariables, 32189 ConjunctsInSsa, 1088 ConjunctsInUnsatCore, 54 InterpolantComputations, 2 PerfectInterpolantSequences, 1499197/1604648 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...