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_label29_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:57:21,909 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:57:21,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:57:21,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:57:21,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:57:21,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:57:21,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:57:21,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:57:21,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:57:21,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:57:21,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:57:21,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:57:21,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:57:21,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:57:21,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:57:21,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:57:21,952 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:57:21,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:57:21,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:57:21,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:57:21,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:57:21,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:57:21,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:57:21,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:57:21,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:57:21,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:57:21,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:57:21,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:57:21,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:57:21,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:57:21,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:57:21,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:57:21,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:57:21,992 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:57:21,993 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:57:21,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:57:21,995 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:57:22,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:57:22,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:57:22,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:57:22,022 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:57:22,023 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:57:22,024 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:57:22,024 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:57:22,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:57:22,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:57:22,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:57:22,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:57:22,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:57:22,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:57:22,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:57:22,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:57:22,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:57:22,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:57:22,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:57:22,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:57:22,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:22,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:57:22,028 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:57:22,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:57:22,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:57:22,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:57:22,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:57:22,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:57:22,030 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:57:22,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:57:22,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:57:22,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:57:22,113 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:57:22,113 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:57:22,114 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c [2018-10-24 14:57:22,183 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f8953c83/c01bfca1a28c42c0806fea913c237aa2/FLAGf082895f8 [2018-10-24 14:57:22,895 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:57:22,898 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label29_true-unreach-call.c [2018-10-24 14:57:22,919 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f8953c83/c01bfca1a28c42c0806fea913c237aa2/FLAGf082895f8 [2018-10-24 14:57:22,938 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1f8953c83/c01bfca1a28c42c0806fea913c237aa2 [2018-10-24 14:57:22,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:57:22,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:57:22,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:22,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:57:22,958 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:57:22,959 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:22" (1/1) ... [2018-10-24 14:57:22,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6351e815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:22, skipping insertion in model container [2018-10-24 14:57:22,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:57:22" (1/1) ... [2018-10-24 14:57:22,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:57:23,064 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:57:23,788 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:23,794 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:57:24,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:57:24,136 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:57:24,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24 WrapperNode [2018-10-24 14:57:24,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:57:24,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:24,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:57:24,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:57:24,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:57:24,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:57:24,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:57:24,463 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:57:24,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... [2018-10-24 14:57:24,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:57:24,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:57:24,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:57:24,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:57:24,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:57:24,685 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:57:24,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:57:24,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:57:30,592 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:57:30,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:30 BoogieIcfgContainer [2018-10-24 14:57:30,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:57:30,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:57:30,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:57:30,598 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:57:30,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:57:22" (1/3) ... [2018-10-24 14:57:30,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fdb3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:30, skipping insertion in model container [2018-10-24 14:57:30,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:57:24" (2/3) ... [2018-10-24 14:57:30,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fdb3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:57:30, skipping insertion in model container [2018-10-24 14:57:30,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:57:30" (3/3) ... [2018-10-24 14:57:30,602 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label29_true-unreach-call.c [2018-10-24 14:57:30,613 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:57:30,622 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:57:30,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:57:30,683 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:57:30,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:57:30,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:57:30,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:57:30,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:57:30,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:57:30,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:57:30,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:57:30,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:57:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:57:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-24 14:57:30,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:30,734 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] [2018-10-24 14:57:30,737 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:30,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1558585738, now seen corresponding path program 1 times [2018-10-24 14:57:30,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:30,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:30,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:31,696 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:57:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:31,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:31,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:31,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:31,830 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:57:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:35,684 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-24 14:57:35,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:35,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-10-24 14:57:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:35,714 INFO L225 Difference]: With dead ends: 1089 [2018-10-24 14:57:35,714 INFO L226 Difference]: Without dead ends: 779 [2018-10-24 14:57:35,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-24 14:57:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-24 14:57:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 14:57:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-24 14:57:35,823 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 179 [2018-10-24 14:57:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:35,824 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-24 14:57:35,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-24 14:57:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 14:57:35,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:35,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:35,832 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:35,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -86535, now seen corresponding path program 1 times [2018-10-24 14:57:35,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:36,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:36,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:36,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:36,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:36,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:36,218 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-24 14:57:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:43,001 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-24 14:57:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:43,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-24 14:57:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:43,011 INFO L225 Difference]: With dead ends: 1904 [2018-10-24 14:57:43,011 INFO L226 Difference]: Without dead ends: 1391 [2018-10-24 14:57:43,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-24 14:57:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-24 14:57:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-24 14:57:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-24 14:57:43,088 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 185 [2018-10-24 14:57:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:43,088 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-24 14:57:43,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-24 14:57:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 14:57:43,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:43,102 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:57:43,102 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:43,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 534235966, now seen corresponding path program 1 times [2018-10-24 14:57:43,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:43,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:43,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:43,247 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-24 14:57:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:46,083 INFO L93 Difference]: Finished difference Result 2712 states and 4483 transitions. [2018-10-24 14:57:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:46,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-24 14:57:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:46,100 INFO L225 Difference]: With dead ends: 2712 [2018-10-24 14:57:46,100 INFO L226 Difference]: Without dead ends: 1787 [2018-10-24 14:57:46,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-10-24 14:57:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1783. [2018-10-24 14:57:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-10-24 14:57:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2737 transitions. [2018-10-24 14:57:46,150 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2737 transitions. Word has length 186 [2018-10-24 14:57:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:46,150 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2737 transitions. [2018-10-24 14:57:46,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2737 transitions. [2018-10-24 14:57:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-24 14:57:46,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:46,156 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] [2018-10-24 14:57:46,157 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:46,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1193220139, now seen corresponding path program 1 times [2018-10-24 14:57:46,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:46,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:46,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:46,276 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-24 14:57:46,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:46,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:46,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:46,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:46,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:46,278 INFO L87 Difference]: Start difference. First operand 1783 states and 2737 transitions. Second operand 3 states. [2018-10-24 14:57:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:48,125 INFO L93 Difference]: Finished difference Result 5213 states and 8072 transitions. [2018-10-24 14:57:48,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:48,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-24 14:57:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:48,145 INFO L225 Difference]: With dead ends: 5213 [2018-10-24 14:57:48,145 INFO L226 Difference]: Without dead ends: 3432 [2018-10-24 14:57:48,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2018-10-24 14:57:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3415. [2018-10-24 14:57:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2018-10-24 14:57:48,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5131 transitions. [2018-10-24 14:57:48,235 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5131 transitions. Word has length 188 [2018-10-24 14:57:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:48,236 INFO L481 AbstractCegarLoop]: Abstraction has 3415 states and 5131 transitions. [2018-10-24 14:57:48,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:48,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5131 transitions. [2018-10-24 14:57:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 14:57:48,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:48,244 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:57:48,245 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:48,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -280439908, now seen corresponding path program 1 times [2018-10-24 14:57:48,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:48,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:48,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:48,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:48,546 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 14:57:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:48,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:48,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:48,693 INFO L87 Difference]: Start difference. First operand 3415 states and 5131 transitions. Second operand 4 states. [2018-10-24 14:57:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:50,799 INFO L93 Difference]: Finished difference Result 13155 states and 19899 transitions. [2018-10-24 14:57:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:50,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-24 14:57:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:50,838 INFO L225 Difference]: With dead ends: 13155 [2018-10-24 14:57:50,839 INFO L226 Difference]: Without dead ends: 9742 [2018-10-24 14:57:50,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9742 states. [2018-10-24 14:57:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9742 to 9740. [2018-10-24 14:57:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9740 states. [2018-10-24 14:57:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9740 states to 9740 states and 12804 transitions. [2018-10-24 14:57:51,023 INFO L78 Accepts]: Start accepts. Automaton has 9740 states and 12804 transitions. Word has length 199 [2018-10-24 14:57:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:51,024 INFO L481 AbstractCegarLoop]: Abstraction has 9740 states and 12804 transitions. [2018-10-24 14:57:51,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:57:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 9740 states and 12804 transitions. [2018-10-24 14:57:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 14:57:51,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:51,042 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] [2018-10-24 14:57:51,042 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:51,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 693271054, now seen corresponding path program 1 times [2018-10-24 14:57:51,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:51,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:51,510 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 14:57:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:57:51,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:51,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:57:51,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:57:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:57:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:51,549 INFO L87 Difference]: Start difference. First operand 9740 states and 12804 transitions. Second operand 5 states. [2018-10-24 14:57:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:54,919 INFO L93 Difference]: Finished difference Result 33361 states and 43963 transitions. [2018-10-24 14:57:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:57:54,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2018-10-24 14:57:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:54,990 INFO L225 Difference]: With dead ends: 33361 [2018-10-24 14:57:54,990 INFO L226 Difference]: Without dead ends: 23623 [2018-10-24 14:57:55,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:57:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23623 states. [2018-10-24 14:57:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23623 to 19867. [2018-10-24 14:57:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19867 states. [2018-10-24 14:57:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19867 states to 19867 states and 25791 transitions. [2018-10-24 14:57:55,734 INFO L78 Accepts]: Start accepts. Automaton has 19867 states and 25791 transitions. Word has length 219 [2018-10-24 14:57:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:55,734 INFO L481 AbstractCegarLoop]: Abstraction has 19867 states and 25791 transitions. [2018-10-24 14:57:55,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:57:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 19867 states and 25791 transitions. [2018-10-24 14:57:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-24 14:57:55,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:55,772 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:55,773 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:55,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -233162514, now seen corresponding path program 1 times [2018-10-24 14:57:55,774 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:55,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:55,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:55,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 14:57:55,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:55,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:57:55,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:57:55,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:57:55,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:55,977 INFO L87 Difference]: Start difference. First operand 19867 states and 25791 transitions. Second operand 3 states. [2018-10-24 14:57:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:57,271 INFO L93 Difference]: Finished difference Result 39073 states and 50587 transitions. [2018-10-24 14:57:57,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:57:57,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-24 14:57:57,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:57,317 INFO L225 Difference]: With dead ends: 39073 [2018-10-24 14:57:57,318 INFO L226 Difference]: Without dead ends: 19208 [2018-10-24 14:57:57,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:57:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19208 states. [2018-10-24 14:57:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19208 to 19208. [2018-10-24 14:57:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-10-24 14:57:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 24265 transitions. [2018-10-24 14:57:57,651 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 24265 transitions. Word has length 244 [2018-10-24 14:57:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:57,651 INFO L481 AbstractCegarLoop]: Abstraction has 19208 states and 24265 transitions. [2018-10-24 14:57:57,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:57:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 24265 transitions. [2018-10-24 14:57:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-24 14:57:57,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:57,673 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:57,674 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:57,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1395890500, now seen corresponding path program 1 times [2018-10-24 14:57:57,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:57,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:57,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:57,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:57,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:57:58,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:57:58,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:57:58,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:58,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:58,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:58,087 INFO L87 Difference]: Start difference. First operand 19208 states and 24265 transitions. Second operand 4 states. [2018-10-24 14:57:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:59,987 INFO L93 Difference]: Finished difference Result 38350 states and 48460 transitions. [2018-10-24 14:57:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:59,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2018-10-24 14:57:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:00,029 INFO L225 Difference]: With dead ends: 38350 [2018-10-24 14:58:00,029 INFO L226 Difference]: Without dead ends: 19144 [2018-10-24 14:58:00,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2018-10-24 14:58:00,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19144. [2018-10-24 14:58:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19144 states. [2018-10-24 14:58:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19144 states to 19144 states and 22596 transitions. [2018-10-24 14:58:00,296 INFO L78 Accepts]: Start accepts. Automaton has 19144 states and 22596 transitions. Word has length 270 [2018-10-24 14:58:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:00,297 INFO L481 AbstractCegarLoop]: Abstraction has 19144 states and 22596 transitions. [2018-10-24 14:58:00,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19144 states and 22596 transitions. [2018-10-24 14:58:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-24 14:58:00,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:00,320 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:00,320 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:00,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1302232778, now seen corresponding path program 1 times [2018-10-24 14:58:00,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:00,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:00,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:58:00,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:00,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:00,767 INFO L87 Difference]: Start difference. First operand 19144 states and 22596 transitions. Second operand 4 states. [2018-10-24 14:58:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:02,458 INFO L93 Difference]: Finished difference Result 56812 states and 66932 transitions. [2018-10-24 14:58:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:02,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-10-24 14:58:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:02,544 INFO L225 Difference]: With dead ends: 56812 [2018-10-24 14:58:02,545 INFO L226 Difference]: Without dead ends: 37670 [2018-10-24 14:58:02,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37670 states. [2018-10-24 14:58:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37670 to 37668. [2018-10-24 14:58:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2018-10-24 14:58:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 44294 transitions. [2018-10-24 14:58:03,065 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 44294 transitions. Word has length 282 [2018-10-24 14:58:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:03,065 INFO L481 AbstractCegarLoop]: Abstraction has 37668 states and 44294 transitions. [2018-10-24 14:58:03,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 44294 transitions. [2018-10-24 14:58:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-24 14:58:03,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:03,086 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 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, 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] [2018-10-24 14:58:03,086 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:03,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1963981493, now seen corresponding path program 1 times [2018-10-24 14:58:03,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:03,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:03,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:58:03,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:03,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:03,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:58:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:58:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:03,436 INFO L87 Difference]: Start difference. First operand 37668 states and 44294 transitions. Second operand 4 states. [2018-10-24 14:58:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:06,021 INFO L93 Difference]: Finished difference Result 149002 states and 174885 transitions. [2018-10-24 14:58:06,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:58:06,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2018-10-24 14:58:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:06,163 INFO L225 Difference]: With dead ends: 149002 [2018-10-24 14:58:06,163 INFO L226 Difference]: Without dead ends: 111336 [2018-10-24 14:58:06,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:58:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111336 states. [2018-10-24 14:58:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111336 to 92807. [2018-10-24 14:58:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92807 states. [2018-10-24 14:58:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92807 states to 92807 states and 108696 transitions. [2018-10-24 14:58:07,682 INFO L78 Accepts]: Start accepts. Automaton has 92807 states and 108696 transitions. Word has length 283 [2018-10-24 14:58:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:07,682 INFO L481 AbstractCegarLoop]: Abstraction has 92807 states and 108696 transitions. [2018-10-24 14:58:07,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 92807 states and 108696 transitions. [2018-10-24 14:58:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-24 14:58:07,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:07,701 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:07,701 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:07,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash -522758865, now seen corresponding path program 1 times [2018-10-24 14:58:07,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 111 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:58:08,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:08,067 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:58:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:08,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:58:08,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:08,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-10-24 14:58:08,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:58:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:58:08,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:08,440 INFO L87 Difference]: Start difference. First operand 92807 states and 108696 transitions. Second operand 5 states. [2018-10-24 14:58:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:12,963 INFO L93 Difference]: Finished difference Result 618265 states and 722483 transitions. [2018-10-24 14:58:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 14:58:12,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2018-10-24 14:58:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:13,733 INFO L225 Difference]: With dead ends: 618265 [2018-10-24 14:58:13,733 INFO L226 Difference]: Without dead ends: 525460 [2018-10-24 14:58:13,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:58:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525460 states. [2018-10-24 14:58:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525460 to 351464. [2018-10-24 14:58:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351464 states. [2018-10-24 14:58:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351464 states to 351464 states and 410348 transitions. [2018-10-24 14:58:20,980 INFO L78 Accepts]: Start accepts. Automaton has 351464 states and 410348 transitions. Word has length 291 [2018-10-24 14:58:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:20,980 INFO L481 AbstractCegarLoop]: Abstraction has 351464 states and 410348 transitions. [2018-10-24 14:58:20,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 351464 states and 410348 transitions. [2018-10-24 14:58:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-24 14:58:21,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:21,000 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:58:21,001 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:21,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1983100851, now seen corresponding path program 1 times [2018-10-24 14:58:21,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:21,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:21,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:21,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 14:58:21,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:21,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:58:21,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:21,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:21,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:21,181 INFO L87 Difference]: Start difference. First operand 351464 states and 410348 transitions. Second operand 3 states. [2018-10-24 14:58:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:24,773 INFO L93 Difference]: Finished difference Result 693760 states and 809918 transitions. [2018-10-24 14:58:24,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:24,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2018-10-24 14:58:24,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:27,703 INFO L225 Difference]: With dead ends: 693760 [2018-10-24 14:58:27,703 INFO L226 Difference]: Without dead ends: 342298 [2018-10-24 14:58:27,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342298 states. [2018-10-24 14:58:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342298 to 335627. [2018-10-24 14:58:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335627 states. [2018-10-24 14:58:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335627 states to 335627 states and 379986 transitions. [2018-10-24 14:58:39,440 INFO L78 Accepts]: Start accepts. Automaton has 335627 states and 379986 transitions. Word has length 305 [2018-10-24 14:58:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:39,441 INFO L481 AbstractCegarLoop]: Abstraction has 335627 states and 379986 transitions. [2018-10-24 14:58:39,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 335627 states and 379986 transitions. [2018-10-24 14:58:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-24 14:58:39,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:39,459 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:39,459 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:39,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash 968461030, now seen corresponding path program 1 times [2018-10-24 14:58:39,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:39,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:39,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:39,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 14:58:39,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:39,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:58:39,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:58:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:58:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:39,646 INFO L87 Difference]: Start difference. First operand 335627 states and 379986 transitions. Second operand 3 states. [2018-10-24 14:58:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:44,040 INFO L93 Difference]: Finished difference Result 839543 states and 950224 transitions. [2018-10-24 14:58:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:58:44,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-24 14:58:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:46,338 INFO L225 Difference]: With dead ends: 839543 [2018-10-24 14:58:46,338 INFO L226 Difference]: Without dead ends: 503918 [2018-10-24 14:58:46,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:58:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503918 states. [2018-10-24 14:58:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503918 to 503898. [2018-10-24 14:58:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503898 states. [2018-10-24 14:58:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503898 states to 503898 states and 569727 transitions. [2018-10-24 14:58:53,723 INFO L78 Accepts]: Start accepts. Automaton has 503898 states and 569727 transitions. Word has length 317 [2018-10-24 14:58:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:53,723 INFO L481 AbstractCegarLoop]: Abstraction has 503898 states and 569727 transitions. [2018-10-24 14:58:53,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:58:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 503898 states and 569727 transitions. [2018-10-24 14:58:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-24 14:58:53,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:53,757 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:53,757 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:53,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:53,758 INFO L82 PathProgramCache]: Analyzing trace with hash -879595334, now seen corresponding path program 1 times [2018-10-24 14:58:53,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:53,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:53,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-24 14:58:53,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:53,988 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:58:53,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:54,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-24 14:58:55,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-10-24 14:58:55,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:58:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:58:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:58:55,429 INFO L87 Difference]: Start difference. First operand 503898 states and 569727 transitions. Second operand 6 states. [2018-10-24 14:59:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:59:14,461 INFO L93 Difference]: Finished difference Result 1984010 states and 2220734 transitions. [2018-10-24 14:59:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:59:14,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 325 [2018-10-24 14:59:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:59:18,031 INFO L225 Difference]: With dead ends: 1984010 [2018-10-24 14:59:18,031 INFO L226 Difference]: Without dead ends: 1480114 [2018-10-24 14:59:18,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:59:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480114 states. [2018-10-24 14:59:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480114 to 1463460. [2018-10-24 14:59:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463460 states. [2018-10-24 15:00:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463460 states to 1463460 states and 1611127 transitions. [2018-10-24 15:00:02,777 INFO L78 Accepts]: Start accepts. Automaton has 1463460 states and 1611127 transitions. Word has length 325 [2018-10-24 15:00:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:02,778 INFO L481 AbstractCegarLoop]: Abstraction has 1463460 states and 1611127 transitions. [2018-10-24 15:00:02,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 15:00:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1463460 states and 1611127 transitions. [2018-10-24 15:00:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-24 15:00:02,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:02,879 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 15:00:02,879 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:02,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:02,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1429019348, now seen corresponding path program 1 times [2018-10-24 15:00:02,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:02,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:03,507 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:00:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-10-24 15:00:03,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:03,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:00:03,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:00:03,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:00:03,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:00:03,574 INFO L87 Difference]: Start difference. First operand 1463460 states and 1611127 transitions. Second operand 5 states. Received shutdown request... [2018-10-24 15:00:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:00:30,797 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:00:30,803 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:00:30,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:30 BoogieIcfgContainer [2018-10-24 15:00:30,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:00:30,805 INFO L168 Benchmark]: Toolchain (without parser) took 187853.51 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 5.8 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:30,806 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:00:30,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1184.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:30,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 323.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:30,808 INFO L168 Benchmark]: Boogie Preprocessor took 152.11 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:30,809 INFO L168 Benchmark]: RCFGBuilder took 5978.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.4 MB). Peak memory consumption was 251.4 MB. Max. memory is 7.1 GB. [2018-10-24 15:00:30,810 INFO L168 Benchmark]: TraceAbstraction took 180209.27 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. [2018-10-24 15:00:30,815 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1184.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 323.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -865.9 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.11 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5978.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 251.4 MB). Peak memory consumption was 251.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180209.27 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1569]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1569). Cancelled while BasicCegarLoop was constructing difference of abstraction (1463460states) and FLOYD_HOARE automaton (currently 5 states, 5 states before enhancement),while ReachableStatesComputation was computing reachable states (1627990 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 180.1s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 97.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3104 SDtfs, 13148 SDslu, 3462 SDs, 0 SdLazy, 15414 SolverSat, 3511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 628 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463460occurred in iteration=14, 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: 74.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 220379 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 4414 NumberOfCodeBlocks, 4414 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4397 ConstructedInterpolants, 0 QuantifiedInterpolants, 2285733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 2006/2015 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown