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_label54_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:00:44,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:00:44,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:00:44,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:00:44,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:00:44,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:00:44,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:00:44,999 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:00:45,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:00:45,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:00:45,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:00:45,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:00:45,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:00:45,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:00:45,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:00:45,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:00:45,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:00:45,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:00:45,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:00:45,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:00:45,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:00:45,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:00:45,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:00:45,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:00:45,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:00:45,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:00:45,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:00:45,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:00:45,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:00:45,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:00:45,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:00:45,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:00:45,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:00:45,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:00:45,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:00:45,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:00:45,028 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-24 15:00:45,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:00:45,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:00:45,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:00:45,047 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:00:45,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:00:45,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:00:45,048 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:00:45,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:00:45,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:00:45,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:00:45,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:00:45,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:00:45,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:00:45,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:00:45,049 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:00:45,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:00:45,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:00:45,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:00:45,050 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:00:45,050 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:45,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:00:45,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:00:45,051 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:00:45,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:00:45,051 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:00:45,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:00:45,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:00:45,052 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:00:45,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:00:45,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:00:45,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:00:45,119 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:00:45,119 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:00:45,119 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label54_true-unreach-call.c [2018-10-24 15:00:45,184 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b37f7a478/ab5d6963558440029bf7e97d62a4edc6/FLAGae88453d7 [2018-10-24 15:00:45,892 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:00:45,893 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label54_true-unreach-call.c [2018-10-24 15:00:45,915 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b37f7a478/ab5d6963558440029bf7e97d62a4edc6/FLAGae88453d7 [2018-10-24 15:00:45,937 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b37f7a478/ab5d6963558440029bf7e97d62a4edc6 [2018-10-24 15:00:45,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:00:45,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:00:45,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:45,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:00:45,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:00:45,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:45" (1/1) ... [2018-10-24 15:00:45,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68109397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:45, skipping insertion in model container [2018-10-24 15:00:45,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:45" (1/1) ... [2018-10-24 15:00:45,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:00:46,072 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:00:46,856 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:46,863 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:00:47,098 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:47,123 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:00:47,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47 WrapperNode [2018-10-24 15:00:47,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:47,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:47,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:00:47,127 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:00:47,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:47,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:00:47,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:00:47,448 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:00:47,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (1/1) ... [2018-10-24 15:00:47,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:00:47,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:00:47,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:00:47,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:00:47,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (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-24 15:00:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:00:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:00:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:00:52,977 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:00:52,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:52 BoogieIcfgContainer [2018-10-24 15:00:52,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:00:52,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:00:52,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:00:52,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:00:52,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:45" (1/3) ... [2018-10-24 15:00:52,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:52, skipping insertion in model container [2018-10-24 15:00:52,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:47" (2/3) ... [2018-10-24 15:00:52,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e4afdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:52, skipping insertion in model container [2018-10-24 15:00:52,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:52" (3/3) ... [2018-10-24 15:00:52,987 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label54_true-unreach-call.c [2018-10-24 15:00:52,998 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:00:53,007 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:00:53,025 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:00:53,064 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:00:53,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:00:53,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:00:53,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:00:53,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:00:53,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:00:53,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:00:53,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:00:53,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:00:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:00:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 15:00:53,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:53,115 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:53,118 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:53,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764838, now seen corresponding path program 1 times [2018-10-24 15:00:53,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:53,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:53,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:53,893 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-24 15:00:53,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:53,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:53,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:53,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:53,923 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2018-10-24 15:00:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:56,309 INFO L93 Difference]: Finished difference Result 832 states and 1481 transitions. [2018-10-24 15:00:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:56,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2018-10-24 15:00:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:56,335 INFO L225 Difference]: With dead ends: 832 [2018-10-24 15:00:56,336 INFO L226 Difference]: Without dead ends: 525 [2018-10-24 15:00:56,341 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-24 15:00:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-24 15:00:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 511. [2018-10-24 15:00:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-24 15:00:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 878 transitions. [2018-10-24 15:00:56,427 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 878 transitions. Word has length 167 [2018-10-24 15:00:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:56,429 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 878 transitions. [2018-10-24 15:00:56,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 878 transitions. [2018-10-24 15:00:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-24 15:00:56,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:56,436 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:56,436 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:56,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 786333897, now seen corresponding path program 1 times [2018-10-24 15:00:56,437 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:56,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:56,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:56,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:56,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:56,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:56,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:56,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:56,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:56,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:56,789 INFO L87 Difference]: Start difference. First operand 511 states and 878 transitions. Second operand 4 states. [2018-10-24 15:01:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:00,308 INFO L93 Difference]: Finished difference Result 1893 states and 3348 transitions. [2018-10-24 15:01:00,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:00,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-10-24 15:01:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:00,318 INFO L225 Difference]: With dead ends: 1893 [2018-10-24 15:01:00,318 INFO L226 Difference]: Without dead ends: 1384 [2018-10-24 15:01:00,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2018-10-24 15:01:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 923. [2018-10-24 15:01:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-24 15:01:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-24 15:01:00,366 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 173 [2018-10-24 15:01:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:00,367 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-24 15:01:00,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-24 15:01:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 15:01:00,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:00,376 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:00,377 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:00,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:00,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2042740050, now seen corresponding path program 1 times [2018-10-24 15:01:00,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:00,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:00,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:00,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:00,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:00,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:00,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:00,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:00,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:00,648 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-24 15:01:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:04,325 INFO L93 Difference]: Finished difference Result 2673 states and 4434 transitions. [2018-10-24 15:01:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:04,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-24 15:01:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:04,336 INFO L225 Difference]: With dead ends: 2673 [2018-10-24 15:01:04,336 INFO L226 Difference]: Without dead ends: 1752 [2018-10-24 15:01:04,339 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-24 15:01:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2018-10-24 15:01:04,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1750. [2018-10-24 15:01:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-24 15:01:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-10-24 15:01:04,376 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 175 [2018-10-24 15:01:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:04,377 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-10-24 15:01:04,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-10-24 15:01:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 15:01:04,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:04,382 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:04,382 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:04,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1636219690, now seen corresponding path program 1 times [2018-10-24 15:01:04,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:04,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:04,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:04,507 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-24 15:01:04,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:04,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:04,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:04,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:04,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:04,509 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-10-24 15:01:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:05,322 INFO L93 Difference]: Finished difference Result 5231 states and 8078 transitions. [2018-10-24 15:01:05,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:05,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-24 15:01:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:05,339 INFO L225 Difference]: With dead ends: 5231 [2018-10-24 15:01:05,339 INFO L226 Difference]: Without dead ends: 3483 [2018-10-24 15:01:05,343 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-24 15:01:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3483 states. [2018-10-24 15:01:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3483 to 3479. [2018-10-24 15:01:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3479 states. [2018-10-24 15:01:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5369 transitions. [2018-10-24 15:01:05,415 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5369 transitions. Word has length 190 [2018-10-24 15:01:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:05,415 INFO L481 AbstractCegarLoop]: Abstraction has 3479 states and 5369 transitions. [2018-10-24 15:01:05,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5369 transitions. [2018-10-24 15:01:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-24 15:01:05,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:05,423 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:05,423 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:05,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:05,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1371839370, now seen corresponding path program 1 times [2018-10-24 15:01:05,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:05,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:05,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:05,668 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-24 15:01:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:05,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:05,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:05,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:05,670 INFO L87 Difference]: Start difference. First operand 3479 states and 5369 transitions. Second operand 4 states. [2018-10-24 15:01:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:07,790 INFO L93 Difference]: Finished difference Result 13572 states and 21082 transitions. [2018-10-24 15:01:07,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:07,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-10-24 15:01:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:07,833 INFO L225 Difference]: With dead ends: 13572 [2018-10-24 15:01:07,834 INFO L226 Difference]: Without dead ends: 10095 [2018-10-24 15:01:07,841 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-24 15:01:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10095 states. [2018-10-24 15:01:07,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10095 to 6751. [2018-10-24 15:01:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6751 states. [2018-10-24 15:01:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6751 states to 6751 states and 9852 transitions. [2018-10-24 15:01:07,994 INFO L78 Accepts]: Start accepts. Automaton has 6751 states and 9852 transitions. Word has length 191 [2018-10-24 15:01:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:07,995 INFO L481 AbstractCegarLoop]: Abstraction has 6751 states and 9852 transitions. [2018-10-24 15:01:07,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6751 states and 9852 transitions. [2018-10-24 15:01:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-24 15:01:08,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:08,007 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:08,007 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:08,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:08,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2009477225, now seen corresponding path program 1 times [2018-10-24 15:01:08,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:08,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:08,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:08,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:08,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:08,153 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-24 15:01:08,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:08,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:08,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:08,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:08,155 INFO L87 Difference]: Start difference. First operand 6751 states and 9852 transitions. Second operand 3 states. [2018-10-24 15:01:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:09,867 INFO L93 Difference]: Finished difference Result 13450 states and 19634 transitions. [2018-10-24 15:01:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:09,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-24 15:01:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:09,894 INFO L225 Difference]: With dead ends: 13450 [2018-10-24 15:01:09,894 INFO L226 Difference]: Without dead ends: 6701 [2018-10-24 15:01:09,904 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-24 15:01:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6701 states. [2018-10-24 15:01:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6701 to 6701. [2018-10-24 15:01:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6701 states. [2018-10-24 15:01:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 9628 transitions. [2018-10-24 15:01:10,036 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 9628 transitions. Word has length 205 [2018-10-24 15:01:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:10,037 INFO L481 AbstractCegarLoop]: Abstraction has 6701 states and 9628 transitions. [2018-10-24 15:01:10,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 9628 transitions. [2018-10-24 15:01:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-24 15:01:10,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:10,047 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:10,047 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:10,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash -316930978, now seen corresponding path program 1 times [2018-10-24 15:01:10,047 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:10,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:10,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:10,483 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:01:10,520 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-24 15:01:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:10,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:10,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:01:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:01:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:10,522 INFO L87 Difference]: Start difference. First operand 6701 states and 9628 transitions. Second operand 5 states. [2018-10-24 15:01:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:13,085 INFO L93 Difference]: Finished difference Result 15491 states and 22470 transitions. [2018-10-24 15:01:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:01:13,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2018-10-24 15:01:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:13,141 INFO L225 Difference]: With dead ends: 15491 [2018-10-24 15:01:13,142 INFO L226 Difference]: Without dead ends: 8792 [2018-10-24 15:01:13,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:01:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2018-10-24 15:01:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7109. [2018-10-24 15:01:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-24 15:01:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 10120 transitions. [2018-10-24 15:01:13,316 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 10120 transitions. Word has length 207 [2018-10-24 15:01:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:13,316 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 10120 transitions. [2018-10-24 15:01:13,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:01:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 10120 transitions. [2018-10-24 15:01:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-24 15:01:13,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:13,327 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:13,328 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:13,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 265559875, now seen corresponding path program 1 times [2018-10-24 15:01:13,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:13,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:13,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:13,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:13,548 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-24 15:01:13,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:13,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:13,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:13,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:13,550 INFO L87 Difference]: Start difference. First operand 7109 states and 10120 transitions. Second operand 3 states. [2018-10-24 15:01:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:14,705 INFO L93 Difference]: Finished difference Result 14222 states and 20249 transitions. [2018-10-24 15:01:14,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:14,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2018-10-24 15:01:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:14,727 INFO L225 Difference]: With dead ends: 14222 [2018-10-24 15:01:14,727 INFO L226 Difference]: Without dead ends: 7115 [2018-10-24 15:01:14,735 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-24 15:01:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2018-10-24 15:01:14,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7109. [2018-10-24 15:01:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2018-10-24 15:01:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 9506 transitions. [2018-10-24 15:01:14,830 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 9506 transitions. Word has length 208 [2018-10-24 15:01:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:14,830 INFO L481 AbstractCegarLoop]: Abstraction has 7109 states and 9506 transitions. [2018-10-24 15:01:14,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 9506 transitions. [2018-10-24 15:01:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-24 15:01:14,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:14,843 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:14,844 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:14,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash -848085893, now seen corresponding path program 1 times [2018-10-24 15:01:14,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:14,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:15,004 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-24 15:01:15,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:15,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:15,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:15,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:15,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:15,005 INFO L87 Difference]: Start difference. First operand 7109 states and 9506 transitions. Second operand 3 states. [2018-10-24 15:01:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:17,475 INFO L93 Difference]: Finished difference Result 20540 states and 27399 transitions. [2018-10-24 15:01:17,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:17,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-10-24 15:01:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:17,496 INFO L225 Difference]: With dead ends: 20540 [2018-10-24 15:01:17,496 INFO L226 Difference]: Without dead ends: 13433 [2018-10-24 15:01:17,505 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-24 15:01:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13433 states. [2018-10-24 15:01:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13433 to 13429. [2018-10-24 15:01:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13429 states. [2018-10-24 15:01:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13429 states to 13429 states and 16273 transitions. [2018-10-24 15:01:17,678 INFO L78 Accepts]: Start accepts. Automaton has 13429 states and 16273 transitions. Word has length 215 [2018-10-24 15:01:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:17,678 INFO L481 AbstractCegarLoop]: Abstraction has 13429 states and 16273 transitions. [2018-10-24 15:01:17,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13429 states and 16273 transitions. [2018-10-24 15:01:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-24 15:01:17,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:17,696 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:01:17,696 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:17,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash 851575128, now seen corresponding path program 1 times [2018-10-24 15:01:17,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:17,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 15:01:17,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:17,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:17,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:17,858 INFO L87 Difference]: Start difference. First operand 13429 states and 16273 transitions. Second operand 3 states. [2018-10-24 15:01:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:20,119 INFO L93 Difference]: Finished difference Result 32364 states and 39837 transitions. [2018-10-24 15:01:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:20,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-10-24 15:01:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:20,268 INFO L225 Difference]: With dead ends: 32364 [2018-10-24 15:01:20,268 INFO L226 Difference]: Without dead ends: 18937 [2018-10-24 15:01:20,280 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-24 15:01:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18937 states. [2018-10-24 15:01:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18937 to 18937. [2018-10-24 15:01:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18937 states. [2018-10-24 15:01:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18937 states to 18937 states and 22202 transitions. [2018-10-24 15:01:20,522 INFO L78 Accepts]: Start accepts. Automaton has 18937 states and 22202 transitions. Word has length 240 [2018-10-24 15:01:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:20,523 INFO L481 AbstractCegarLoop]: Abstraction has 18937 states and 22202 transitions. [2018-10-24 15:01:20,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 18937 states and 22202 transitions. [2018-10-24 15:01:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-24 15:01:20,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:20,540 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:01:20,540 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:20,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1358554894, now seen corresponding path program 1 times [2018-10-24 15:01:20,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:20,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:20,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:20,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:20,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:20,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:20,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:20,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:20,806 INFO L87 Difference]: Start difference. First operand 18937 states and 22202 transitions. Second operand 3 states. [2018-10-24 15:01:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:22,599 INFO L93 Difference]: Finished difference Result 51134 states and 59623 transitions. [2018-10-24 15:01:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:22,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-10-24 15:01:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:22,632 INFO L225 Difference]: With dead ends: 51134 [2018-10-24 15:01:22,632 INFO L226 Difference]: Without dead ends: 32199 [2018-10-24 15:01:22,649 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-24 15:01:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32199 states. [2018-10-24 15:01:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32199 to 32186. [2018-10-24 15:01:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32186 states. [2018-10-24 15:01:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32186 states to 32186 states and 36762 transitions. [2018-10-24 15:01:23,018 INFO L78 Accepts]: Start accepts. Automaton has 32186 states and 36762 transitions. Word has length 242 [2018-10-24 15:01:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:23,019 INFO L481 AbstractCegarLoop]: Abstraction has 32186 states and 36762 transitions. [2018-10-24 15:01:23,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32186 states and 36762 transitions. [2018-10-24 15:01:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-24 15:01:23,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:23,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:01:23,051 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:23,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:23,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2022840628, now seen corresponding path program 1 times [2018-10-24 15:01:23,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:23,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:23,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:23,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:23,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:23,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:23,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:23,468 INFO L87 Difference]: Start difference. First operand 32186 states and 36762 transitions. Second operand 4 states. [2018-10-24 15:01:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:24,331 INFO L93 Difference]: Finished difference Result 123822 states and 141274 transitions. [2018-10-24 15:01:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:24,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2018-10-24 15:01:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:24,727 INFO L225 Difference]: With dead ends: 123822 [2018-10-24 15:01:24,727 INFO L226 Difference]: Without dead ends: 91638 [2018-10-24 15:01:24,751 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-24 15:01:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91638 states. [2018-10-24 15:01:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91638 to 60068. [2018-10-24 15:01:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60068 states. [2018-10-24 15:01:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60068 states to 60068 states and 68482 transitions. [2018-10-24 15:01:25,569 INFO L78 Accepts]: Start accepts. Automaton has 60068 states and 68482 transitions. Word has length 299 [2018-10-24 15:01:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:25,569 INFO L481 AbstractCegarLoop]: Abstraction has 60068 states and 68482 transitions. [2018-10-24 15:01:25,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 60068 states and 68482 transitions. [2018-10-24 15:01:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-24 15:01:25,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:25,600 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, 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] [2018-10-24 15:01:25,600 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:25,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1719401463, now seen corresponding path program 1 times [2018-10-24 15:01:25,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 15:01:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:26,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:26,157 INFO L87 Difference]: Start difference. First operand 60068 states and 68482 transitions. Second operand 4 states. [2018-10-24 15:01:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:28,606 INFO L93 Difference]: Finished difference Result 174867 states and 199207 transitions. [2018-10-24 15:01:28,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:28,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2018-10-24 15:01:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:29,217 INFO L225 Difference]: With dead ends: 174867 [2018-10-24 15:01:29,217 INFO L226 Difference]: Without dead ends: 114801 [2018-10-24 15:01:29,250 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-24 15:01:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114801 states. [2018-10-24 15:01:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114801 to 114799. [2018-10-24 15:01:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114799 states. [2018-10-24 15:01:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114799 states to 114799 states and 130705 transitions. [2018-10-24 15:01:30,336 INFO L78 Accepts]: Start accepts. Automaton has 114799 states and 130705 transitions. Word has length 321 [2018-10-24 15:01:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:30,337 INFO L481 AbstractCegarLoop]: Abstraction has 114799 states and 130705 transitions. [2018-10-24 15:01:30,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 114799 states and 130705 transitions. [2018-10-24 15:01:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-24 15:01:30,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:30,387 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-24 15:01:30,387 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:30,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2077519843, now seen corresponding path program 1 times [2018-10-24 15:01:30,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:30,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-24 15:01:30,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:30,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:30,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:30,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:30,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:30,619 INFO L87 Difference]: Start difference. First operand 114799 states and 130705 transitions. Second operand 4 states. [2018-10-24 15:01:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:34,896 INFO L93 Difference]: Finished difference Result 434593 states and 493616 transitions. [2018-10-24 15:01:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:34,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 395 [2018-10-24 15:01:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:35,241 INFO L225 Difference]: With dead ends: 434593 [2018-10-24 15:01:35,241 INFO L226 Difference]: Without dead ends: 319796 [2018-10-24 15:01:35,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319796 states. [2018-10-24 15:01:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319796 to 319784. [2018-10-24 15:01:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319784 states. [2018-10-24 15:01:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319784 states to 319784 states and 362577 transitions. [2018-10-24 15:01:39,708 INFO L78 Accepts]: Start accepts. Automaton has 319784 states and 362577 transitions. Word has length 395 [2018-10-24 15:01:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:39,709 INFO L481 AbstractCegarLoop]: Abstraction has 319784 states and 362577 transitions. [2018-10-24 15:01:39,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 319784 states and 362577 transitions. [2018-10-24 15:01:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-24 15:01:39,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:39,805 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 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, 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] [2018-10-24 15:01:39,805 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:39,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:39,806 INFO L82 PathProgramCache]: Analyzing trace with hash 561179551, now seen corresponding path program 1 times [2018-10-24 15:01:39,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:39,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:39,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:39,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-24 15:01:40,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:40,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:40,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:40,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:40,234 INFO L87 Difference]: Start difference. First operand 319784 states and 362577 transitions. Second operand 4 states. [2018-10-24 15:01:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:44,849 INFO L93 Difference]: Finished difference Result 621108 states and 705073 transitions. [2018-10-24 15:01:44,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:44,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 456 [2018-10-24 15:01:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:45,176 INFO L225 Difference]: With dead ends: 621108 [2018-10-24 15:01:45,177 INFO L226 Difference]: Without dead ends: 301326 [2018-10-24 15:01:45,310 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-24 15:01:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301326 states. [2018-10-24 15:01:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301326 to 301326. [2018-10-24 15:01:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301326 states. [2018-10-24 15:01:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301326 states to 301326 states and 330065 transitions. [2018-10-24 15:01:56,852 INFO L78 Accepts]: Start accepts. Automaton has 301326 states and 330065 transitions. Word has length 456 [2018-10-24 15:01:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:56,852 INFO L481 AbstractCegarLoop]: Abstraction has 301326 states and 330065 transitions. [2018-10-24 15:01:56,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 301326 states and 330065 transitions. [2018-10-24 15:01:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-24 15:01:56,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:56,957 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:01:56,958 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:56,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash -190490305, now seen corresponding path program 1 times [2018-10-24 15:01:56,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:56,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-24 15:01:57,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:57,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:57,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:57,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:57,383 INFO L87 Difference]: Start difference. First operand 301326 states and 330065 transitions. Second operand 4 states. [2018-10-24 15:02:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:00,643 INFO L93 Difference]: Finished difference Result 598467 states and 655778 transitions. [2018-10-24 15:02:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:00,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 510 [2018-10-24 15:02:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:00,980 INFO L225 Difference]: With dead ends: 598467 [2018-10-24 15:02:00,981 INFO L226 Difference]: Without dead ends: 297143 [2018-10-24 15:02:01,102 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-24 15:02:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297143 states. [2018-10-24 15:02:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297143 to 297021. [2018-10-24 15:02:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297021 states. [2018-10-24 15:02:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297021 states to 297021 states and 323925 transitions. [2018-10-24 15:02:05,538 INFO L78 Accepts]: Start accepts. Automaton has 297021 states and 323925 transitions. Word has length 510 [2018-10-24 15:02:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:05,538 INFO L481 AbstractCegarLoop]: Abstraction has 297021 states and 323925 transitions. [2018-10-24 15:02:05,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 297021 states and 323925 transitions. [2018-10-24 15:02:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2018-10-24 15:02:05,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:05,609 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 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, 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, 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, 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-24 15:02:05,610 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:05,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2037807737, now seen corresponding path program 1 times [2018-10-24 15:02:05,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:05,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:05,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:05,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:06,154 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:02:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2018-10-24 15:02:06,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:06,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:02:06,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:02:06,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:02:06,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:06,449 INFO L87 Difference]: Start difference. First operand 297021 states and 323925 transitions. Second operand 5 states. [2018-10-24 15:02:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:11,375 INFO L93 Difference]: Finished difference Result 743526 states and 807587 transitions. [2018-10-24 15:02:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:02:11,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 511 [2018-10-24 15:02:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:11,880 INFO L225 Difference]: With dead ends: 743526 [2018-10-24 15:02:11,880 INFO L226 Difference]: Without dead ends: 446507 [2018-10-24 15:02:12,029 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-24 15:02:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446507 states. [2018-10-24 15:02:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446507 to 438054. [2018-10-24 15:02:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438054 states. [2018-10-24 15:02:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438054 states to 438054 states and 474625 transitions. [2018-10-24 15:02:24,260 INFO L78 Accepts]: Start accepts. Automaton has 438054 states and 474625 transitions. Word has length 511 [2018-10-24 15:02:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:24,260 INFO L481 AbstractCegarLoop]: Abstraction has 438054 states and 474625 transitions. [2018-10-24 15:02:24,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:02:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 438054 states and 474625 transitions. [2018-10-24 15:02:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-24 15:02:24,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:24,416 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 15:02:24,416 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:24,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1770415728, now seen corresponding path program 1 times [2018-10-24 15:02:24,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:24,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-10-24 15:02:24,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:24,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:24,821 INFO L87 Difference]: Start difference. First operand 438054 states and 474625 transitions. Second operand 4 states. [2018-10-24 15:02:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:30,016 INFO L93 Difference]: Finished difference Result 891977 states and 967142 transitions. [2018-10-24 15:02:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:30,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2018-10-24 15:02:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:30,489 INFO L225 Difference]: With dead ends: 891977 [2018-10-24 15:02:30,489 INFO L226 Difference]: Without dead ends: 443675 [2018-10-24 15:02:30,679 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-24 15:02:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443675 states. [2018-10-24 15:02:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443675 to 433741. [2018-10-24 15:02:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433741 states. [2018-10-24 15:02:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433741 states to 433741 states and 464883 transitions. [2018-10-24 15:02:37,808 INFO L78 Accepts]: Start accepts. Automaton has 433741 states and 464883 transitions. Word has length 538 [2018-10-24 15:02:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:37,809 INFO L481 AbstractCegarLoop]: Abstraction has 433741 states and 464883 transitions. [2018-10-24 15:02:37,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 433741 states and 464883 transitions. [2018-10-24 15:02:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-24 15:02:37,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:37,929 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:02:37,929 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1715072247, now seen corresponding path program 1 times [2018-10-24 15:02:37,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:37,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 383 proven. 5 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-10-24 15:02:38,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:02:38,314 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-24 15:02:38,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:39,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:02:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2018-10-24 15:02:39,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:02:39,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-10-24 15:02:39,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:02:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:02:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:02:39,782 INFO L87 Difference]: Start difference. First operand 433741 states and 464883 transitions. Second operand 5 states. [2018-10-24 15:02:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:54,731 INFO L93 Difference]: Finished difference Result 2158867 states and 2304797 transitions. [2018-10-24 15:02:54,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 15:02:54,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 551 [2018-10-24 15:02:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:58,629 INFO L225 Difference]: With dead ends: 2158867 [2018-10-24 15:02:58,629 INFO L226 Difference]: Without dead ends: 1725128 [2018-10-24 15:02:58,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:02:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725128 states. [2018-10-24 15:03:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725128 to 1135472. [2018-10-24 15:03:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135472 states. [2018-10-24 15:03:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135472 states to 1135472 states and 1213328 transitions. [2018-10-24 15:03:40,675 INFO L78 Accepts]: Start accepts. Automaton has 1135472 states and 1213328 transitions. Word has length 551 [2018-10-24 15:03:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:40,675 INFO L481 AbstractCegarLoop]: Abstraction has 1135472 states and 1213328 transitions. [2018-10-24 15:03:40,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:03:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1135472 states and 1213328 transitions. [2018-10-24 15:03:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-24 15:03:40,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:40,864 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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, 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, 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-24 15:03:40,864 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:40,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash 109418730, now seen corresponding path program 1 times [2018-10-24 15:03:40,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:40,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:40,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:40,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 538 proven. 79 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-24 15:03:43,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:03:43,568 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-24 15:03:43,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:43,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:03:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-10-24 15:03:44,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:03:44,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 15:03:44,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 15:03:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 15:03:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-24 15:03:44,514 INFO L87 Difference]: Start difference. First operand 1135472 states and 1213328 transitions. Second operand 10 states. [2018-10-24 15:03:44,998 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 24 Received shutdown request... [2018-10-24 15:04:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-24 15:04:02,548 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:04:02,554 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:04:02,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:04:02 BoogieIcfgContainer [2018-10-24 15:04:02,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:04:02,555 INFO L168 Benchmark]: Toolchain (without parser) took 196605.03 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2018-10-24 15:04:02,558 INFO L168 Benchmark]: CDTParser took 0.17 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-24 15:04:02,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1171.72 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-24 15:04:02,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 323.14 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: -874.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-24 15:04:02,561 INFO L168 Benchmark]: Boogie Preprocessor took 143.04 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-24 15:04:02,561 INFO L168 Benchmark]: RCFGBuilder took 5386.81 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: 273.2 MB). Peak memory consumption was 273.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:04:02,563 INFO L168 Benchmark]: TraceAbstraction took 189575.02 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 2.5 GB in the end (delta: -615.3 MB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2018-10-24 15:04:02,569 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1171.72 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 323.14 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: -874.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.04 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 5386.81 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: 273.2 MB). Peak memory consumption was 273.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189575.02 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 1.9 GB in the beginning and 2.5 GB in the end (delta: -615.3 MB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1533). Cancelled while BasicCegarLoop was constructing difference of abstraction (1135472states) and FLOYD_HOARE automaton (currently 20 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (1208353 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 189.4s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 91.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4891 SDtfs, 14668 SDslu, 4881 SDs, 0 SdLazy, 20653 SolverSat, 4221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1219 GetRequests, 1154 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1135472occurred in iteration=19, 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: 84.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 645280 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 7487 NumberOfCodeBlocks, 7487 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7465 ConstructedInterpolants, 0 QuantifiedInterpolants, 8496646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1765 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 7417/7501 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown