java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem12_label44_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:12:31,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:12:31,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:12:31,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:12:31,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:12:31,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:12:31,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:12:31,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:12:31,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:12:31,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:12:31,829 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:12:31,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:12:31,831 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:12:31,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:12:31,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:12:31,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:12:31,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:12:31,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:12:31,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:12:31,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:12:31,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:12:31,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:12:31,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:12:31,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:12:31,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:12:31,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:12:31,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:12:31,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:12:31,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:12:31,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:12:31,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:12:31,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:12:31,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:12:31,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:12:31,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:12:31,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:12:31,856 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:12:31,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:12:31,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:12:31,873 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:12:31,873 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:12:31,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:12:31,874 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:12:31,874 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:12:31,874 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:12:31,874 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:12:31,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:12:31,875 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:12:31,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:12:31,875 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:12:31,875 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:12:31,875 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:12:31,876 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:12:31,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:12:31,876 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:12:31,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:12:31,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:12:31,877 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:12:31,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:12:31,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:12:31,877 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:12:31,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:12:31,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:12:31,878 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:12:31,878 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:12:31,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:12:31,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:12:31,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:12:31,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:12:31,952 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:12:31,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label44_true-unreach-call.c [2018-11-06 21:12:32,012 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a911bbb/9f8148168e1b45a2af985fba8bddab08/FLAGb6bff4c34 [2018-11-06 21:12:32,846 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:12:32,847 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label44_true-unreach-call.c [2018-11-06 21:12:32,881 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a911bbb/9f8148168e1b45a2af985fba8bddab08/FLAGb6bff4c34 [2018-11-06 21:12:32,898 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a911bbb/9f8148168e1b45a2af985fba8bddab08 [2018-11-06 21:12:32,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:12:32,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:12:32,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:12:32,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:12:32,916 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:12:32,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:12:32" (1/1) ... [2018-11-06 21:12:32,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7293a3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:32, skipping insertion in model container [2018-11-06 21:12:32,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:12:32" (1/1) ... [2018-11-06 21:12:32,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:12:33,095 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:12:34,491 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:12:34,496 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:12:35,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:12:35,079 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:12:35,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35 WrapperNode [2018-11-06 21:12:35,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:12:35,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:12:35,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:12:35,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:12:35,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:12:35,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:12:35,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:12:35,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:12:35,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:35,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... [2018-11-06 21:12:36,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:12:36,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:12:36,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:12:36,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:12:36,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:12:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:12:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:12:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:12:45,872 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:12:45,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:12:45 BoogieIcfgContainer [2018-11-06 21:12:45,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:12:45,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:12:45,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:12:45,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:12:45,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:12:32" (1/3) ... [2018-11-06 21:12:45,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356a1b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:12:45, skipping insertion in model container [2018-11-06 21:12:45,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:12:35" (2/3) ... [2018-11-06 21:12:45,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356a1b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:12:45, skipping insertion in model container [2018-11-06 21:12:45,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:12:45" (3/3) ... [2018-11-06 21:12:45,883 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label44_true-unreach-call.c [2018-11-06 21:12:45,894 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:12:45,905 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:12:45,925 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:12:45,971 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:12:45,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:12:45,972 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:12:45,972 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:12:45,972 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:12:45,972 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:12:45,973 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:12:45,973 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:12:45,973 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:12:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states. [2018-11-06 21:12:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-06 21:12:46,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:12:46,020 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] [2018-11-06 21:12:46,022 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:12:46,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:12:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1316472986, now seen corresponding path program 1 times [2018-11-06 21:12:46,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:12:46,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:12:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:12:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:12:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:12:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:12:46,476 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:12:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:12:46,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:12:46,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:12:46,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:12:46,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:12:46,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:12:46,519 INFO L87 Difference]: Start difference. First operand 819 states. Second operand 4 states. [2018-11-06 21:12:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:12:57,937 INFO L93 Difference]: Finished difference Result 3146 states and 6134 transitions. [2018-11-06 21:12:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:12:57,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-06 21:12:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:12:57,984 INFO L225 Difference]: With dead ends: 3146 [2018-11-06 21:12:57,984 INFO L226 Difference]: Without dead ends: 2320 [2018-11-06 21:12:57,993 INFO L604 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-11-06 21:12:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2018-11-06 21:12:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2320. [2018-11-06 21:12:58,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-11-06 21:12:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3858 transitions. [2018-11-06 21:12:58,164 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3858 transitions. Word has length 51 [2018-11-06 21:12:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:12:58,165 INFO L480 AbstractCegarLoop]: Abstraction has 2320 states and 3858 transitions. [2018-11-06 21:12:58,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:12:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3858 transitions. [2018-11-06 21:12:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-06 21:12:58,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:12:58,175 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-11-06 21:12:58,175 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:12:58,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:12:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1148103894, now seen corresponding path program 1 times [2018-11-06 21:12:58,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:12:58,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:12:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:12:58,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:12:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:12:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:12:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:12:58,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:12:58,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:12:58,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:12:58,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:12:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:12:58,494 INFO L87 Difference]: Start difference. First operand 2320 states and 3858 transitions. Second operand 4 states. [2018-11-06 21:13:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:13:11,577 INFO L93 Difference]: Finished difference Result 9150 states and 15304 transitions. [2018-11-06 21:13:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:13:11,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-06 21:13:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:13:11,613 INFO L225 Difference]: With dead ends: 9150 [2018-11-06 21:13:11,613 INFO L226 Difference]: Without dead ends: 6832 [2018-11-06 21:13:11,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:13:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2018-11-06 21:13:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6832. [2018-11-06 21:13:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6832 states. [2018-11-06 21:13:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 9816 transitions. [2018-11-06 21:13:11,752 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 9816 transitions. Word has length 123 [2018-11-06 21:13:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:13:11,753 INFO L480 AbstractCegarLoop]: Abstraction has 6832 states and 9816 transitions. [2018-11-06 21:13:11,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:13:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 9816 transitions. [2018-11-06 21:13:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-06 21:13:11,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:13:11,772 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:13:11,772 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:13:11,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:13:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash -440396086, now seen corresponding path program 1 times [2018-11-06 21:13:11,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:13:11,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:13:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:13:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:13:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-06 21:13:12,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:13:12,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:13:12,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:13:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:13:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:13:12,162 INFO L87 Difference]: Start difference. First operand 6832 states and 9816 transitions. Second operand 4 states. [2018-11-06 21:13:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:13:19,230 INFO L93 Difference]: Finished difference Result 15918 states and 23062 transitions. [2018-11-06 21:13:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:13:19,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-11-06 21:13:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:13:19,280 INFO L225 Difference]: With dead ends: 15918 [2018-11-06 21:13:19,280 INFO L226 Difference]: Without dead ends: 9088 [2018-11-06 21:13:19,292 INFO L604 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-11-06 21:13:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2018-11-06 21:13:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9088. [2018-11-06 21:13:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2018-11-06 21:13:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 11694 transitions. [2018-11-06 21:13:19,449 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 11694 transitions. Word has length 233 [2018-11-06 21:13:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:13:19,450 INFO L480 AbstractCegarLoop]: Abstraction has 9088 states and 11694 transitions. [2018-11-06 21:13:19,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:13:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 11694 transitions. [2018-11-06 21:13:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-06 21:13:19,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:13:19,457 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:13:19,457 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:13:19,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:13:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1363377228, now seen corresponding path program 1 times [2018-11-06 21:13:19,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:13:19,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:13:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:13:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:13:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-06 21:13:19,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:13:19,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:13:19,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:13:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:13:19,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:13:19,763 INFO L87 Difference]: Start difference. First operand 9088 states and 11694 transitions. Second operand 4 states. [2018-11-06 21:13:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:13:26,884 INFO L93 Difference]: Finished difference Result 36238 states and 46664 transitions. [2018-11-06 21:13:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:13:26,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2018-11-06 21:13:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:13:26,959 INFO L225 Difference]: With dead ends: 36238 [2018-11-06 21:13:26,959 INFO L226 Difference]: Without dead ends: 27152 [2018-11-06 21:13:26,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:13:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27152 states. [2018-11-06 21:13:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27152 to 18112. [2018-11-06 21:13:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18112 states. [2018-11-06 21:13:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18112 states to 18112 states and 21666 transitions. [2018-11-06 21:13:27,278 INFO L78 Accepts]: Start accepts. Automaton has 18112 states and 21666 transitions. Word has length 244 [2018-11-06 21:13:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:13:27,279 INFO L480 AbstractCegarLoop]: Abstraction has 18112 states and 21666 transitions. [2018-11-06 21:13:27,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:13:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18112 states and 21666 transitions. [2018-11-06 21:13:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-06 21:13:27,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:13:27,288 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:13:27,289 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:13:27,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:13:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1317984070, now seen corresponding path program 1 times [2018-11-06 21:13:27,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:13:27,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:13:27,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:27,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:13:27,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:13:27,799 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-06 21:13:28,086 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-11-06 21:13:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 255 proven. 5 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-06 21:13:28,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:13:28,339 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:13:28,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:13:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:13:28,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:13:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-06 21:13:28,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:13:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-06 21:13:28,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:13:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:13:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:13:28,728 INFO L87 Difference]: Start difference. First operand 18112 states and 21666 transitions. Second operand 7 states. [2018-11-06 21:13:29,479 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-11-06 21:13:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:13:46,936 INFO L93 Difference]: Finished difference Result 73102 states and 85349 transitions. [2018-11-06 21:13:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:13:46,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 313 [2018-11-06 21:13:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:13:47,016 INFO L225 Difference]: With dead ends: 73102 [2018-11-06 21:13:47,017 INFO L226 Difference]: Without dead ends: 42906 [2018-11-06 21:13:47,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:13:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42906 states. [2018-11-06 21:13:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42906 to 28604. [2018-11-06 21:13:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28604 states. [2018-11-06 21:13:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28604 states to 28604 states and 31925 transitions. [2018-11-06 21:13:47,528 INFO L78 Accepts]: Start accepts. Automaton has 28604 states and 31925 transitions. Word has length 313 [2018-11-06 21:13:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:13:47,528 INFO L480 AbstractCegarLoop]: Abstraction has 28604 states and 31925 transitions. [2018-11-06 21:13:47,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:13:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 28604 states and 31925 transitions. [2018-11-06 21:13:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-06 21:13:47,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:13:47,549 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:13:47,549 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:13:47,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:13:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1848886404, now seen corresponding path program 1 times [2018-11-06 21:13:47,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:13:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:13:47,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:47,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:13:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:13:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-06 21:13:48,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:13:48,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:13:48,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:13:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:13:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:13:48,085 INFO L87 Difference]: Start difference. First operand 28604 states and 31925 transitions. Second operand 4 states. [2018-11-06 21:13:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:13:56,389 INFO L93 Difference]: Finished difference Result 103830 states and 116042 transitions. [2018-11-06 21:13:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:13:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2018-11-06 21:13:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:13:56,515 INFO L225 Difference]: With dead ends: 103830 [2018-11-06 21:13:56,516 INFO L226 Difference]: Without dead ends: 75228 [2018-11-06 21:13:56,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:13:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75228 states. [2018-11-06 21:13:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75228 to 69212. [2018-11-06 21:13:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69212 states. [2018-11-06 21:13:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69212 states to 69212 states and 76745 transitions. [2018-11-06 21:13:57,374 INFO L78 Accepts]: Start accepts. Automaton has 69212 states and 76745 transitions. Word has length 461 [2018-11-06 21:13:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:13:57,375 INFO L480 AbstractCegarLoop]: Abstraction has 69212 states and 76745 transitions. [2018-11-06 21:13:57,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:13:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 69212 states and 76745 transitions. [2018-11-06 21:13:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-11-06 21:13:57,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:13:57,406 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:13:57,406 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:13:57,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:13:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1756204320, now seen corresponding path program 1 times [2018-11-06 21:13:57,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:13:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:13:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:57,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:13:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:13:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:13:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-06 21:13:58,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:13:58,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:13:58,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:13:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:13:58,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:13:58,215 INFO L87 Difference]: Start difference. First operand 69212 states and 76745 transitions. Second operand 5 states. [2018-11-06 21:14:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:14:07,315 INFO L93 Difference]: Finished difference Result 202356 states and 225092 transitions. [2018-11-06 21:14:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:14:07,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 468 [2018-11-06 21:14:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:14:07,589 INFO L225 Difference]: With dead ends: 202356 [2018-11-06 21:14:07,589 INFO L226 Difference]: Without dead ends: 133898 [2018-11-06 21:14:07,666 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:14:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133898 states. [2018-11-06 21:14:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133898 to 100810. [2018-11-06 21:14:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100810 states. [2018-11-06 21:14:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100810 states to 100810 states and 109293 transitions. [2018-11-06 21:14:09,879 INFO L78 Accepts]: Start accepts. Automaton has 100810 states and 109293 transitions. Word has length 468 [2018-11-06 21:14:09,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:14:09,880 INFO L480 AbstractCegarLoop]: Abstraction has 100810 states and 109293 transitions. [2018-11-06 21:14:09,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:14:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 100810 states and 109293 transitions. [2018-11-06 21:14:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2018-11-06 21:14:10,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:14:10,082 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:14:10,082 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:14:10,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:14:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash -184787570, now seen corresponding path program 1 times [2018-11-06 21:14:10,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:14:10,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:14:10,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:14:10,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:14:10,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:14:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:14:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 611 proven. 5 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-06 21:14:10,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:14:10,971 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:14:10,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:14:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:14:11,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:14:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-06 21:14:12,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:14:12,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:14:12,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:14:12,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:14:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:14:12,663 INFO L87 Difference]: Start difference. First operand 100810 states and 109293 transitions. Second operand 5 states. [2018-11-06 21:14:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:14:25,349 INFO L93 Difference]: Finished difference Result 252743 states and 274701 transitions. [2018-11-06 21:14:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:14:25,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1007 [2018-11-06 21:14:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:14:25,558 INFO L225 Difference]: With dead ends: 252743 [2018-11-06 21:14:25,559 INFO L226 Difference]: Without dead ends: 152687 [2018-11-06 21:14:25,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1009 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:14:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152687 states. [2018-11-06 21:14:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152687 to 143663. [2018-11-06 21:14:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143663 states. [2018-11-06 21:14:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143663 states to 143663 states and 153230 transitions. [2018-11-06 21:14:27,086 INFO L78 Accepts]: Start accepts. Automaton has 143663 states and 153230 transitions. Word has length 1007 [2018-11-06 21:14:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:14:27,087 INFO L480 AbstractCegarLoop]: Abstraction has 143663 states and 153230 transitions. [2018-11-06 21:14:27,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:14:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 143663 states and 153230 transitions. [2018-11-06 21:14:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-11-06 21:14:27,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:14:27,179 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:14:27,180 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:14:27,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:14:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1368306688, now seen corresponding path program 1 times [2018-11-06 21:14:27,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:14:27,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:14:27,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:14:27,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:14:27,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:14:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:14:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-11-06 21:14:28,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:14:28,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:14:28,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:14:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:14:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:14:28,671 INFO L87 Difference]: Start difference. First operand 143663 states and 153230 transitions. Second operand 4 states. [2018-11-06 21:14:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:14:35,881 INFO L93 Difference]: Finished difference Result 284311 states and 303380 transitions. [2018-11-06 21:14:35,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:14:35,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1012 [2018-11-06 21:14:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:14:36,050 INFO L225 Difference]: With dead ends: 284311 [2018-11-06 21:14:36,050 INFO L226 Difference]: Without dead ends: 141402 [2018-11-06 21:14:36,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-06 21:14:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141402 states. [2018-11-06 21:14:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141402 to 138394. [2018-11-06 21:14:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138394 states. [2018-11-06 21:14:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138394 states to 138394 states and 145199 transitions. [2018-11-06 21:14:37,361 INFO L78 Accepts]: Start accepts. Automaton has 138394 states and 145199 transitions. Word has length 1012 [2018-11-06 21:14:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:14:37,362 INFO L480 AbstractCegarLoop]: Abstraction has 138394 states and 145199 transitions. [2018-11-06 21:14:37,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:14:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 138394 states and 145199 transitions. [2018-11-06 21:14:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-11-06 21:14:37,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:14:37,434 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:14:37,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:14:37,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:14:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1484921900, now seen corresponding path program 1 times [2018-11-06 21:14:37,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:14:37,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:14:37,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:14:37,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:14:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:14:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:14:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 147 proven. 380 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-06 21:14:39,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:14:39,991 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:14:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:14:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:14:40,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:14:40,648 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:14:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 23 proven. 504 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-06 21:14:42,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:14:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-06 21:14:42,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:14:42,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:14:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:14:42,603 INFO L87 Difference]: Start difference. First operand 138394 states and 145199 transitions. Second operand 9 states. [2018-11-06 21:15:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:11,913 INFO L93 Difference]: Finished difference Result 394860 states and 415251 transitions. [2018-11-06 21:15:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-06 21:15:11,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1035 [2018-11-06 21:15:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:12,218 INFO L225 Difference]: With dead ends: 394860 [2018-11-06 21:15:12,219 INFO L226 Difference]: Without dead ends: 254955 [2018-11-06 21:15:12,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 1031 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:15:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254955 states. [2018-11-06 21:15:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254955 to 189528. [2018-11-06 21:15:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189528 states. [2018-11-06 21:15:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189528 states to 189528 states and 199756 transitions. [2018-11-06 21:15:15,095 INFO L78 Accepts]: Start accepts. Automaton has 189528 states and 199756 transitions. Word has length 1035 [2018-11-06 21:15:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:15,097 INFO L480 AbstractCegarLoop]: Abstraction has 189528 states and 199756 transitions. [2018-11-06 21:15:15,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:15:15,097 INFO L276 IsEmpty]: Start isEmpty. Operand 189528 states and 199756 transitions. [2018-11-06 21:15:15,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2018-11-06 21:15:15,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:15,212 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:15:15,213 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:15,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1434971590, now seen corresponding path program 1 times [2018-11-06 21:15:15,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:15,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:15,645 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-06 21:15:16,398 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-11-06 21:15:16,664 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-11-06 21:15:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2018-11-06 21:15:21,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:15:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:15:21,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:15:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:15:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:15:21,340 INFO L87 Difference]: Start difference. First operand 189528 states and 199756 transitions. Second operand 6 states. [2018-11-06 21:15:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:30,671 INFO L93 Difference]: Finished difference Result 389583 states and 410422 transitions. [2018-11-06 21:15:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:15:30,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1160 [2018-11-06 21:15:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:30,883 INFO L225 Difference]: With dead ends: 389583 [2018-11-06 21:15:30,883 INFO L226 Difference]: Without dead ends: 196292 [2018-11-06 21:15:30,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:15:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196292 states. [2018-11-06 21:15:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196292 to 194787. [2018-11-06 21:15:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194787 states. [2018-11-06 21:15:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194787 states to 194787 states and 204580 transitions. [2018-11-06 21:15:33,321 INFO L78 Accepts]: Start accepts. Automaton has 194787 states and 204580 transitions. Word has length 1160 [2018-11-06 21:15:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:33,322 INFO L480 AbstractCegarLoop]: Abstraction has 194787 states and 204580 transitions. [2018-11-06 21:15:33,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:15:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 194787 states and 204580 transitions. [2018-11-06 21:15:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1234 [2018-11-06 21:15:33,433 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:33,434 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:15:33,434 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:33,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:33,434 INFO L82 PathProgramCache]: Analyzing trace with hash -659547543, now seen corresponding path program 1 times [2018-11-06 21:15:33,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:33,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:33,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 1061 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2018-11-06 21:15:35,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:15:35,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:15:35,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:15:35,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:15:35,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:15:35,514 INFO L87 Difference]: Start difference. First operand 194787 states and 204580 transitions. Second operand 4 states. [2018-11-06 21:15:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:42,266 INFO L93 Difference]: Finished difference Result 385812 states and 405255 transitions. [2018-11-06 21:15:42,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:15:42,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1233 [2018-11-06 21:15:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:42,494 INFO L225 Difference]: With dead ends: 385812 [2018-11-06 21:15:42,495 INFO L226 Difference]: Without dead ends: 186508 [2018-11-06 21:15:42,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-06 21:15:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186508 states. [2018-11-06 21:15:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186508 to 176732. [2018-11-06 21:15:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176732 states. [2018-11-06 21:15:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176732 states to 176732 states and 183924 transitions. [2018-11-06 21:15:44,946 INFO L78 Accepts]: Start accepts. Automaton has 176732 states and 183924 transitions. Word has length 1233 [2018-11-06 21:15:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:44,947 INFO L480 AbstractCegarLoop]: Abstraction has 176732 states and 183924 transitions. [2018-11-06 21:15:44,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:15:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 176732 states and 183924 transitions. [2018-11-06 21:15:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1249 [2018-11-06 21:15:45,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:45,034 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:15:45,034 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:45,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:45,035 INFO L82 PathProgramCache]: Analyzing trace with hash -645784276, now seen corresponding path program 1 times [2018-11-06 21:15:45,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:45,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:45,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:45,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:45,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1465 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-06 21:15:47,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:15:47,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:15:47,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:15:47,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:15:47,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:15:47,189 INFO L87 Difference]: Start difference. First operand 176732 states and 183924 transitions. Second operand 4 states. [2018-11-06 21:15:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:15:54,010 INFO L93 Difference]: Finished difference Result 372262 states and 387494 transitions. [2018-11-06 21:15:54,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:15:54,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1248 [2018-11-06 21:15:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:15:54,214 INFO L225 Difference]: With dead ends: 372262 [2018-11-06 21:15:54,214 INFO L226 Difference]: Without dead ends: 196284 [2018-11-06 21:15:54,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:15:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196284 states. [2018-11-06 21:15:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196284 to 167708. [2018-11-06 21:15:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167708 states. [2018-11-06 21:15:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167708 states to 167708 states and 171913 transitions. [2018-11-06 21:15:55,940 INFO L78 Accepts]: Start accepts. Automaton has 167708 states and 171913 transitions. Word has length 1248 [2018-11-06 21:15:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:15:55,941 INFO L480 AbstractCegarLoop]: Abstraction has 167708 states and 171913 transitions. [2018-11-06 21:15:55,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:15:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 167708 states and 171913 transitions. [2018-11-06 21:15:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1307 [2018-11-06 21:15:56,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:15:56,422 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:15:56,422 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:15:56,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:15:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 83421533, now seen corresponding path program 1 times [2018-11-06 21:15:56,423 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:15:56,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:15:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:56,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:56,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:15:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:57,083 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 21:15:57,480 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-06 21:15:57,869 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-11-06 21:15:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 947 proven. 143 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2018-11-06 21:15:59,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:15:59,347 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:15:59,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:15:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:15:59,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:16:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 1035 proven. 55 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2018-11-06 21:16:01,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:16:01,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-11-06 21:16:01,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 21:16:01,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 21:16:01,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:16:01,310 INFO L87 Difference]: Start difference. First operand 167708 states and 171913 transitions. Second operand 10 states. Received shutdown request... [2018-11-06 21:16:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:16:12,724 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:16:12,729 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:16:12,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:16:12 BoogieIcfgContainer [2018-11-06 21:16:12,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:16:12,731 INFO L168 Benchmark]: Toolchain (without parser) took 219821.23 ms. Allocated memory was 1.6 GB in the beginning and 4.8 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-06 21:16:12,732 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:16:12,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2168.46 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:16:12,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 615.60 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 789.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -976.9 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-11-06 21:16:12,734 INFO L168 Benchmark]: Boogie Preprocessor took 349.77 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:16:12,735 INFO L168 Benchmark]: RCFGBuilder took 9826.06 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 199.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -124.4 MB). Peak memory consumption was 598.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:16:12,736 INFO L168 Benchmark]: TraceAbstraction took 206855.34 ms. Allocated memory was 2.5 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: -245.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:16:12,741 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2168.46 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 615.60 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 789.1 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -976.9 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 349.77 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9826.06 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 199.8 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -124.4 MB). Peak memory consumption was 598.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206855.34 ms. Allocated memory was 2.5 GB in the beginning and 4.8 GB in the end (delta: 2.2 GB). Free memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: -245.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 162). Cancelled while BasicCegarLoop was constructing difference of abstraction (167708states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (54996 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 819 locations, 1 error locations. TIMEOUT Result, 206.7s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 160.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5828 SDtfs, 41552 SDslu, 1179 SDs, 0 SdLazy, 93555 SolverSat, 15698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 123.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3748 GetRequests, 3673 SyntacticMatches, 13 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194787occurred in iteration=11, 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: 16.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 179762 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 13555 NumberOfCodeBlocks, 13555 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 13537 ConstructedInterpolants, 0 QuantifiedInterpolants, 33134441 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4286 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 12269/13361 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown