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_label02_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:49:49,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:49:49,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:49:49,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:49:49,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:49:49,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:49:49,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:49:49,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:49:49,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:49:49,835 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:49:49,835 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:49:49,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:49:49,837 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:49:49,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:49:49,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:49:49,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:49:49,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:49:49,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:49:49,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:49:49,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:49:49,861 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:49:49,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:49:49,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:49:49,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:49:49,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:49:49,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:49:49,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:49:49,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:49:49,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:49:49,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:49:49,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:49:49,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:49:49,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:49:49,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:49:49,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:49:49,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:49:49,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:49:49,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:49:49,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:49:49,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:49:49,897 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:49:49,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:49:49,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:49:49,898 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:49:49,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:49:49,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:49:49,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:49:49,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:49:49,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:49:49,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:49:49,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:49:49,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:49:49,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:49:49,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:49:49,900 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:49:49,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:49:49,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:49:49,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:49:49,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:49:49,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:49:49,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:49:49,902 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:49:49,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:49:49,902 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:49:49,902 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:49:49,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:49:49,978 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:49:49,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:49:49,985 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:49:49,985 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:49:49,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label02_true-unreach-call.c [2018-10-23 18:49:50,052 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f5fea62d/de6f24b9aaa04563bd4c1a271875c3e1/FLAGbfba21a92 [2018-10-23 18:49:50,755 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:49:50,756 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label02_true-unreach-call.c [2018-10-23 18:49:50,777 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f5fea62d/de6f24b9aaa04563bd4c1a271875c3e1/FLAGbfba21a92 [2018-10-23 18:49:50,796 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f5fea62d/de6f24b9aaa04563bd4c1a271875c3e1 [2018-10-23 18:49:50,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:49:50,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:49:50,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:50,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:49:50,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:49:50,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d0bd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:50, skipping insertion in model container [2018-10-23 18:49:50,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:49:50" (1/1) ... [2018-10-23 18:49:50,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:49:50,908 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:49:51,635 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:51,641 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:49:51,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:49:51,914 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:49:51,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51 WrapperNode [2018-10-23 18:49:51,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:49:51,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:51,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:49:51,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:49:51,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:51,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:49:52,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:49:52,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:49:52,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:49:52,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... [2018-10-23 18:49:52,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:49:52,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:49:52,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:49:52,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:49:52,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:49:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:49:52,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:49:52,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:49:57,715 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:49:57,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:57 BoogieIcfgContainer [2018-10-23 18:49:57,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:49:57,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:49:57,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:49:57,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:49:57,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:49:50" (1/3) ... [2018-10-23 18:49:57,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63231b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:57, skipping insertion in model container [2018-10-23 18:49:57,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:49:51" (2/3) ... [2018-10-23 18:49:57,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63231b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:49:57, skipping insertion in model container [2018-10-23 18:49:57,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:49:57" (3/3) ... [2018-10-23 18:49:57,727 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label02_true-unreach-call.c [2018-10-23 18:49:57,737 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:49:57,747 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:49:57,766 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:49:57,801 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:49:57,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:49:57,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:49:57,802 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:49:57,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:49:57,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:49:57,802 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:49:57,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:49:57,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:49:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:49:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-23 18:49:57,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:49:57,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:49:57,850 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:49:57,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:49:57,856 INFO L82 PathProgramCache]: Analyzing trace with hash -855367630, now seen corresponding path program 1 times [2018-10-23 18:49:57,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:49:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:49:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:49:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:49:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:49:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:49:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:49:58,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:49:58,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:49:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:49:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:49:58,847 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:02,473 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-10-23 18:50:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:02,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-10-23 18:50:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:02,513 INFO L225 Difference]: With dead ends: 1079 [2018-10-23 18:50:02,513 INFO L226 Difference]: Without dead ends: 769 [2018-10-23 18:50:02,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-23 18:50:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-10-23 18:50:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-23 18:50:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-10-23 18:50:02,623 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 205 [2018-10-23 18:50:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:02,624 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-10-23 18:50:02,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-10-23 18:50:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-23 18:50:02,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:02,632 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:02,633 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:02,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash -749658221, now seen corresponding path program 1 times [2018-10-23 18:50:02,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:02,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:02,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:02,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:02,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:02,800 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-10-23 18:50:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:04,984 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-10-23 18:50:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:04,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-23 18:50:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:04,992 INFO L225 Difference]: With dead ends: 1449 [2018-10-23 18:50:04,992 INFO L226 Difference]: Without dead ends: 938 [2018-10-23 18:50:04,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-10-23 18:50:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-10-23 18:50:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-23 18:50:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-10-23 18:50:05,033 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 214 [2018-10-23 18:50:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:05,034 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-10-23 18:50:05,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-10-23 18:50:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-23 18:50:05,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:05,040 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:05,040 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:05,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1340362635, now seen corresponding path program 1 times [2018-10-23 18:50:05,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:05,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:05,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:05,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:05,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:05,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:05,183 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 3 states. [2018-10-23 18:50:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:08,124 INFO L93 Difference]: Finished difference Result 1823 states and 2997 transitions. [2018-10-23 18:50:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:08,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-23 18:50:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:08,131 INFO L225 Difference]: With dead ends: 1823 [2018-10-23 18:50:08,131 INFO L226 Difference]: Without dead ends: 902 [2018-10-23 18:50:08,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-10-23 18:50:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2018-10-23 18:50:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-10-23 18:50:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1435 transitions. [2018-10-23 18:50:08,153 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1435 transitions. Word has length 219 [2018-10-23 18:50:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:08,154 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1435 transitions. [2018-10-23 18:50:08,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1435 transitions. [2018-10-23 18:50:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-23 18:50:08,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:08,158 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:08,158 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:08,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:08,159 INFO L82 PathProgramCache]: Analyzing trace with hash 367372570, now seen corresponding path program 1 times [2018-10-23 18:50:08,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:08,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:08,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-23 18:50:08,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:08,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:08,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:08,348 INFO L87 Difference]: Start difference. First operand 902 states and 1435 transitions. Second operand 4 states. [2018-10-23 18:50:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:11,977 INFO L93 Difference]: Finished difference Result 3476 states and 5598 transitions. [2018-10-23 18:50:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:11,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-10-23 18:50:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:11,991 INFO L225 Difference]: With dead ends: 3476 [2018-10-23 18:50:11,991 INFO L226 Difference]: Without dead ends: 2576 [2018-10-23 18:50:11,993 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-23 18:50:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2018-10-23 18:50:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1723. [2018-10-23 18:50:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2018-10-23 18:50:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2603 transitions. [2018-10-23 18:50:12,032 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2603 transitions. Word has length 221 [2018-10-23 18:50:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:12,033 INFO L481 AbstractCegarLoop]: Abstraction has 1723 states and 2603 transitions. [2018-10-23 18:50:12,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2603 transitions. [2018-10-23 18:50:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-23 18:50:12,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:12,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:12,039 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:12,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1340097070, now seen corresponding path program 1 times [2018-10-23 18:50:12,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:12,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:12,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-23 18:50:12,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:12,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:12,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:12,220 INFO L87 Difference]: Start difference. First operand 1723 states and 2603 transitions. Second operand 3 states. [2018-10-23 18:50:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:12,676 INFO L93 Difference]: Finished difference Result 5159 states and 7797 transitions. [2018-10-23 18:50:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:12,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-10-23 18:50:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:12,694 INFO L225 Difference]: With dead ends: 5159 [2018-10-23 18:50:12,694 INFO L226 Difference]: Without dead ends: 3438 [2018-10-23 18:50:12,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2018-10-23 18:50:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3436. [2018-10-23 18:50:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-23 18:50:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 5189 transitions. [2018-10-23 18:50:12,775 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 5189 transitions. Word has length 228 [2018-10-23 18:50:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:12,775 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 5189 transitions. [2018-10-23 18:50:12,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 5189 transitions. [2018-10-23 18:50:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-23 18:50:12,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:12,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:12,783 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:12,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 369040310, now seen corresponding path program 1 times [2018-10-23 18:50:12,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:12,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:12,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:12,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:12,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:12,977 INFO L87 Difference]: Start difference. First operand 3436 states and 5189 transitions. Second operand 5 states. [2018-10-23 18:50:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:16,246 INFO L93 Difference]: Finished difference Result 7939 states and 12127 transitions. [2018-10-23 18:50:16,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:16,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2018-10-23 18:50:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:16,266 INFO L225 Difference]: With dead ends: 7939 [2018-10-23 18:50:16,266 INFO L226 Difference]: Without dead ends: 4505 [2018-10-23 18:50:16,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2018-10-23 18:50:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3640. [2018-10-23 18:50:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3640 states. [2018-10-23 18:50:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3640 states to 3640 states and 5424 transitions. [2018-10-23 18:50:16,349 INFO L78 Accepts]: Start accepts. Automaton has 3640 states and 5424 transitions. Word has length 245 [2018-10-23 18:50:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:16,349 INFO L481 AbstractCegarLoop]: Abstraction has 3640 states and 5424 transitions. [2018-10-23 18:50:16,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3640 states and 5424 transitions. [2018-10-23 18:50:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-23 18:50:16,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:16,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:16,359 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:16,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:16,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1623988030, now seen corresponding path program 1 times [2018-10-23 18:50:16,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:16,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:16,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:16,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:16,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:16,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:16,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:16,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:16,645 INFO L87 Difference]: Start difference. First operand 3640 states and 5424 transitions. Second operand 3 states. [2018-10-23 18:50:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:18,148 INFO L93 Difference]: Finished difference Result 8933 states and 13269 transitions. [2018-10-23 18:50:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:18,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-10-23 18:50:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:18,170 INFO L225 Difference]: With dead ends: 8933 [2018-10-23 18:50:18,171 INFO L226 Difference]: Without dead ends: 5295 [2018-10-23 18:50:18,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2018-10-23 18:50:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5293. [2018-10-23 18:50:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-10-23 18:50:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7795 transitions. [2018-10-23 18:50:18,348 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7795 transitions. Word has length 247 [2018-10-23 18:50:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:18,348 INFO L481 AbstractCegarLoop]: Abstraction has 5293 states and 7795 transitions. [2018-10-23 18:50:18,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7795 transitions. [2018-10-23 18:50:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-23 18:50:18,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:18,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:18,359 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:18,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -85762666, now seen corresponding path program 1 times [2018-10-23 18:50:18,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:18,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:18,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:18,770 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-23 18:50:19,010 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:50:19,207 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-23 18:50:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:19,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:19,257 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:50:19,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:19,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:19,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:50:19,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-23 18:50:19,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 18:50:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 18:50:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 18:50:19,660 INFO L87 Difference]: Start difference. First operand 5293 states and 7795 transitions. Second operand 7 states. [2018-10-23 18:50:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:24,950 INFO L93 Difference]: Finished difference Result 23061 states and 33566 transitions. [2018-10-23 18:50:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 18:50:24,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2018-10-23 18:50:24,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:25,013 INFO L225 Difference]: With dead ends: 23061 [2018-10-23 18:50:25,013 INFO L226 Difference]: Without dead ends: 17770 [2018-10-23 18:50:25,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-23 18:50:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2018-10-23 18:50:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17766. [2018-10-23 18:50:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17766 states. [2018-10-23 18:50:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17766 states to 17766 states and 23353 transitions. [2018-10-23 18:50:25,489 INFO L78 Accepts]: Start accepts. Automaton has 17766 states and 23353 transitions. Word has length 255 [2018-10-23 18:50:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:25,490 INFO L481 AbstractCegarLoop]: Abstraction has 17766 states and 23353 transitions. [2018-10-23 18:50:25,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 18:50:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 17766 states and 23353 transitions. [2018-10-23 18:50:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-23 18:50:25,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:25,525 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:25,525 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:25,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 507809544, now seen corresponding path program 1 times [2018-10-23 18:50:25,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:25,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-23 18:50:25,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:25,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:25,719 INFO L87 Difference]: Start difference. First operand 17766 states and 23353 transitions. Second operand 3 states. [2018-10-23 18:50:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:27,471 INFO L93 Difference]: Finished difference Result 49401 states and 64994 transitions. [2018-10-23 18:50:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:27,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2018-10-23 18:50:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:27,525 INFO L225 Difference]: With dead ends: 49401 [2018-10-23 18:50:27,526 INFO L226 Difference]: Without dead ends: 31637 [2018-10-23 18:50:27,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31637 states. [2018-10-23 18:50:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31637 to 31635. [2018-10-23 18:50:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2018-10-23 18:50:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 39361 transitions. [2018-10-23 18:50:27,956 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 39361 transitions. Word has length 284 [2018-10-23 18:50:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:27,956 INFO L481 AbstractCegarLoop]: Abstraction has 31635 states and 39361 transitions. [2018-10-23 18:50:27,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 39361 transitions. [2018-10-23 18:50:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-23 18:50:28,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:28,002 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:28,002 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:28,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1673718087, now seen corresponding path program 1 times [2018-10-23 18:50:28,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-23 18:50:28,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:50:28,362 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:50:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:28,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:50:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-23 18:50:28,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:50:28,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-23 18:50:28,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:28,662 INFO L87 Difference]: Start difference. First operand 31635 states and 39361 transitions. Second operand 5 states. [2018-10-23 18:50:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:31,495 INFO L93 Difference]: Finished difference Result 68576 states and 85864 transitions. [2018-10-23 18:50:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:31,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297 [2018-10-23 18:50:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:31,553 INFO L225 Difference]: With dead ends: 68576 [2018-10-23 18:50:31,553 INFO L226 Difference]: Without dead ends: 36943 [2018-10-23 18:50:31,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36943 states. [2018-10-23 18:50:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36943 to 36123. [2018-10-23 18:50:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36123 states. [2018-10-23 18:50:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36123 states to 36123 states and 42545 transitions. [2018-10-23 18:50:32,057 INFO L78 Accepts]: Start accepts. Automaton has 36123 states and 42545 transitions. Word has length 297 [2018-10-23 18:50:32,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:32,058 INFO L481 AbstractCegarLoop]: Abstraction has 36123 states and 42545 transitions. [2018-10-23 18:50:32,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 36123 states and 42545 transitions. [2018-10-23 18:50:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-23 18:50:32,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:32,122 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:50:32,122 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:32,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1535431556, now seen corresponding path program 1 times [2018-10-23 18:50:32,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-23 18:50:32,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:32,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:32,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:32,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:32,453 INFO L87 Difference]: Start difference. First operand 36123 states and 42545 transitions. Second operand 3 states. [2018-10-23 18:50:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:34,247 INFO L93 Difference]: Finished difference Result 99940 states and 116643 transitions. [2018-10-23 18:50:34,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:34,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 376 [2018-10-23 18:50:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:34,315 INFO L225 Difference]: With dead ends: 99940 [2018-10-23 18:50:34,316 INFO L226 Difference]: Without dead ends: 63819 [2018-10-23 18:50:34,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63819 states. [2018-10-23 18:50:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63819 to 62797. [2018-10-23 18:50:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62797 states. [2018-10-23 18:50:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62797 states to 62797 states and 72578 transitions. [2018-10-23 18:50:35,514 INFO L78 Accepts]: Start accepts. Automaton has 62797 states and 72578 transitions. Word has length 376 [2018-10-23 18:50:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:35,514 INFO L481 AbstractCegarLoop]: Abstraction has 62797 states and 72578 transitions. [2018-10-23 18:50:35,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 62797 states and 72578 transitions. [2018-10-23 18:50:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-23 18:50:35,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:35,560 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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] [2018-10-23 18:50:35,560 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:35,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1863338128, now seen corresponding path program 1 times [2018-10-23 18:50:35,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-23 18:50:36,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:36,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:36,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:36,033 INFO L87 Difference]: Start difference. First operand 62797 states and 72578 transitions. Second operand 4 states. [2018-10-23 18:50:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:38,479 INFO L93 Difference]: Finished difference Result 193045 states and 222475 transitions. [2018-10-23 18:50:38,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:38,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2018-10-23 18:50:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:38,622 INFO L225 Difference]: With dead ends: 193045 [2018-10-23 18:50:38,622 INFO L226 Difference]: Without dead ends: 130250 [2018-10-23 18:50:38,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130250 states. [2018-10-23 18:50:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130250 to 95427. [2018-10-23 18:50:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95427 states. [2018-10-23 18:50:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95427 states to 95427 states and 109051 transitions. [2018-10-23 18:50:40,508 INFO L78 Accepts]: Start accepts. Automaton has 95427 states and 109051 transitions. Word has length 380 [2018-10-23 18:50:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:40,508 INFO L481 AbstractCegarLoop]: Abstraction has 95427 states and 109051 transitions. [2018-10-23 18:50:40,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 95427 states and 109051 transitions. [2018-10-23 18:50:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-23 18:50:40,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:40,573 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:40,573 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1195384308, now seen corresponding path program 1 times [2018-10-23 18:50:40,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-23 18:50:40,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:40,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:40,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:40,841 INFO L87 Difference]: Start difference. First operand 95427 states and 109051 transitions. Second operand 3 states. [2018-10-23 18:50:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:42,612 INFO L93 Difference]: Finished difference Result 188403 states and 215277 transitions. [2018-10-23 18:50:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:42,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2018-10-23 18:50:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:42,710 INFO L225 Difference]: With dead ends: 188403 [2018-10-23 18:50:42,710 INFO L226 Difference]: Without dead ends: 92978 [2018-10-23 18:50:42,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92978 states. [2018-10-23 18:50:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92978 to 88890. [2018-10-23 18:50:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88890 states. [2018-10-23 18:50:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88890 states to 88890 states and 98457 transitions. [2018-10-23 18:50:44,579 INFO L78 Accepts]: Start accepts. Automaton has 88890 states and 98457 transitions. Word has length 392 [2018-10-23 18:50:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:44,579 INFO L481 AbstractCegarLoop]: Abstraction has 88890 states and 98457 transitions. [2018-10-23 18:50:44,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 88890 states and 98457 transitions. [2018-10-23 18:50:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-23 18:50:44,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:44,633 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:44,633 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:44,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash -752262207, now seen corresponding path program 1 times [2018-10-23 18:50:44,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:44,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:44,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:44,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:44,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:45,290 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-23 18:50:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-23 18:50:45,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:45,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:45,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:45,416 INFO L87 Difference]: Start difference. First operand 88890 states and 98457 transitions. Second operand 5 states. [2018-10-23 18:50:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:49,650 INFO L93 Difference]: Finished difference Result 395269 states and 435691 transitions. [2018-10-23 18:50:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:49,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2018-10-23 18:50:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:49,971 INFO L225 Difference]: With dead ends: 395269 [2018-10-23 18:50:49,971 INFO L226 Difference]: Without dead ends: 306381 [2018-10-23 18:50:50,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306381 states. [2018-10-23 18:50:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306381 to 229164. [2018-10-23 18:50:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229164 states. [2018-10-23 18:50:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229164 states to 229164 states and 251822 transitions. [2018-10-23 18:50:53,983 INFO L78 Accepts]: Start accepts. Automaton has 229164 states and 251822 transitions. Word has length 405 [2018-10-23 18:50:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:53,983 INFO L481 AbstractCegarLoop]: Abstraction has 229164 states and 251822 transitions. [2018-10-23 18:50:53,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 229164 states and 251822 transitions. [2018-10-23 18:50:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-23 18:50:54,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:54,032 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:50:54,032 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:54,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash 198739997, now seen corresponding path program 1 times [2018-10-23 18:50:54,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:54,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:54,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-23 18:50:54,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:54,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:54,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:54,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:54,361 INFO L87 Difference]: Start difference. First operand 229164 states and 251822 transitions. Second operand 3 states. [2018-10-23 18:50:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:58,339 INFO L93 Difference]: Finished difference Result 662223 states and 726717 transitions. [2018-10-23 18:50:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:58,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 406 [2018-10-23 18:50:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:58,871 INFO L225 Difference]: With dead ends: 662223 [2018-10-23 18:50:58,871 INFO L226 Difference]: Without dead ends: 433061 [2018-10-23 18:50:59,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433061 states. [2018-10-23 18:51:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433061 to 433059. [2018-10-23 18:51:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433059 states. [2018-10-23 18:51:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433059 states to 433059 states and 474837 transitions. [2018-10-23 18:51:11,017 INFO L78 Accepts]: Start accepts. Automaton has 433059 states and 474837 transitions. Word has length 406 [2018-10-23 18:51:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:11,017 INFO L481 AbstractCegarLoop]: Abstraction has 433059 states and 474837 transitions. [2018-10-23 18:51:11,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 433059 states and 474837 transitions. [2018-10-23 18:51:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-23 18:51:11,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:11,076 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:51:11,076 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:11,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:11,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1782633300, now seen corresponding path program 1 times [2018-10-23 18:51:11,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:11,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:11,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-23 18:51:11,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:11,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:51:11,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:11,432 INFO L87 Difference]: Start difference. First operand 433059 states and 474837 transitions. Second operand 3 states. [2018-10-23 18:51:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:16,623 INFO L93 Difference]: Finished difference Result 1074660 states and 1175096 transitions. [2018-10-23 18:51:16,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:16,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2018-10-23 18:51:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:17,591 INFO L225 Difference]: With dead ends: 1074660 [2018-10-23 18:51:17,591 INFO L226 Difference]: Without dead ends: 641603 [2018-10-23 18:51:17,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641603 states. [2018-10-23 18:51:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641603 to 641601. [2018-10-23 18:51:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641601 states. [2018-10-23 18:51:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641601 states to 641601 states and 700154 transitions. [2018-10-23 18:51:28,247 INFO L78 Accepts]: Start accepts. Automaton has 641601 states and 700154 transitions. Word has length 413 [2018-10-23 18:51:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:28,248 INFO L481 AbstractCegarLoop]: Abstraction has 641601 states and 700154 transitions. [2018-10-23 18:51:28,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 641601 states and 700154 transitions. [2018-10-23 18:51:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-23 18:51:28,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:28,322 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:28,322 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:28,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1682052167, now seen corresponding path program 1 times [2018-10-23 18:51:28,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:28,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-23 18:51:36,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:36,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 18:51:36,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:51:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:51:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:51:36,825 INFO L87 Difference]: Start difference. First operand 641601 states and 700154 transitions. Second operand 5 states. [2018-10-23 18:51:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:43,368 INFO L93 Difference]: Finished difference Result 1391620 states and 1517895 transitions. [2018-10-23 18:51:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:51:43,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 427 [2018-10-23 18:51:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:45,426 INFO L225 Difference]: With dead ends: 1391620 [2018-10-23 18:51:45,426 INFO L226 Difference]: Without dead ends: 750021 [2018-10-23 18:51:45,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:51:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750021 states. [2018-10-23 18:51:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750021 to 681782. [2018-10-23 18:51:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681782 states. [2018-10-23 18:51:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681782 states to 681782 states and 745845 transitions. [2018-10-23 18:51:55,289 INFO L78 Accepts]: Start accepts. Automaton has 681782 states and 745845 transitions. Word has length 427 [2018-10-23 18:51:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:55,290 INFO L481 AbstractCegarLoop]: Abstraction has 681782 states and 745845 transitions. [2018-10-23 18:51:55,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:51:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 681782 states and 745845 transitions. [2018-10-23 18:51:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-23 18:51:55,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:55,360 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:55,360 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:55,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:55,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2022441858, now seen corresponding path program 1 times [2018-10-23 18:51:55,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:55,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:55,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:55,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-23 18:51:57,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:57,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:57,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:57,271 INFO L87 Difference]: Start difference. First operand 681782 states and 745845 transitions. Second operand 4 states. [2018-10-23 18:52:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:10,077 INFO L93 Difference]: Finished difference Result 1326458 states and 1451848 transitions. [2018-10-23 18:52:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:10,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 430 [2018-10-23 18:52:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:10,840 INFO L225 Difference]: With dead ends: 1326458 [2018-10-23 18:52:10,841 INFO L226 Difference]: Without dead ends: 644678 [2018-10-23 18:52:11,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644678 states. [2018-10-23 18:52:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644678 to 644235. [2018-10-23 18:52:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644235 states. [2018-10-23 18:52:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644235 states to 644235 states and 701522 transitions. [2018-10-23 18:52:19,893 INFO L78 Accepts]: Start accepts. Automaton has 644235 states and 701522 transitions. Word has length 430 [2018-10-23 18:52:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:19,893 INFO L481 AbstractCegarLoop]: Abstraction has 644235 states and 701522 transitions. [2018-10-23 18:52:19,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 644235 states and 701522 transitions. [2018-10-23 18:52:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-23 18:52:19,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:19,952 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:52:19,952 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:19,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 470669778, now seen corresponding path program 1 times [2018-10-23 18:52:19,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:19,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:19,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:19,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:19,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-10-23 18:52:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:21,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:21,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:21,355 INFO L87 Difference]: Start difference. First operand 644235 states and 701522 transitions. Second operand 4 states. [2018-10-23 18:52:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:28,211 INFO L93 Difference]: Finished difference Result 1284246 states and 1400202 transitions. [2018-10-23 18:52:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:28,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 435 [2018-10-23 18:52:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:29,143 INFO L225 Difference]: With dead ends: 1284246 [2018-10-23 18:52:29,144 INFO L226 Difference]: Without dead ends: 640013 [2018-10-23 18:52:29,387 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-23 18:52:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640013 states. [2018-10-23 18:52:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640013 to 604299. [2018-10-23 18:52:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604299 states. [2018-10-23 18:52:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604299 states to 604299 states and 655077 transitions. [2018-10-23 18:52:49,410 INFO L78 Accepts]: Start accepts. Automaton has 604299 states and 655077 transitions. Word has length 435 [2018-10-23 18:52:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:49,411 INFO L481 AbstractCegarLoop]: Abstraction has 604299 states and 655077 transitions. [2018-10-23 18:52:49,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:52:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 604299 states and 655077 transitions. [2018-10-23 18:52:49,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-23 18:52:49,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:49,461 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:52:49,461 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:49,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:49,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1457690783, now seen corresponding path program 1 times [2018-10-23 18:52:49,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:49,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:49,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:49,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:49,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-23 18:52:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:49,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:52:49,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:49,879 INFO L87 Difference]: Start difference. First operand 604299 states and 655077 transitions. Second operand 4 states. [2018-10-23 18:52:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:58,228 INFO L93 Difference]: Finished difference Result 1472456 states and 1591501 transitions. [2018-10-23 18:52:58,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:58,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2018-10-23 18:52:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:59,280 INFO L225 Difference]: With dead ends: 1472456 [2018-10-23 18:52:59,280 INFO L226 Difference]: Without dead ends: 868159 [2018-10-23 18:52:59,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:53:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868159 states. Received shutdown request... [2018-10-23 18:53:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868159 to 691919. [2018-10-23 18:53:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691919 states. [2018-10-23 18:53:10,151 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:53:10,155 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:53:10,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:53:10 BoogieIcfgContainer [2018-10-23 18:53:10,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:53:10,156 INFO L168 Benchmark]: Toolchain (without parser) took 199350.70 ms. Allocated memory was 1.5 GB in the beginning and 6.7 GB in the end (delta: 5.2 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -635.0 MB). Peak memory consumption was 5.3 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:10,158 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:53:10,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1107.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:10,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:10,160 INFO L168 Benchmark]: Boogie Preprocessor took 145.78 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:10,160 INFO L168 Benchmark]: RCFGBuilder took 5344.31 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:10,161 INFO L168 Benchmark]: TraceAbstraction took 192437.00 ms. Allocated memory was 2.3 GB in the beginning and 6.7 GB in the end (delta: 4.4 GB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -110.5 MB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:10,166 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.25 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 1107.40 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 310.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -891.6 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.78 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.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5344.31 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 269.0 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192437.00 ms. Allocated memory was 2.3 GB in the beginning and 6.7 GB in the end (delta: 4.4 GB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -110.5 MB). Peak memory consumption was 5.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1647]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1647). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 192.3s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 90.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5976 SDtfs, 12123 SDslu, 3729 SDs, 0 SdLazy, 19126 SolverSat, 3854 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 576 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=681782occurred in iteration=17, 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: 82.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 224369 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 7077 NumberOfCodeBlocks, 7077 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7055 ConstructedInterpolants, 0 QuantifiedInterpolants, 4104398 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 4057/4069 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown