java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:49:51,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:49:51,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:49:51,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:49:51,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:49:51,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:49:51,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:49:51,361 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:49:51,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:49:51,364 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:49:51,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:49:51,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:49:51,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:49:51,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:49:51,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:49:51,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:49:51,370 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:49:51,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:49:51,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:49:51,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:49:51,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:49:51,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:49:51,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:49:51,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:49:51,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:49:51,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:49:51,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:49:51,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:49:51,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:49:51,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:49:51,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:49:51,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:49:51,409 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:49:51,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:49:51,412 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:49:51,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:49:51,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:49:51,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:49:51,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:49:51,442 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:49:51,442 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:49:51,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:49:51,443 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:49:51,443 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:49:51,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:49:51,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:49:51,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:49:51,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:49:51,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:49:51,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:49:51,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:49:51,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:49:51,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:49:51,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:49:51,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:49:51,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:49:51,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:49:51,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:49:51,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:49:51,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:49:51,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:49:51,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:49:51,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:49:51,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:49:51,447 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:49:51,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:49:51,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:49:51,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:49:51,508 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:49:51,508 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:49:51,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c [2018-10-23 18:49:51,579 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b06a27f5/6ff7e33454d9472591c24997399d1578/FLAG998d15eaa [2018-10-23 18:49:52,225 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:49:52,226 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label05_true-unreach-call.c [2018-10-23 18:49:52,244 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b06a27f5/6ff7e33454d9472591c24997399d1578/FLAG998d15eaa [2018-10-23 18:49:52,259 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2b06a27f5/6ff7e33454d9472591c24997399d1578 [2018-10-23 18:49:52,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:49:52,273 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:49:52,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:52,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:49:52,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:49:52,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762fedf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:52, skipping insertion in model container [2018-10-23 18:49:52,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:52" (1/1) ... [2018-10-23 18:49:52,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:49:52,390 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:49:53,132 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:53,138 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:49:53,406 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:53,440 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:49:53,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53 WrapperNode [2018-10-23 18:49:53,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:53,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:53,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:49:53,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:49:53,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:53,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:49:53,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:49:53,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:49:53,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... [2018-10-23 18:49:53,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:49:53,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:49:53,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:49:53,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:49:53,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:49:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:49:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:49:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:49:59,783 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:49:59,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:59 BoogieIcfgContainer [2018-10-23 18:49:59,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:49:59,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:49:59,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:49:59,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:49:59,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:49:52" (1/3) ... [2018-10-23 18:49:59,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181db956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:59, skipping insertion in model container [2018-10-23 18:49:59,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:53" (2/3) ... [2018-10-23 18:49:59,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181db956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:59, skipping insertion in model container [2018-10-23 18:49:59,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:59" (3/3) ... [2018-10-23 18:49:59,793 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label05_true-unreach-call.c [2018-10-23 18:49:59,803 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:49:59,812 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:49:59,829 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:49:59,868 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:49:59,869 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:49:59,869 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:49:59,870 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:49:59,870 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:49:59,870 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:49:59,870 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:49:59,870 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:49:59,870 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:49:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:49:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-23 18:49:59,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:49:59,916 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:49:59,919 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:49:59,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:49:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1384220858, now seen corresponding path program 1 times [2018-10-23 18:49:59,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:49:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:49:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:59,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:49:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:00,846 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:50:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:00,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:00,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:00,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:00,966 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:04,606 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-23 18:50:04,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:04,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-10-23 18:50:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:04,633 INFO L225 Difference]: With dead ends: 1075 [2018-10-23 18:50:04,634 INFO L226 Difference]: Without dead ends: 765 [2018-10-23 18:50:04,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-23 18:50:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-23 18:50:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-23 18:50:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-23 18:50:04,726 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 159 [2018-10-23 18:50:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:04,793 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-23 18:50:04,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-23 18:50:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-23 18:50:04,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:04,811 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:04,811 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:04,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249947, now seen corresponding path program 1 times [2018-10-23 18:50:04,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:04,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:04,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:04,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:04,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:04,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:04,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:04,968 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-23 18:50:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:07,148 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-23 18:50:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:07,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-10-23 18:50:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:07,155 INFO L225 Difference]: With dead ends: 1465 [2018-10-23 18:50:07,155 INFO L226 Difference]: Without dead ends: 947 [2018-10-23 18:50:07,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-23 18:50:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-23 18:50:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-23 18:50:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-23 18:50:07,216 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 168 [2018-10-23 18:50:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:07,217 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-23 18:50:07,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-23 18:50:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-23 18:50:07,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:07,227 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:07,228 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:07,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:07,228 INFO L82 PathProgramCache]: Analyzing trace with hash -721058890, now seen corresponding path program 1 times [2018-10-23 18:50:07,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:07,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:07,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-23 18:50:07,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:07,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:07,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:07,402 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-23 18:50:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:10,271 INFO L93 Difference]: Finished difference Result 2774 states and 4502 transitions. [2018-10-23 18:50:10,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:10,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-23 18:50:10,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:10,284 INFO L225 Difference]: With dead ends: 2774 [2018-10-23 18:50:10,284 INFO L226 Difference]: Without dead ends: 1845 [2018-10-23 18:50:10,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2018-10-23 18:50:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1841. [2018-10-23 18:50:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2018-10-23 18:50:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2985 transitions. [2018-10-23 18:50:10,350 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2985 transitions. Word has length 182 [2018-10-23 18:50:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:10,350 INFO L481 AbstractCegarLoop]: Abstraction has 1841 states and 2985 transitions. [2018-10-23 18:50:10,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2985 transitions. [2018-10-23 18:50:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-23 18:50:10,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:10,356 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:10,359 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:10,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2043591850, now seen corresponding path program 1 times [2018-10-23 18:50:10,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:10,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:10,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:10,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:10,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:10,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:10,618 INFO L87 Difference]: Start difference. First operand 1841 states and 2985 transitions. Second operand 4 states. [2018-10-23 18:50:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:13,635 INFO L93 Difference]: Finished difference Result 7028 states and 11557 transitions. [2018-10-23 18:50:13,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:13,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-23 18:50:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:13,664 INFO L225 Difference]: With dead ends: 7028 [2018-10-23 18:50:13,664 INFO L226 Difference]: Without dead ends: 5189 [2018-10-23 18:50:13,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2018-10-23 18:50:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 3481. [2018-10-23 18:50:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3481 states. [2018-10-23 18:50:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 5332 transitions. [2018-10-23 18:50:13,770 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 5332 transitions. Word has length 183 [2018-10-23 18:50:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:13,770 INFO L481 AbstractCegarLoop]: Abstraction has 3481 states and 5332 transitions. [2018-10-23 18:50:13,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 5332 transitions. [2018-10-23 18:50:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-23 18:50:13,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:13,778 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:13,779 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:13,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1105939895, now seen corresponding path program 1 times [2018-10-23 18:50:13,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:13,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:13,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:13,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:13,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 18:50:13,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:13,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:13,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:13,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:13,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:13,969 INFO L87 Difference]: Start difference. First operand 3481 states and 5332 transitions. Second operand 3 states. [2018-10-23 18:50:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:15,126 INFO L93 Difference]: Finished difference Result 6910 states and 10594 transitions. [2018-10-23 18:50:15,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:15,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-23 18:50:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:15,143 INFO L225 Difference]: With dead ends: 6910 [2018-10-23 18:50:15,143 INFO L226 Difference]: Without dead ends: 3431 [2018-10-23 18:50:15,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2018-10-23 18:50:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3431. [2018-10-23 18:50:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3431 states. [2018-10-23 18:50:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5172 transitions. [2018-10-23 18:50:15,217 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5172 transitions. Word has length 197 [2018-10-23 18:50:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:15,217 INFO L481 AbstractCegarLoop]: Abstraction has 3431 states and 5172 transitions. [2018-10-23 18:50:15,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5172 transitions. [2018-10-23 18:50:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-23 18:50:15,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:15,223 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:15,223 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:15,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash 184830782, now seen corresponding path program 1 times [2018-10-23 18:50:15,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:15,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:15,746 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:50:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:15,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:15,795 INFO L87 Difference]: Start difference. First operand 3431 states and 5172 transitions. Second operand 5 states. [2018-10-23 18:50:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:20,535 INFO L93 Difference]: Finished difference Result 8133 states and 12410 transitions. [2018-10-23 18:50:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:20,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2018-10-23 18:50:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:20,557 INFO L225 Difference]: With dead ends: 8133 [2018-10-23 18:50:20,558 INFO L226 Difference]: Without dead ends: 4704 [2018-10-23 18:50:20,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-10-23 18:50:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3839. [2018-10-23 18:50:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3839 states. [2018-10-23 18:50:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5746 transitions. [2018-10-23 18:50:20,633 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5746 transitions. Word has length 199 [2018-10-23 18:50:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:20,634 INFO L481 AbstractCegarLoop]: Abstraction has 3839 states and 5746 transitions. [2018-10-23 18:50:20,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5746 transitions. [2018-10-23 18:50:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-23 18:50:20,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:20,639 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:20,639 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:20,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1707350819, now seen corresponding path program 1 times [2018-10-23 18:50:20,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:20,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:20,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:20,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:20,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:20,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:20,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:20,777 INFO L87 Difference]: Start difference. First operand 3839 states and 5746 transitions. Second operand 3 states. [2018-10-23 18:50:22,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:22,098 INFO L93 Difference]: Finished difference Result 10952 states and 16371 transitions. [2018-10-23 18:50:22,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:22,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-10-23 18:50:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:22,127 INFO L225 Difference]: With dead ends: 10952 [2018-10-23 18:50:22,128 INFO L226 Difference]: Without dead ends: 7115 [2018-10-23 18:50:22,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-10-23 18:50:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7109. [2018-10-23 18:50:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-23 18:50:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10002 transitions. [2018-10-23 18:50:22,250 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10002 transitions. Word has length 200 [2018-10-23 18:50:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:22,251 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 10002 transitions. [2018-10-23 18:50:22,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10002 transitions. [2018-10-23 18:50:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-23 18:50:22,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:22,260 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:22,260 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:22,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1058009179, now seen corresponding path program 1 times [2018-10-23 18:50:22,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-23 18:50:22,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:22,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:22,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:22,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:22,416 INFO L87 Difference]: Start difference. First operand 7109 states and 10002 transitions. Second operand 3 states. [2018-10-23 18:50:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:23,982 INFO L93 Difference]: Finished difference Result 20952 states and 29506 transitions. [2018-10-23 18:50:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:23,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-10-23 18:50:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:24,015 INFO L225 Difference]: With dead ends: 20952 [2018-10-23 18:50:24,016 INFO L226 Difference]: Without dead ends: 13845 [2018-10-23 18:50:24,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13845 states. [2018-10-23 18:50:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13845 to 13841. [2018-10-23 18:50:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2018-10-23 18:50:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 17514 transitions. [2018-10-23 18:50:24,215 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 17514 transitions. Word has length 207 [2018-10-23 18:50:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:24,215 INFO L481 AbstractCegarLoop]: Abstraction has 13841 states and 17514 transitions. [2018-10-23 18:50:24,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 17514 transitions. [2018-10-23 18:50:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-23 18:50:24,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:24,233 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:24,233 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:24,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2125468984, now seen corresponding path program 1 times [2018-10-23 18:50:24,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:24,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:24,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:24,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:24,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-23 18:50:24,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:24,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:24,444 INFO L87 Difference]: Start difference. First operand 13841 states and 17514 transitions. Second operand 3 states. [2018-10-23 18:50:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:26,650 INFO L93 Difference]: Finished difference Result 33188 states and 42784 transitions. [2018-10-23 18:50:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:26,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-10-23 18:50:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:26,690 INFO L225 Difference]: With dead ends: 33188 [2018-10-23 18:50:26,690 INFO L226 Difference]: Without dead ends: 19349 [2018-10-23 18:50:26,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19349 states. [2018-10-23 18:50:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19349 to 19349. [2018-10-23 18:50:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19349 states. [2018-10-23 18:50:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19349 states to 19349 states and 23382 transitions. [2018-10-23 18:50:26,957 INFO L78 Accepts]: Start accepts. Automaton has 19349 states and 23382 transitions. Word has length 228 [2018-10-23 18:50:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:26,960 INFO L481 AbstractCegarLoop]: Abstraction has 19349 states and 23382 transitions. [2018-10-23 18:50:26,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19349 states and 23382 transitions. [2018-10-23 18:50:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-23 18:50:26,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:26,983 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:26,983 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:26,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash -379201010, now seen corresponding path program 1 times [2018-10-23 18:50:26,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:26,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:26,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:26,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:26,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-23 18:50:27,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:27,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:27,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:27,385 INFO L87 Difference]: Start difference. First operand 19349 states and 23382 transitions. Second operand 4 states. [2018-10-23 18:50:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:30,336 INFO L93 Difference]: Finished difference Result 68561 states and 81633 transitions. [2018-10-23 18:50:30,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:30,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-10-23 18:50:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:30,418 INFO L225 Difference]: With dead ends: 68561 [2018-10-23 18:50:30,418 INFO L226 Difference]: Without dead ends: 49214 [2018-10-23 18:50:30,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49214 states. [2018-10-23 18:50:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49214 to 35465. [2018-10-23 18:50:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-23 18:50:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 41755 transitions. [2018-10-23 18:50:30,961 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 41755 transitions. Word has length 281 [2018-10-23 18:50:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:30,962 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 41755 transitions. [2018-10-23 18:50:30,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 41755 transitions. [2018-10-23 18:50:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-23 18:50:30,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:30,992 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:30,993 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:30,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1671916148, now seen corresponding path program 1 times [2018-10-23 18:50:30,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:30,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:30,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:30,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:30,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-23 18:50:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:31,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:31,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:31,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:31,231 INFO L87 Difference]: Start difference. First operand 35465 states and 41755 transitions. Second operand 3 states. [2018-10-23 18:50:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:32,657 INFO L93 Difference]: Finished difference Result 70930 states and 83512 transitions. [2018-10-23 18:50:32,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:32,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2018-10-23 18:50:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:32,697 INFO L225 Difference]: With dead ends: 70930 [2018-10-23 18:50:32,697 INFO L226 Difference]: Without dead ends: 35467 [2018-10-23 18:50:32,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35467 states. [2018-10-23 18:50:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35467 to 35465. [2018-10-23 18:50:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-23 18:50:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40448 transitions. [2018-10-23 18:50:33,172 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40448 transitions. Word has length 296 [2018-10-23 18:50:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:33,172 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40448 transitions. [2018-10-23 18:50:33,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40448 transitions. [2018-10-23 18:50:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-23 18:50:33,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:33,203 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:33,203 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:33,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1738833954, now seen corresponding path program 1 times [2018-10-23 18:50:33,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:33,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:33,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:34,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:34,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:34,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:34,054 INFO L87 Difference]: Start difference. First operand 35465 states and 40448 transitions. Second operand 4 states. [2018-10-23 18:50:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:35,509 INFO L93 Difference]: Finished difference Result 70937 states and 80912 transitions. [2018-10-23 18:50:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:35,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2018-10-23 18:50:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:35,545 INFO L225 Difference]: With dead ends: 70937 [2018-10-23 18:50:35,545 INFO L226 Difference]: Without dead ends: 35474 [2018-10-23 18:50:35,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2018-10-23 18:50:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35465. [2018-10-23 18:50:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35465 states. [2018-10-23 18:50:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35465 states to 35465 states and 40094 transitions. [2018-10-23 18:50:35,970 INFO L78 Accepts]: Start accepts. Automaton has 35465 states and 40094 transitions. Word has length 303 [2018-10-23 18:50:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:35,970 INFO L481 AbstractCegarLoop]: Abstraction has 35465 states and 40094 transitions. [2018-10-23 18:50:35,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35465 states and 40094 transitions. [2018-10-23 18:50:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-23 18:50:35,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:35,987 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:35,987 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:35,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1030791003, now seen corresponding path program 1 times [2018-10-23 18:50:35,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:35,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:35,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:36,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:36,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:36,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:36,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:36,405 INFO L87 Difference]: Start difference. First operand 35465 states and 40094 transitions. Second operand 4 states. [2018-10-23 18:50:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:39,027 INFO L93 Difference]: Finished difference Result 70932 states and 80192 transitions. [2018-10-23 18:50:39,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:39,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-10-23 18:50:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:39,062 INFO L225 Difference]: With dead ends: 70932 [2018-10-23 18:50:39,062 INFO L226 Difference]: Without dead ends: 35469 [2018-10-23 18:50:39,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35469 states. [2018-10-23 18:50:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35469 to 33629. [2018-10-23 18:50:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33629 states. [2018-10-23 18:50:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33629 states to 33629 states and 37353 transitions. [2018-10-23 18:50:39,665 INFO L78 Accepts]: Start accepts. Automaton has 33629 states and 37353 transitions. Word has length 308 [2018-10-23 18:50:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:39,665 INFO L481 AbstractCegarLoop]: Abstraction has 33629 states and 37353 transitions. [2018-10-23 18:50:39,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 33629 states and 37353 transitions. [2018-10-23 18:50:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-23 18:50:39,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:39,686 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:39,686 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:39,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash -312509538, now seen corresponding path program 1 times [2018-10-23 18:50:39,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:39,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:39,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:40,326 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-23 18:50:40,766 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-10-23 18:50:41,056 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-10-23 18:50:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 203 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-23 18:50:41,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:41,221 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:50:41,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:41,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 18:50:41,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:50:41,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-23 18:50:41,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 18:50:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 18:50:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-23 18:50:41,740 INFO L87 Difference]: Start difference. First operand 33629 states and 37353 transitions. Second operand 9 states. [2018-10-23 18:50:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:53,172 INFO L93 Difference]: Finished difference Result 206388 states and 228474 transitions. [2018-10-23 18:50:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-23 18:50:53,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 382 [2018-10-23 18:50:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:53,513 INFO L225 Difference]: With dead ends: 206388 [2018-10-23 18:50:53,514 INFO L226 Difference]: Without dead ends: 172761 [2018-10-23 18:50:53,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2018-10-23 18:50:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172761 states. [2018-10-23 18:50:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172761 to 103288. [2018-10-23 18:50:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103288 states. [2018-10-23 18:50:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103288 states to 103288 states and 113667 transitions. [2018-10-23 18:50:55,853 INFO L78 Accepts]: Start accepts. Automaton has 103288 states and 113667 transitions. Word has length 382 [2018-10-23 18:50:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:55,853 INFO L481 AbstractCegarLoop]: Abstraction has 103288 states and 113667 transitions. [2018-10-23 18:50:55,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 18:50:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 103288 states and 113667 transitions. [2018-10-23 18:50:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-23 18:50:55,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:55,890 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:55,891 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:55,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash 176335873, now seen corresponding path program 1 times [2018-10-23 18:50:55,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:55,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:55,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-23 18:50:56,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:56,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:56,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:56,653 INFO L87 Difference]: Start difference. First operand 103288 states and 113667 transitions. Second operand 3 states. [2018-10-23 18:50:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:59,604 INFO L93 Difference]: Finished difference Result 206570 states and 227328 transitions. [2018-10-23 18:50:59,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:59,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2018-10-23 18:50:59,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:59,738 INFO L225 Difference]: With dead ends: 206570 [2018-10-23 18:50:59,738 INFO L226 Difference]: Without dead ends: 103284 [2018-10-23 18:50:59,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103284 states. [2018-10-23 18:51:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103284 to 103284. [2018-10-23 18:51:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103284 states. [2018-10-23 18:51:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103284 states to 103284 states and 113657 transitions. [2018-10-23 18:51:00,944 INFO L78 Accepts]: Start accepts. Automaton has 103284 states and 113657 transitions. Word has length 417 [2018-10-23 18:51:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:00,944 INFO L481 AbstractCegarLoop]: Abstraction has 103284 states and 113657 transitions. [2018-10-23 18:51:00,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:00,945 INFO L276 IsEmpty]: Start isEmpty. Operand 103284 states and 113657 transitions. [2018-10-23 18:51:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-23 18:51:00,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:00,986 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:00,986 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:00,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash 105442293, now seen corresponding path program 1 times [2018-10-23 18:51:00,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:00,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:00,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:00,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-23 18:51:01,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:01,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:01,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:01,577 INFO L87 Difference]: Start difference. First operand 103284 states and 113657 transitions. Second operand 4 states. [2018-10-23 18:51:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:04,255 INFO L93 Difference]: Finished difference Result 386104 states and 424306 transitions. [2018-10-23 18:51:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:04,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 418 [2018-10-23 18:51:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:04,569 INFO L225 Difference]: With dead ends: 386104 [2018-10-23 18:51:04,570 INFO L226 Difference]: Without dead ends: 282822 [2018-10-23 18:51:04,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282822 states. [2018-10-23 18:51:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282822 to 180154. [2018-10-23 18:51:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180154 states. [2018-10-23 18:51:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180154 states to 180154 states and 197738 transitions. [2018-10-23 18:51:08,715 INFO L78 Accepts]: Start accepts. Automaton has 180154 states and 197738 transitions. Word has length 418 [2018-10-23 18:51:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:08,715 INFO L481 AbstractCegarLoop]: Abstraction has 180154 states and 197738 transitions. [2018-10-23 18:51:08,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 180154 states and 197738 transitions. [2018-10-23 18:51:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-23 18:51:08,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:08,759 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:08,759 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:08,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 846659115, now seen corresponding path program 1 times [2018-10-23 18:51:08,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:08,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:08,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-10-23 18:51:09,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:09,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:09,201 INFO L87 Difference]: Start difference. First operand 180154 states and 197738 transitions. Second operand 4 states. [2018-10-23 18:51:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:12,734 INFO L93 Difference]: Finished difference Result 368525 states and 404648 transitions. [2018-10-23 18:51:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:12,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2018-10-23 18:51:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:12,970 INFO L225 Difference]: With dead ends: 368525 [2018-10-23 18:51:12,970 INFO L226 Difference]: Without dead ends: 188373 [2018-10-23 18:51:13,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188373 states. [2018-10-23 18:51:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188373 to 185887. [2018-10-23 18:51:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185887 states. [2018-10-23 18:51:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185887 states to 185887 states and 203690 transitions. [2018-10-23 18:51:16,648 INFO L78 Accepts]: Start accepts. Automaton has 185887 states and 203690 transitions. Word has length 433 [2018-10-23 18:51:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:16,649 INFO L481 AbstractCegarLoop]: Abstraction has 185887 states and 203690 transitions. [2018-10-23 18:51:16,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 185887 states and 203690 transitions. [2018-10-23 18:51:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-23 18:51:16,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:16,678 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:16,678 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:16,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:16,679 INFO L82 PathProgramCache]: Analyzing trace with hash 913804750, now seen corresponding path program 1 times [2018-10-23 18:51:16,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:16,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:16,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:16,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:16,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:17,269 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 18:51:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 281 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:51:18,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:51:18,202 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:51:18,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:18,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:51:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:51:19,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:51:19,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-10-23 18:51:19,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-23 18:51:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-23 18:51:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-23 18:51:19,127 INFO L87 Difference]: Start difference. First operand 185887 states and 203690 transitions. Second operand 11 states. [2018-10-23 18:51:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:37,423 INFO L93 Difference]: Finished difference Result 658424 states and 722133 transitions. [2018-10-23 18:51:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-23 18:51:37,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 435 [2018-10-23 18:51:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:38,029 INFO L225 Difference]: With dead ends: 658424 [2018-10-23 18:51:38,029 INFO L226 Difference]: Without dead ends: 472539 [2018-10-23 18:51:38,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-10-23 18:51:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472539 states. [2018-10-23 18:51:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472539 to 462835. [2018-10-23 18:51:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462835 states. [2018-10-23 18:51:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462835 states to 462835 states and 503432 transitions. [2018-10-23 18:51:52,420 INFO L78 Accepts]: Start accepts. Automaton has 462835 states and 503432 transitions. Word has length 435 [2018-10-23 18:51:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:52,420 INFO L481 AbstractCegarLoop]: Abstraction has 462835 states and 503432 transitions. [2018-10-23 18:51:52,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-23 18:51:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 462835 states and 503432 transitions. [2018-10-23 18:51:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-23 18:51:52,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:52,463 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:52,463 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:52,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1716497848, now seen corresponding path program 1 times [2018-10-23 18:51:52,464 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:52,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-10-23 18:51:52,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:52,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:52,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:52,776 INFO L87 Difference]: Start difference. First operand 462835 states and 503432 transitions. Second operand 3 states. [2018-10-23 18:51:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:57,689 INFO L93 Difference]: Finished difference Result 851748 states and 927190 transitions. [2018-10-23 18:51:57,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:57,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 464 [2018-10-23 18:51:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:58,164 INFO L225 Difference]: With dead ends: 851748 [2018-10-23 18:51:58,165 INFO L226 Difference]: Without dead ends: 388915 [2018-10-23 18:51:58,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388915 states. [2018-10-23 18:52:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388915 to 378079. [2018-10-23 18:52:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378079 states. [2018-10-23 18:52:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378079 states to 378079 states and 404350 transitions. [2018-10-23 18:52:05,070 INFO L78 Accepts]: Start accepts. Automaton has 378079 states and 404350 transitions. Word has length 464 [2018-10-23 18:52:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:05,070 INFO L481 AbstractCegarLoop]: Abstraction has 378079 states and 404350 transitions. [2018-10-23 18:52:05,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:52:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 378079 states and 404350 transitions. [2018-10-23 18:52:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-23 18:52:05,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:05,113 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:05,114 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:05,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -487946110, now seen corresponding path program 1 times [2018-10-23 18:52:05,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:05,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:05,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:05,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:05,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:05,857 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 18:52:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 481 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:52:08,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:52:08,473 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:52:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:08,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:52:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-10-23 18:52:09,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:52:09,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2018-10-23 18:52:09,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-23 18:52:09,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-23 18:52:09,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-10-23 18:52:09,333 INFO L87 Difference]: Start difference. First operand 378079 states and 404350 transitions. Second operand 15 states. [2018-10-23 18:52:09,658 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-10-23 18:52:19,648 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-10-23 18:52:21,275 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-10-23 18:52:27,130 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2018-10-23 18:52:28,819 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-10-23 18:52:29,041 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-10-23 18:52:30,897 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-10-23 18:52:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:49,736 INFO L93 Difference]: Finished difference Result 1350864 states and 1460939 transitions. [2018-10-23 18:52:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-23 18:52:49,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 515 [2018-10-23 18:52:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:50,932 INFO L225 Difference]: With dead ends: 1350864 [2018-10-23 18:52:50,933 INFO L226 Difference]: Without dead ends: 972787 [2018-10-23 18:52:51,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1165, Invalid=3665, Unknown=0, NotChecked=0, Total=4830 [2018-10-23 18:52:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972787 states. [2018-10-23 18:53:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972787 to 683701. [2018-10-23 18:53:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683701 states. [2018-10-23 18:53:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683701 states to 683701 states and 727905 transitions. [2018-10-23 18:53:05,144 INFO L78 Accepts]: Start accepts. Automaton has 683701 states and 727905 transitions. Word has length 515 [2018-10-23 18:53:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:05,144 INFO L481 AbstractCegarLoop]: Abstraction has 683701 states and 727905 transitions. [2018-10-23 18:53:05,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-23 18:53:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 683701 states and 727905 transitions. [2018-10-23 18:53:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2018-10-23 18:53:05,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:05,418 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:05,418 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:05,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:05,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1556115499, now seen corresponding path program 1 times [2018-10-23 18:53:05,419 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:05,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:05,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:05,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:05,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2538 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2018-10-23 18:53:07,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:07,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:07,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:53:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:53:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:07,525 INFO L87 Difference]: Start difference. First operand 683701 states and 727905 transitions. Second operand 4 states. Received shutdown request... [2018-10-23 18:53:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:53:21,088 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:53:21,094 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:53:21,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:53:21 BoogieIcfgContainer [2018-10-23 18:53:21,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:53:21,095 INFO L168 Benchmark]: Toolchain (without parser) took 208823.17 ms. Allocated memory was 1.5 GB in the beginning and 5.8 GB in the end (delta: 4.3 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,096 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:53:21,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1167.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 325.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -871.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,098 INFO L168 Benchmark]: Boogie Preprocessor took 153.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,099 INFO L168 Benchmark]: RCFGBuilder took 5859.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 262.3 MB). Peak memory consumption was 262.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,100 INFO L168 Benchmark]: TraceAbstraction took 201308.75 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 3.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,104 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1167.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 325.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -871.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5859.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 262.3 MB). Peak memory consumption was 262.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 201308.75 ms. Allocated memory was 2.3 GB in the beginning and 5.8 GB in the end (delta: 3.6 GB). Free memory was 1.9 GB in the beginning and 3.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1509]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1509). Cancelled while BasicCegarLoop was constructing difference of abstraction (683701states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1319008 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 201.2s OverallTime, 21 OverallIterations, 11 TraceHistogramMax, 133.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5134 SDtfs, 29005 SDslu, 5436 SDs, 0 SdLazy, 43876 SolverSat, 7840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1597 GetRequests, 1430 SyntacticMatches, 12 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683701occurred 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: 48.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 502701 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 8154 NumberOfCodeBlocks, 8154 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 8130 ConstructedInterpolants, 0 QuantifiedInterpolants, 15107956 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2191 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 8160/8591 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown